From 8030393136cac39ad0eeea5fe9fb74bdc0a66d66 Mon Sep 17 00:00:00 2001 From: c-cube Date: Tue, 7 Dec 2021 15:22:59 +0000 Subject: [PATCH] deploy: a614fdb2e1e30277e6b0c9c19e63303260e09d04 --- dev/odoc.css | 2 +- dev/sidekick-base/Sidekick_base/Base_types/Cstor/index.html | 2 +- dev/sidekick-base/Sidekick_base/Base_types/Data/index.html | 2 +- dev/sidekick-base/Sidekick_base/Base_types/Fun/index.html | 2 +- dev/sidekick-base/Sidekick_base/Base_types/Select/index.html | 2 +- dev/sidekick-base/Sidekick_base/Base_types/Statement/index.html | 2 +- .../Sidekick_base/Base_types/Term/Iter_dag/index.html | 2 +- dev/sidekick-base/Sidekick_base/Base_types/Term/LRA/index.html | 2 +- dev/sidekick-base/Sidekick_base/Base_types/Term/index.html | 2 +- .../Base_types/Term_cell/Make_eq/argument-1-X/index.html | 2 +- .../Sidekick_base/Base_types/Term_cell/Make_eq/index.html | 2 +- dev/sidekick-base/Sidekick_base/Base_types/Term_cell/index.html | 2 +- .../Base_types/Term_cell/module-type-ARG/index.html | 2 +- dev/sidekick-base/Sidekick_base/Base_types/Ty/Fun/index.html | 2 +- dev/sidekick-base/Sidekick_base/Base_types/Ty/index.html | 2 +- dev/sidekick-base/Sidekick_base/Base_types/Value/index.html | 2 +- dev/sidekick-base/Sidekick_base/Base_types/index.html | 2 +- dev/sidekick-base/Sidekick_base/Form/Funs/index.html | 2 +- dev/sidekick-base/Sidekick_base/Form/Gensym/index.html | 2 +- dev/sidekick-base/Sidekick_base/Form/index.html | 2 +- dev/sidekick-base/Sidekick_base/ID/index.html | 2 +- dev/sidekick-base/Sidekick_base/Lit/index.html | 2 +- .../Sidekick_base/Model/Fun_interpretation/index.html | 2 +- dev/sidekick-base/Sidekick_base/Model/Val_map/index.html | 2 +- dev/sidekick-base/Sidekick_base/Model/index.html | 2 +- dev/sidekick-base/Sidekick_base/Proof/Config/index.html | 2 +- dev/sidekick-base/Sidekick_base/Proof/Step_vec/index.html | 2 +- dev/sidekick-base/Sidekick_base/Proof/Unsafe_/index.html | 2 +- dev/sidekick-base/Sidekick_base/Proof/index.html | 2 +- dev/sidekick-base/Sidekick_base/Proof_dummy/Step_vec/index.html | 2 +- dev/sidekick-base/Sidekick_base/Proof_dummy/index.html | 2 +- dev/sidekick-base/Sidekick_base/Proof_quip/index.html | 2 +- dev/sidekick-base/Sidekick_base/Solver_arg/Fun/index.html | 2 +- dev/sidekick-base/Sidekick_base/Solver_arg/Term/index.html | 2 +- dev/sidekick-base/Sidekick_base/Solver_arg/Ty/index.html | 2 +- dev/sidekick-base/Sidekick_base/Solver_arg/index.html | 2 +- dev/sidekick-base/Sidekick_base/index.html | 2 +- dev/sidekick-base/Sidekick_base__/index.html | 2 +- dev/sidekick-base/Sidekick_base__Base_types/index.html | 2 +- dev/sidekick-base/Sidekick_base__CCHet/index.html | 2 +- dev/sidekick-base/Sidekick_base__Config/index.html | 2 +- dev/sidekick-base/Sidekick_base__Form/index.html | 2 +- dev/sidekick-base/Sidekick_base__Hashcons/index.html | 2 +- dev/sidekick-base/Sidekick_base__ID/index.html | 2 +- dev/sidekick-base/Sidekick_base__Lit/index.html | 2 +- dev/sidekick-base/Sidekick_base__Model/index.html | 2 +- dev/sidekick-base/Sidekick_base__Proof/index.html | 2 +- dev/sidekick-base/Sidekick_base__Proof_dummy/index.html | 2 +- dev/sidekick-base/Sidekick_base__Proof_quip/index.html | 2 +- dev/sidekick-base/Sidekick_base__Solver_arg/index.html | 2 +- .../Sidekick_base_proof_trace/Proof_ser/Bare/Decode/index.html | 2 +- .../Sidekick_base_proof_trace/Proof_ser/Bare/Encode/index.html | 2 +- .../Sidekick_base_proof_trace/Proof_ser/Bare/Pp/index.html | 2 +- .../Proof_ser/Bare/String_map/index.html | 2 +- .../Sidekick_base_proof_trace/Proof_ser/Bare/index.html | 2 +- .../Sidekick_base_proof_trace/Proof_ser/Clause/index.html | 2 +- .../Sidekick_base_proof_trace/Proof_ser/Expr_app/index.html | 2 +- .../Sidekick_base_proof_trace/Proof_ser/Expr_bool/index.html | 2 +- .../Sidekick_base_proof_trace/Proof_ser/Expr_def/index.html | 2 +- .../Sidekick_base_proof_trace/Proof_ser/Expr_eq/index.html | 2 +- .../Sidekick_base_proof_trace/Proof_ser/Expr_if/index.html | 2 +- .../Sidekick_base_proof_trace/Proof_ser/Expr_not/index.html | 2 +- .../Sidekick_base_proof_trace/Proof_ser/Fun_decl/index.html | 2 +- .../Sidekick_base_proof_trace/Proof_ser/ID/index.html | 2 +- .../Sidekick_base_proof_trace/Proof_ser/Lit/index.html | 2 +- .../Sidekick_base_proof_trace/Proof_ser/Step/index.html | 2 +- .../Sidekick_base_proof_trace/Proof_ser/Step_bool_c/index.html | 2 +- .../Proof_ser/Step_bool_tauto/index.html | 2 +- .../Proof_ser/Step_bridge_lit_expr/index.html | 2 +- .../Sidekick_base_proof_trace/Proof_ser/Step_cc/index.html | 2 +- .../Proof_ser/Step_clause_rw/index.html | 2 +- .../Sidekick_base_proof_trace/Proof_ser/Step_input/index.html | 2 +- .../Proof_ser/Step_preprocess/index.html | 2 +- .../Proof_ser/Step_proof_p1/index.html | 2 +- .../Sidekick_base_proof_trace/Proof_ser/Step_rup/index.html | 2 +- .../Sidekick_base_proof_trace/Proof_ser/Step_true/index.html | 2 +- .../Sidekick_base_proof_trace/Proof_ser/Step_unsat/index.html | 2 +- .../Sidekick_base_proof_trace/Proof_ser/Step_view/index.html | 2 +- .../Sidekick_base_proof_trace/Proof_ser/index.html | 2 +- dev/sidekick-base/Sidekick_base_proof_trace/Storage/index.html | 2 +- dev/sidekick-base/Sidekick_base_proof_trace/index.html | 2 +- dev/sidekick-base/Sidekick_base_proof_trace__/index.html | 2 +- .../Sidekick_base_proof_trace__Proof_ser/index.html | 2 +- dev/sidekick-base/Sidekick_base_proof_trace__Storage/index.html | 2 +- .../Sidekick_base_solver/Solver/Lit/T/Fun/index.html | 2 +- .../Sidekick_base_solver/Solver/Lit/T/Term/Tbl/index.html | 2 +- .../Sidekick_base_solver/Solver/Lit/T/Term/index.html | 2 +- .../Sidekick_base_solver/Solver/Lit/T/Ty/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Solver/Lit/T/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Solver/Lit/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Solver/Model/index.html | 2 +- .../Sidekick_base_solver/Solver/P/Step_vec/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Solver/P/index.html | 2 +- .../Solver/Solver_internal/CC/Actions/Lit/T/Fun/index.html | 2 +- .../Solver/Solver_internal/CC/Actions/Lit/T/Term/Tbl/index.html | 2 +- .../Solver/Solver_internal/CC/Actions/Lit/T/Term/index.html | 2 +- .../Solver/Solver_internal/CC/Actions/Lit/T/Ty/index.html | 2 +- .../Solver/Solver_internal/CC/Actions/Lit/T/index.html | 2 +- .../Solver/Solver_internal/CC/Actions/Lit/index.html | 2 +- .../Solver/Solver_internal/CC/Actions/P/index.html | 2 +- .../Solver/Solver_internal/CC/Actions/T/Fun/index.html | 2 +- .../Solver/Solver_internal/CC/Actions/T/Term/Tbl/index.html | 2 +- .../Solver/Solver_internal/CC/Actions/T/Term/index.html | 2 +- .../Solver/Solver_internal/CC/Actions/T/Ty/index.html | 2 +- .../Solver/Solver_internal/CC/Actions/T/index.html | 2 +- .../Solver/Solver_internal/CC/Actions/index.html | 2 +- .../Solver/Solver_internal/CC/Debug_/index.html | 2 +- .../Solver/Solver_internal/CC/Expl/index.html | 2 +- .../Solver/Solver_internal/CC/Lit/T/Fun/index.html | 2 +- .../Solver/Solver_internal/CC/Lit/T/Term/Tbl/index.html | 2 +- .../Solver/Solver_internal/CC/Lit/T/Term/index.html | 2 +- .../Solver/Solver_internal/CC/Lit/T/Ty/index.html | 2 +- .../Solver/Solver_internal/CC/Lit/T/index.html | 2 +- .../Solver/Solver_internal/CC/Lit/index.html | 2 +- .../Sidekick_base_solver/Solver/Solver_internal/CC/N/index.html | 2 +- .../Sidekick_base_solver/Solver/Solver_internal/CC/P/index.html | 2 +- .../Solver/Solver_internal/CC/T/Fun/index.html | 2 +- .../Solver/Solver_internal/CC/T/Term/Tbl/index.html | 2 +- .../Solver/Solver_internal/CC/T/Term/index.html | 2 +- .../Solver/Solver_internal/CC/T/Ty/index.html | 2 +- .../Sidekick_base_solver/Solver/Solver_internal/CC/T/index.html | 2 +- .../Sidekick_base_solver/Solver/Solver_internal/CC/index.html | 2 +- .../Solver/Solver_internal/Lit/T/Fun/index.html | 2 +- .../Solver/Solver_internal/Lit/T/Term/Tbl/index.html | 2 +- .../Solver/Solver_internal/Lit/T/Term/index.html | 2 +- .../Solver/Solver_internal/Lit/T/Ty/index.html | 2 +- .../Solver/Solver_internal/Lit/T/index.html | 2 +- .../Sidekick_base_solver/Solver/Solver_internal/Lit/index.html | 2 +- .../Solver/Solver_internal/P/Step_vec/index.html | 2 +- .../Sidekick_base_solver/Solver/Solver_internal/P/index.html | 2 +- .../Solver/Solver_internal/Simplify/index.html | 2 +- .../Solver/Solver_internal/T/Fun/index.html | 2 +- .../Solver/Solver_internal/T/Term/Tbl/index.html | 2 +- .../Solver/Solver_internal/T/Term/index.html | 2 +- .../Sidekick_base_solver/Solver/Solver_internal/T/Ty/index.html | 2 +- .../Sidekick_base_solver/Solver/Solver_internal/T/index.html | 2 +- .../Sidekick_base_solver/Solver/Solver_internal/index.html | 2 +- .../Solver_internal/module-type-PREPROCESS_ACTS/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Solver/T/Fun/index.html | 2 +- .../Sidekick_base_solver/Solver/T/Term/Tbl/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Solver/T/Term/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Solver/T/Ty/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Solver/T/index.html | 2 +- .../Sidekick_base_solver/Solver/Unknown/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Solver/index.html | 2 +- .../Sidekick_base_solver/Solver/module-type-THEORY/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Solver_arg/index.html | 2 +- .../Sidekick_base_solver/Th_bool/A/Gensym/index.html | 2 +- .../Sidekick_base_solver/Th_bool/A/S/Lit/T/Fun/index.html | 2 +- .../Sidekick_base_solver/Th_bool/A/S/Lit/T/Term/Tbl/index.html | 2 +- .../Sidekick_base_solver/Th_bool/A/S/Lit/T/Term/index.html | 2 +- .../Sidekick_base_solver/Th_bool/A/S/Lit/T/Ty/index.html | 2 +- .../Sidekick_base_solver/Th_bool/A/S/Lit/T/index.html | 2 +- .../Sidekick_base_solver/Th_bool/A/S/Lit/index.html | 2 +- .../Sidekick_base_solver/Th_bool/A/S/Model/index.html | 2 +- .../Sidekick_base_solver/Th_bool/A/S/P/Step_vec/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/P/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/Actions/Lit/T/Fun/index.html | 2 +- .../A/S/Solver_internal/CC/Actions/Lit/T/Term/Tbl/index.html | 2 +- .../A/S/Solver_internal/CC/Actions/Lit/T/Term/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/Actions/Lit/T/Ty/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/Actions/Lit/T/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/Actions/Lit/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/Actions/P/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/Actions/T/Fun/index.html | 2 +- .../A/S/Solver_internal/CC/Actions/T/Term/Tbl/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/Actions/T/Term/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/Actions/T/Ty/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/Actions/T/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/Actions/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/Debug_/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/Expl/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/Lit/T/Fun/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/Lit/T/Term/Tbl/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/Lit/T/Term/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/Lit/T/Ty/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/Lit/T/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/Lit/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/N/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/P/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/T/Fun/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/T/Term/Tbl/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/T/Term/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/T/Ty/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/T/index.html | 2 +- .../Th_bool/A/S/Solver_internal/CC/index.html | 2 +- .../Th_bool/A/S/Solver_internal/Lit/T/Fun/index.html | 2 +- .../Th_bool/A/S/Solver_internal/Lit/T/Term/Tbl/index.html | 2 +- .../Th_bool/A/S/Solver_internal/Lit/T/Term/index.html | 2 +- .../Th_bool/A/S/Solver_internal/Lit/T/Ty/index.html | 2 +- .../Th_bool/A/S/Solver_internal/Lit/T/index.html | 2 +- .../Th_bool/A/S/Solver_internal/Lit/index.html | 2 +- .../Th_bool/A/S/Solver_internal/P/Step_vec/index.html | 2 +- .../Th_bool/A/S/Solver_internal/P/index.html | 2 +- .../Th_bool/A/S/Solver_internal/Simplify/index.html | 2 +- .../Th_bool/A/S/Solver_internal/T/Fun/index.html | 2 +- .../Th_bool/A/S/Solver_internal/T/Term/Tbl/index.html | 2 +- .../Th_bool/A/S/Solver_internal/T/Term/index.html | 2 +- .../Th_bool/A/S/Solver_internal/T/Ty/index.html | 2 +- .../Th_bool/A/S/Solver_internal/T/index.html | 2 +- .../Sidekick_base_solver/Th_bool/A/S/Solver_internal/index.html | 2 +- .../A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html | 2 +- .../Sidekick_base_solver/Th_bool/A/S/T/Fun/index.html | 2 +- .../Sidekick_base_solver/Th_bool/A/S/T/Term/Tbl/index.html | 2 +- .../Sidekick_base_solver/Th_bool/A/S/T/Term/index.html | 2 +- .../Sidekick_base_solver/Th_bool/A/S/T/Ty/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/T/index.html | 2 +- .../Sidekick_base_solver/Th_bool/A/S/Unknown/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/index.html | 2 +- .../Th_bool/A/S/module-type-THEORY/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Th_bool/A/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Th_bool/index.html | 2 +- .../Sidekick_base_solver/Th_data/A/Cstor/index.html | 2 +- .../Sidekick_base_solver/Th_data/A/S/Lit/T/Fun/index.html | 2 +- .../Sidekick_base_solver/Th_data/A/S/Lit/T/Term/Tbl/index.html | 2 +- .../Sidekick_base_solver/Th_data/A/S/Lit/T/Term/index.html | 2 +- .../Sidekick_base_solver/Th_data/A/S/Lit/T/Ty/index.html | 2 +- .../Sidekick_base_solver/Th_data/A/S/Lit/T/index.html | 2 +- .../Sidekick_base_solver/Th_data/A/S/Lit/index.html | 2 +- .../Sidekick_base_solver/Th_data/A/S/Model/index.html | 2 +- .../Sidekick_base_solver/Th_data/A/S/P/Step_vec/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/P/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/Actions/Lit/T/Fun/index.html | 2 +- .../A/S/Solver_internal/CC/Actions/Lit/T/Term/Tbl/index.html | 2 +- .../A/S/Solver_internal/CC/Actions/Lit/T/Term/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/Actions/Lit/T/Ty/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/Actions/Lit/T/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/Actions/Lit/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/Actions/P/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/Actions/T/Fun/index.html | 2 +- .../A/S/Solver_internal/CC/Actions/T/Term/Tbl/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/Actions/T/Term/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/Actions/T/Ty/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/Actions/T/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/Actions/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/Debug_/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/Expl/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/Lit/T/Fun/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/Lit/T/Term/Tbl/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/Lit/T/Term/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/Lit/T/Ty/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/Lit/T/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/Lit/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/N/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/P/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/T/Fun/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/T/Term/Tbl/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/T/Term/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/T/Ty/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/T/index.html | 2 +- .../Th_data/A/S/Solver_internal/CC/index.html | 2 +- .../Th_data/A/S/Solver_internal/Lit/T/Fun/index.html | 2 +- .../Th_data/A/S/Solver_internal/Lit/T/Term/Tbl/index.html | 2 +- .../Th_data/A/S/Solver_internal/Lit/T/Term/index.html | 2 +- .../Th_data/A/S/Solver_internal/Lit/T/Ty/index.html | 2 +- .../Th_data/A/S/Solver_internal/Lit/T/index.html | 2 +- .../Th_data/A/S/Solver_internal/Lit/index.html | 2 +- .../Th_data/A/S/Solver_internal/P/Step_vec/index.html | 2 +- .../Th_data/A/S/Solver_internal/P/index.html | 2 +- .../Th_data/A/S/Solver_internal/Simplify/index.html | 2 +- .../Th_data/A/S/Solver_internal/T/Fun/index.html | 2 +- .../Th_data/A/S/Solver_internal/T/Term/Tbl/index.html | 2 +- .../Th_data/A/S/Solver_internal/T/Term/index.html | 2 +- .../Th_data/A/S/Solver_internal/T/Ty/index.html | 2 +- .../Th_data/A/S/Solver_internal/T/index.html | 2 +- .../Sidekick_base_solver/Th_data/A/S/Solver_internal/index.html | 2 +- .../A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html | 2 +- .../Sidekick_base_solver/Th_data/A/S/T/Fun/index.html | 2 +- .../Sidekick_base_solver/Th_data/A/S/T/Term/Tbl/index.html | 2 +- .../Sidekick_base_solver/Th_data/A/S/T/Term/index.html | 2 +- .../Sidekick_base_solver/Th_data/A/S/T/Ty/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/T/index.html | 2 +- .../Sidekick_base_solver/Th_data/A/S/Unknown/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/index.html | 2 +- .../Th_data/A/S/module-type-THEORY/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Th_data/A/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Th_data/index.html | 2 +- .../Sidekick_base_solver/Th_lra/A/Gensym/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Th_lra/A/Q/index.html | 2 +- .../Sidekick_base_solver/Th_lra/A/S/Lit/T/Fun/index.html | 2 +- .../Sidekick_base_solver/Th_lra/A/S/Lit/T/Term/Tbl/index.html | 2 +- .../Sidekick_base_solver/Th_lra/A/S/Lit/T/Term/index.html | 2 +- .../Sidekick_base_solver/Th_lra/A/S/Lit/T/Ty/index.html | 2 +- .../Sidekick_base_solver/Th_lra/A/S/Lit/T/index.html | 2 +- .../Sidekick_base_solver/Th_lra/A/S/Lit/index.html | 2 +- .../Sidekick_base_solver/Th_lra/A/S/Model/index.html | 2 +- .../Sidekick_base_solver/Th_lra/A/S/P/Step_vec/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/P/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/Fun/index.html | 2 +- .../A/S/Solver_internal/CC/Actions/Lit/T/Term/Tbl/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/Term/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/Ty/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/Actions/Lit/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/Actions/P/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/Actions/T/Fun/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/Actions/T/Term/Tbl/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/Actions/T/Term/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/Actions/T/Ty/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/Actions/T/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/Actions/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/Debug_/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/Expl/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/Lit/T/Fun/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/Lit/T/Term/Tbl/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/Lit/T/Term/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/Lit/T/Ty/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/Lit/T/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/Lit/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/N/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/P/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/T/Fun/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/T/Term/Tbl/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/T/Term/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/T/Ty/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/T/index.html | 2 +- .../Th_lra/A/S/Solver_internal/CC/index.html | 2 +- .../Th_lra/A/S/Solver_internal/Lit/T/Fun/index.html | 2 +- .../Th_lra/A/S/Solver_internal/Lit/T/Term/Tbl/index.html | 2 +- .../Th_lra/A/S/Solver_internal/Lit/T/Term/index.html | 2 +- .../Th_lra/A/S/Solver_internal/Lit/T/Ty/index.html | 2 +- .../Th_lra/A/S/Solver_internal/Lit/T/index.html | 2 +- .../Th_lra/A/S/Solver_internal/Lit/index.html | 2 +- .../Th_lra/A/S/Solver_internal/P/Step_vec/index.html | 2 +- .../Th_lra/A/S/Solver_internal/P/index.html | 2 +- .../Th_lra/A/S/Solver_internal/Simplify/index.html | 2 +- .../Th_lra/A/S/Solver_internal/T/Fun/index.html | 2 +- .../Th_lra/A/S/Solver_internal/T/Term/Tbl/index.html | 2 +- .../Th_lra/A/S/Solver_internal/T/Term/index.html | 2 +- .../Th_lra/A/S/Solver_internal/T/Ty/index.html | 2 +- .../Th_lra/A/S/Solver_internal/T/index.html | 2 +- .../Sidekick_base_solver/Th_lra/A/S/Solver_internal/index.html | 2 +- .../A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html | 2 +- .../Sidekick_base_solver/Th_lra/A/S/T/Fun/index.html | 2 +- .../Sidekick_base_solver/Th_lra/A/S/T/Term/Tbl/index.html | 2 +- .../Sidekick_base_solver/Th_lra/A/S/T/Term/index.html | 2 +- .../Sidekick_base_solver/Th_lra/A/S/T/Ty/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/T/index.html | 2 +- .../Sidekick_base_solver/Th_lra/A/S/Unknown/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/index.html | 2 +- .../Th_lra/A/S/module-type-THEORY/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Th_lra/A/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/Th_lra/index.html | 2 +- dev/sidekick-base/Sidekick_base_solver/index.html | 2 +- dev/sidekick-base/index.html | 2 +- dev/sidekick-bin/Sidekick_bin_lib/Dimacs_lexer/index.html | 2 +- dev/sidekick-bin/Sidekick_bin_lib/Dimacs_parser/index.html | 2 +- dev/sidekick-bin/Sidekick_bin_lib/Drup_lexer/index.html | 2 +- dev/sidekick-bin/Sidekick_bin_lib/Drup_parser/index.html | 2 +- dev/sidekick-bin/Sidekick_bin_lib/index.html | 2 +- dev/sidekick-bin/Sidekick_bin_lib__/index.html | 2 +- dev/sidekick-bin/Sidekick_bin_lib__Dimacs_lexer/index.html | 2 +- dev/sidekick-bin/Sidekick_bin_lib__Dimacs_parser/index.html | 2 +- dev/sidekick-bin/Sidekick_bin_lib__Drup_lexer/index.html | 2 +- dev/sidekick-bin/Sidekick_bin_lib__Drup_parser/index.html | 2 +- dev/sidekick-bin/Sidekick_smtlib/Process/Check_cc/index.html | 2 +- dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Lit/index.html | 2 +- .../Sidekick_smtlib/Process/Solver/Model/index.html | 2 +- .../Sidekick_smtlib/Process/Solver/P/Step_vec/index.html | 2 +- dev/sidekick-bin/Sidekick_smtlib/Process/Solver/P/index.html | 2 +- .../Process/Solver/Solver_internal/CC/Actions/P/index.html | 2 +- .../Process/Solver/Solver_internal/CC/Actions/index.html | 2 +- .../Process/Solver/Solver_internal/CC/Expl/index.html | 2 +- .../Process/Solver/Solver_internal/CC/N/index.html | 2 +- .../Process/Solver/Solver_internal/CC/P/index.html | 2 +- .../Process/Solver/Solver_internal/CC/index.html | 2 +- .../Process/Solver/Solver_internal/Simplify/index.html | 2 +- .../Sidekick_smtlib/Process/Solver/Solver_internal/index.html | 2 +- .../Solver_internal/module-type-PREPROCESS_ACTS/index.html | 2 +- .../Sidekick_smtlib/Process/Solver/T/Fun/index.html | 2 +- .../Sidekick_smtlib/Process/Solver/T/Term/index.html | 2 +- dev/sidekick-bin/Sidekick_smtlib/Process/Solver/T/Ty/index.html | 2 +- dev/sidekick-bin/Sidekick_smtlib/Process/Solver/T/index.html | 2 +- .../Sidekick_smtlib/Process/Solver/Unknown/index.html | 2 +- dev/sidekick-bin/Sidekick_smtlib/Process/Solver/index.html | 2 +- .../Process/Solver/module-type-THEORY/index.html | 2 +- dev/sidekick-bin/Sidekick_smtlib/Process/index.html | 2 +- dev/sidekick-bin/Sidekick_smtlib/index.html | 2 +- dev/sidekick-bin/Sidekick_smtlib__/index.html | 2 +- dev/sidekick-bin/Sidekick_smtlib__Process/index.html | 2 +- dev/sidekick-bin/Sidekick_smtlib__Typecheck/index.html | 2 +- dev/sidekick-bin/index.html | 2 +- dev/sidekick/Sidekick_arith/index.html | 2 +- dev/sidekick/Sidekick_arith/module-type-INT/index.html | 2 +- dev/sidekick/Sidekick_arith/module-type-NUM/index.html | 2 +- dev/sidekick/Sidekick_arith/module-type-RATIONAL/index.html | 2 +- .../Sidekick_arith_lra/Linear_expr/Make/Comb/Infix/index.html | 2 +- .../Sidekick_arith_lra/Linear_expr/Make/Comb/index.html | 2 +- .../Sidekick_arith_lra/Linear_expr/Make/Constr/index.html | 2 +- .../Sidekick_arith_lra/Linear_expr/Make/Expr/Infix/index.html | 2 +- .../Sidekick_arith_lra/Linear_expr/Make/Expr/index.html | 2 +- .../Sidekick_arith_lra/Linear_expr/Make/argument-1-C/index.html | 2 +- .../Linear_expr/Make/argument-2-Var/index.html | 2 +- dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/index.html | 2 +- dev/sidekick/Sidekick_arith_lra/Linear_expr/index.html | 2 +- .../Sidekick_arith_lra/Linear_expr/module-type-COEFF/index.html | 2 +- .../Sidekick_arith_lra/Linear_expr/module-type-S/C/index.html | 2 +- .../Linear_expr/module-type-S/Comb/Infix/index.html | 2 +- .../Linear_expr/module-type-S/Comb/index.html | 2 +- .../Linear_expr/module-type-S/Constr/index.html | 2 +- .../Linear_expr/module-type-S/Expr/Infix/index.html | 2 +- .../Linear_expr/module-type-S/Expr/index.html | 2 +- .../Sidekick_arith_lra/Linear_expr/module-type-S/Var/index.html | 2 +- .../Sidekick_arith_lra/Linear_expr/module-type-S/index.html | 2 +- .../Sidekick_arith_lra/Linear_expr/module-type-VAR/index.html | 2 +- .../Sidekick_arith_lra/Make/argument-1-A/Gensym/index.html | 2 +- dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/Q/index.html | 2 +- .../Sidekick_arith_lra/Make/argument-1-A/S/Lit/index.html | 2 +- .../Sidekick_arith_lra/Make/argument-1-A/S/Model/index.html | 2 +- .../Make/argument-1-A/S/P/Step_vec/index.html | 2 +- .../Sidekick_arith_lra/Make/argument-1-A/S/P/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/Actions/P/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/Actions/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/Expl/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/N/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/P/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/Simplify/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/index.html | 2 +- .../S/Solver_internal/module-type-PREPROCESS_ACTS/index.html | 2 +- .../Sidekick_arith_lra/Make/argument-1-A/S/T/Fun/index.html | 2 +- .../Sidekick_arith_lra/Make/argument-1-A/S/T/Term/index.html | 2 +- .../Sidekick_arith_lra/Make/argument-1-A/S/T/Ty/index.html | 2 +- .../Sidekick_arith_lra/Make/argument-1-A/S/T/index.html | 2 +- .../Sidekick_arith_lra/Make/argument-1-A/S/Unknown/index.html | 2 +- dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/index.html | 2 +- .../Make/argument-1-A/S/module-type-THEORY/index.html | 2 +- dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/index.html | 2 +- dev/sidekick/Sidekick_arith_lra/Make/index.html | 2 +- dev/sidekick/Sidekick_arith_lra/Predicate/index.html | 2 +- .../Sidekick_arith_lra/Simplex2/Make/Constraint/index.html | 2 +- dev/sidekick/Sidekick_arith_lra/Simplex2/Make/Subst/index.html | 2 +- .../Sidekick_arith_lra/Simplex2/Make/Unsat_cert/index.html | 2 +- .../Sidekick_arith_lra/Simplex2/Make/argument-1-Q/index.html | 2 +- .../Sidekick_arith_lra/Simplex2/Make/argument-2-Var/index.html | 2 +- dev/sidekick/Sidekick_arith_lra/Simplex2/Make/index.html | 2 +- dev/sidekick/Sidekick_arith_lra/Simplex2/Op/index.html | 2 +- dev/sidekick/Sidekick_arith_lra/Simplex2/index.html | 2 +- .../Simplex2/module-type-S/Constraint/index.html | 2 +- .../Sidekick_arith_lra/Simplex2/module-type-S/Q/index.html | 2 +- .../Sidekick_arith_lra/Simplex2/module-type-S/Subst/index.html | 2 +- .../Simplex2/module-type-S/Unsat_cert/index.html | 2 +- .../Sidekick_arith_lra/Simplex2/module-type-S/V/index.html | 2 +- .../Sidekick_arith_lra/Simplex2/module-type-S/index.html | 2 +- .../Sidekick_arith_lra/Simplex2/module-type-VAR/index.html | 2 +- dev/sidekick/Sidekick_arith_lra/index.html | 2 +- .../Sidekick_arith_lra/module-type-ARG/Gensym/index.html | 2 +- dev/sidekick/Sidekick_arith_lra/module-type-ARG/Q/index.html | 2 +- .../Sidekick_arith_lra/module-type-ARG/S/Lit/index.html | 2 +- .../Sidekick_arith_lra/module-type-ARG/S/Model/index.html | 2 +- .../Sidekick_arith_lra/module-type-ARG/S/P/Step_vec/index.html | 2 +- dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/P/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/Actions/P/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/Actions/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/Expl/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/N/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/P/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/index.html | 2 +- .../module-type-ARG/S/Solver_internal/Simplify/index.html | 2 +- .../module-type-ARG/S/Solver_internal/index.html | 2 +- .../S/Solver_internal/module-type-PREPROCESS_ACTS/index.html | 2 +- .../Sidekick_arith_lra/module-type-ARG/S/T/Fun/index.html | 2 +- .../Sidekick_arith_lra/module-type-ARG/S/T/Term/index.html | 2 +- .../Sidekick_arith_lra/module-type-ARG/S/T/Ty/index.html | 2 +- dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/T/index.html | 2 +- .../Sidekick_arith_lra/module-type-ARG/S/Unknown/index.html | 2 +- dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/index.html | 2 +- .../module-type-ARG/S/module-type-THEORY/index.html | 2 +- dev/sidekick/Sidekick_arith_lra/module-type-ARG/index.html | 2 +- .../Sidekick_arith_lra/module-type-S/A/Gensym/index.html | 2 +- dev/sidekick/Sidekick_arith_lra/module-type-S/A/Q/index.html | 2 +- .../Sidekick_arith_lra/module-type-S/A/S/Lit/index.html | 2 +- .../Sidekick_arith_lra/module-type-S/A/S/Model/index.html | 2 +- .../Sidekick_arith_lra/module-type-S/A/S/P/Step_vec/index.html | 2 +- dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/P/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/Actions/P/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/Actions/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/Expl/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/N/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/P/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/index.html | 2 +- .../module-type-S/A/S/Solver_internal/Simplify/index.html | 2 +- .../module-type-S/A/S/Solver_internal/index.html | 2 +- .../A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html | 2 +- .../Sidekick_arith_lra/module-type-S/A/S/T/Fun/index.html | 2 +- .../Sidekick_arith_lra/module-type-S/A/S/T/Term/index.html | 2 +- .../Sidekick_arith_lra/module-type-S/A/S/T/Ty/index.html | 2 +- dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/T/index.html | 2 +- .../Sidekick_arith_lra/module-type-S/A/S/Unknown/index.html | 2 +- dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/index.html | 2 +- .../module-type-S/A/S/module-type-THEORY/index.html | 2 +- dev/sidekick/Sidekick_arith_lra/module-type-S/A/index.html | 2 +- dev/sidekick/Sidekick_arith_lra/module-type-S/index.html | 2 +- dev/sidekick/Sidekick_arith_lra__/index.html | 2 +- dev/sidekick/Sidekick_arith_lra__Linear_expr/index.html | 2 +- dev/sidekick/Sidekick_arith_lra__Linear_expr_intf/index.html | 2 +- dev/sidekick/Sidekick_arith_lra__Predicate/index.html | 2 +- dev/sidekick/Sidekick_arith_lra__Simplex2/index.html | 2 +- dev/sidekick/Sidekick_arith_lra__Simplex_intf/index.html | 2 +- dev/sidekick/Sidekick_cc/Make/Expl/index.html | 2 +- dev/sidekick/Sidekick_cc/Make/N/index.html | 2 +- dev/sidekick/Sidekick_cc/Make/P/index.html | 2 +- dev/sidekick/Sidekick_cc/Make/argument-1-A/Actions/P/index.html | 2 +- dev/sidekick/Sidekick_cc/Make/argument-1-A/Actions/index.html | 2 +- dev/sidekick/Sidekick_cc/Make/argument-1-A/Lit/index.html | 2 +- dev/sidekick/Sidekick_cc/Make/argument-1-A/P/index.html | 2 +- dev/sidekick/Sidekick_cc/Make/argument-1-A/T/Fun/index.html | 2 +- dev/sidekick/Sidekick_cc/Make/argument-1-A/T/Term/index.html | 2 +- dev/sidekick/Sidekick_cc/Make/argument-1-A/T/Ty/index.html | 2 +- dev/sidekick/Sidekick_cc/Make/argument-1-A/T/index.html | 2 +- dev/sidekick/Sidekick_cc/Make/argument-1-A/index.html | 2 +- dev/sidekick/Sidekick_cc/Make/index.html | 2 +- dev/sidekick/Sidekick_cc/index.html | 2 +- dev/sidekick/Sidekick_core/CC_view/index.html | 2 +- .../Monoid_of_repr/argument-1-M/SI/CC/Actions/P/index.html | 2 +- .../Monoid_of_repr/argument-1-M/SI/CC/Actions/index.html | 2 +- .../Monoid_of_repr/argument-1-M/SI/CC/Expl/index.html | 2 +- .../Monoid_of_repr/argument-1-M/SI/CC/N/index.html | 2 +- .../Monoid_of_repr/argument-1-M/SI/CC/P/index.html | 2 +- .../Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/index.html | 2 +- .../Sidekick_core/Monoid_of_repr/argument-1-M/SI/Lit/index.html | 2 +- .../Monoid_of_repr/argument-1-M/SI/P/Step_vec/index.html | 2 +- .../Sidekick_core/Monoid_of_repr/argument-1-M/SI/P/index.html | 2 +- .../Monoid_of_repr/argument-1-M/SI/Simplify/index.html | 2 +- .../Monoid_of_repr/argument-1-M/SI/T/Fun/index.html | 2 +- .../Monoid_of_repr/argument-1-M/SI/T/Term/index.html | 2 +- .../Monoid_of_repr/argument-1-M/SI/T/Ty/index.html | 2 +- .../Sidekick_core/Monoid_of_repr/argument-1-M/SI/T/index.html | 2 +- .../Sidekick_core/Monoid_of_repr/argument-1-M/SI/index.html | 2 +- .../argument-1-M/SI/module-type-PREPROCESS_ACTS/index.html | 2 +- .../Sidekick_core/Monoid_of_repr/argument-1-M/index.html | 2 +- dev/sidekick/Sidekick_core/Monoid_of_repr/index.html | 2 +- dev/sidekick/Sidekick_core/index.html | 2 +- .../Sidekick_core/module-type-CC_ACTIONS/Lit/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/P/index.html | 2 +- .../Sidekick_core/module-type-CC_ACTIONS/T/Fun/index.html | 2 +- .../Sidekick_core/module-type-CC_ACTIONS/T/Term/index.html | 2 +- .../Sidekick_core/module-type-CC_ACTIONS/T/Ty/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/T/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/index.html | 2 +- .../Sidekick_core/module-type-CC_ARG/Actions/P/index.html | 2 +- .../Sidekick_core/module-type-CC_ARG/Actions/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-CC_ARG/Lit/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-CC_ARG/P/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-CC_ARG/T/Fun/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-CC_ARG/T/Term/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-CC_ARG/T/Ty/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-CC_ARG/T/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-CC_ARG/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-CC_PROOF/index.html | 2 +- .../Sidekick_core/module-type-CC_S/Actions/P/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-CC_S/Actions/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-CC_S/Expl/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-CC_S/Lit/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-CC_S/N/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-CC_S/P/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-CC_S/T/Fun/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-CC_S/T/Term/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-CC_S/T/Ty/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-CC_S/T/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-CC_S/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-LIT/T/Fun/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-LIT/T/Term/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-LIT/T/Ty/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-LIT/T/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-LIT/index.html | 2 +- .../module-type-MONOID_ARG/SI/CC/Actions/P/index.html | 2 +- .../module-type-MONOID_ARG/SI/CC/Actions/index.html | 2 +- .../Sidekick_core/module-type-MONOID_ARG/SI/CC/Expl/index.html | 2 +- .../Sidekick_core/module-type-MONOID_ARG/SI/CC/N/index.html | 2 +- .../Sidekick_core/module-type-MONOID_ARG/SI/CC/P/index.html | 2 +- .../Sidekick_core/module-type-MONOID_ARG/SI/CC/index.html | 2 +- .../Sidekick_core/module-type-MONOID_ARG/SI/Lit/index.html | 2 +- .../module-type-MONOID_ARG/SI/P/Step_vec/index.html | 2 +- .../Sidekick_core/module-type-MONOID_ARG/SI/P/index.html | 2 +- .../Sidekick_core/module-type-MONOID_ARG/SI/Simplify/index.html | 2 +- .../Sidekick_core/module-type-MONOID_ARG/SI/T/Fun/index.html | 2 +- .../Sidekick_core/module-type-MONOID_ARG/SI/T/Term/index.html | 2 +- .../Sidekick_core/module-type-MONOID_ARG/SI/T/Ty/index.html | 2 +- .../Sidekick_core/module-type-MONOID_ARG/SI/T/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/index.html | 2 +- .../SI/module-type-PREPROCESS_ACTS/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-MONOID_ARG/index.html | 2 +- .../Sidekick_core/module-type-PROOF/Step_vec/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-PROOF/index.html | 2 +- .../Sidekick_core/module-type-SAT_PROOF/Step_vec/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-SAT_PROOF/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-SOLVER/Lit/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-SOLVER/Model/index.html | 2 +- .../Sidekick_core/module-type-SOLVER/P/Step_vec/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-SOLVER/P/index.html | 2 +- .../module-type-SOLVER/Solver_internal/CC/Actions/P/index.html | 2 +- .../module-type-SOLVER/Solver_internal/CC/Actions/index.html | 2 +- .../module-type-SOLVER/Solver_internal/CC/Expl/index.html | 2 +- .../module-type-SOLVER/Solver_internal/CC/N/index.html | 2 +- .../module-type-SOLVER/Solver_internal/CC/P/index.html | 2 +- .../module-type-SOLVER/Solver_internal/CC/index.html | 2 +- .../module-type-SOLVER/Solver_internal/Simplify/index.html | 2 +- .../Sidekick_core/module-type-SOLVER/Solver_internal/index.html | 2 +- .../Solver_internal/module-type-PREPROCESS_ACTS/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-SOLVER/T/Fun/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-SOLVER/T/Term/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-SOLVER/T/Ty/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-SOLVER/T/index.html | 2 +- .../Sidekick_core/module-type-SOLVER/Unknown/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-SOLVER/index.html | 2 +- .../module-type-SOLVER/module-type-THEORY/index.html | 2 +- .../module-type-SOLVER_INTERNAL/CC/Actions/P/index.html | 2 +- .../module-type-SOLVER_INTERNAL/CC/Actions/index.html | 2 +- .../module-type-SOLVER_INTERNAL/CC/Expl/index.html | 2 +- .../Sidekick_core/module-type-SOLVER_INTERNAL/CC/N/index.html | 2 +- .../Sidekick_core/module-type-SOLVER_INTERNAL/CC/P/index.html | 2 +- .../Sidekick_core/module-type-SOLVER_INTERNAL/CC/index.html | 2 +- .../Sidekick_core/module-type-SOLVER_INTERNAL/Lit/index.html | 2 +- .../module-type-SOLVER_INTERNAL/P/Step_vec/index.html | 2 +- .../Sidekick_core/module-type-SOLVER_INTERNAL/P/index.html | 2 +- .../module-type-SOLVER_INTERNAL/Simplify/index.html | 2 +- .../Sidekick_core/module-type-SOLVER_INTERNAL/T/Fun/index.html | 2 +- .../Sidekick_core/module-type-SOLVER_INTERNAL/T/Term/index.html | 2 +- .../Sidekick_core/module-type-SOLVER_INTERNAL/T/Ty/index.html | 2 +- .../Sidekick_core/module-type-SOLVER_INTERNAL/T/index.html | 2 +- .../Sidekick_core/module-type-SOLVER_INTERNAL/index.html | 2 +- .../module-type-PREPROCESS_ACTS/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-TERM/Fun/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-TERM/Term/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-TERM/Ty/index.html | 2 +- dev/sidekick/Sidekick_core/module-type-TERM/index.html | 2 +- dev/sidekick/Sidekick_drup/Make/Atom/index.html | 2 +- dev/sidekick/Sidekick_drup/Make/Checker/index.html | 2 +- dev/sidekick/Sidekick_drup/Make/Clause/index.html | 2 +- dev/sidekick/Sidekick_drup/Make/index.html | 2 +- dev/sidekick/Sidekick_drup/index.html | 2 +- dev/sidekick/Sidekick_drup/module-type-S/Atom/index.html | 2 +- dev/sidekick/Sidekick_drup/module-type-S/Checker/index.html | 2 +- dev/sidekick/Sidekick_drup/module-type-S/Clause/index.html | 2 +- dev/sidekick/Sidekick_drup/module-type-S/index.html | 2 +- dev/sidekick/Sidekick_lit/Make/argument-1-T/Fun/index.html | 2 +- dev/sidekick/Sidekick_lit/Make/argument-1-T/Term/index.html | 2 +- dev/sidekick/Sidekick_lit/Make/argument-1-T/Ty/index.html | 2 +- dev/sidekick/Sidekick_lit/Make/argument-1-T/index.html | 2 +- dev/sidekick/Sidekick_lit/Make/index.html | 2 +- dev/sidekick/Sidekick_lit/index.html | 2 +- dev/sidekick/Sidekick_memtrace/index.html | 2 +- .../Sidekick_mini_cc/Make/argument-1-A/T/Fun/index.html | 2 +- .../Sidekick_mini_cc/Make/argument-1-A/T/Term/index.html | 2 +- dev/sidekick/Sidekick_mini_cc/Make/argument-1-A/T/Ty/index.html | 2 +- dev/sidekick/Sidekick_mini_cc/Make/argument-1-A/T/index.html | 2 +- dev/sidekick/Sidekick_mini_cc/Make/argument-1-A/index.html | 2 +- dev/sidekick/Sidekick_mini_cc/Make/index.html | 2 +- dev/sidekick/Sidekick_mini_cc/index.html | 2 +- dev/sidekick/Sidekick_mini_cc/module-type-ARG/T/Fun/index.html | 2 +- dev/sidekick/Sidekick_mini_cc/module-type-ARG/T/Term/index.html | 2 +- dev/sidekick/Sidekick_mini_cc/module-type-ARG/T/Ty/index.html | 2 +- dev/sidekick/Sidekick_mini_cc/module-type-ARG/T/index.html | 2 +- dev/sidekick/Sidekick_mini_cc/module-type-ARG/index.html | 2 +- dev/sidekick/Sidekick_mini_cc/module-type-S/index.html | 2 +- dev/sidekick/Sidekick_quip/Proof/Fun/index.html | 2 +- dev/sidekick/Sidekick_quip/Proof/Lit/index.html | 2 +- dev/sidekick/Sidekick_quip/Proof/T/index.html | 2 +- dev/sidekick/Sidekick_quip/Proof/Ty/index.html | 2 +- dev/sidekick/Sidekick_quip/Proof/index.html | 2 +- dev/sidekick/Sidekick_quip/index.html | 2 +- dev/sidekick/Sidekick_quip__/index.html | 2 +- dev/sidekick/Sidekick_quip__Proof/index.html | 2 +- dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/Clause/index.html | 2 +- .../Solver/Make_cdcl_t/argument-1-Th/Lit/index.html | 2 +- .../Solver/Make_cdcl_t/argument-1-Th/Proof/Step_vec/index.html | 2 +- .../Solver/Make_cdcl_t/argument-1-Th/Proof/index.html | 2 +- .../Sidekick_sat/Solver/Make_cdcl_t/argument-1-Th/index.html | 2 +- dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/index.html | 2 +- .../Sidekick_sat/Solver/Make_pure_sat/Clause/index.html | 2 +- .../Solver/Make_pure_sat/argument-1-Th/Lit/index.html | 2 +- .../Make_pure_sat/argument-1-Th/Proof/Step_vec/index.html | 2 +- .../Solver/Make_pure_sat/argument-1-Th/Proof/index.html | 2 +- .../Sidekick_sat/Solver/Make_pure_sat/argument-1-Th/index.html | 2 +- dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/index.html | 2 +- dev/sidekick/Sidekick_sat/Solver/index.html | 2 +- dev/sidekick/Sidekick_sat/Solver_intf/Clause_pool_id/index.html | 2 +- dev/sidekick/Sidekick_sat/Solver_intf/index.html | 2 +- .../Sidekick_sat/Solver_intf/module-type-ACTS/index.html | 2 +- .../Sidekick_sat/Solver_intf/module-type-LIT/index.html | 2 +- .../Solver_intf/module-type-PLUGIN_CDCL_T/Lit/index.html | 2 +- .../module-type-PLUGIN_CDCL_T/Proof/Step_vec/index.html | 2 +- .../Solver_intf/module-type-PLUGIN_CDCL_T/Proof/index.html | 2 +- .../Solver_intf/module-type-PLUGIN_CDCL_T/index.html | 2 +- .../Solver_intf/module-type-PLUGIN_SAT/Lit/index.html | 2 +- .../module-type-PLUGIN_SAT/Proof/Step_vec/index.html | 2 +- .../Solver_intf/module-type-PLUGIN_SAT/Proof/index.html | 2 +- .../Sidekick_sat/Solver_intf/module-type-PLUGIN_SAT/index.html | 2 +- .../Sidekick_sat/Solver_intf/module-type-S/Clause/index.html | 2 +- .../Sidekick_sat/Solver_intf/module-type-S/Lit/index.html | 2 +- .../Solver_intf/module-type-S/Proof/Step_vec/index.html | 2 +- .../Sidekick_sat/Solver_intf/module-type-S/Proof/index.html | 2 +- dev/sidekick/Sidekick_sat/Solver_intf/module-type-S/index.html | 2 +- .../Sidekick_sat/Solver_intf/module-type-SAT_STATE/index.html | 2 +- .../Sidekick_sat/Solver_intf/module-type-UNSAT_STATE/index.html | 2 +- dev/sidekick/Sidekick_sat/index.html | 2 +- dev/sidekick/Sidekick_sat__/index.html | 2 +- dev/sidekick/Sidekick_sat__Heap/index.html | 2 +- dev/sidekick/Sidekick_sat__Heap_intf/index.html | 2 +- dev/sidekick/Sidekick_sat__Solver/index.html | 2 +- dev/sidekick/Sidekick_sat__Solver_intf/index.html | 2 +- dev/sidekick/Sidekick_sigs/index.html | 2 +- dev/sidekick/Sidekick_sigs/module-type-EQ/index.html | 2 +- dev/sidekick/Sidekick_sigs/module-type-HASH/index.html | 2 +- dev/sidekick/Sidekick_sigs/module-type-ORD/index.html | 2 +- dev/sidekick/Sidekick_sigs/module-type-PRINT/index.html | 2 +- dev/sidekick/Sidekick_smt_solver/Make/Model/index.html | 2 +- .../Make/Solver_internal/CC/Actions/P/index.html | 2 +- .../Make/Solver_internal/CC/Actions/index.html | 2 +- .../Sidekick_smt_solver/Make/Solver_internal/CC/Expl/index.html | 2 +- .../Sidekick_smt_solver/Make/Solver_internal/CC/N/index.html | 2 +- .../Sidekick_smt_solver/Make/Solver_internal/CC/P/index.html | 2 +- .../Sidekick_smt_solver/Make/Solver_internal/CC/index.html | 2 +- .../Make/Solver_internal/Simplify/index.html | 2 +- .../Sidekick_smt_solver/Make/Solver_internal/index.html | 2 +- .../Make/Solver_internal/module-type-PREPROCESS_ACTS/index.html | 2 +- dev/sidekick/Sidekick_smt_solver/Make/Unknown/index.html | 2 +- .../Sidekick_smt_solver/Make/argument-1-A/Lit/index.html | 2 +- .../Sidekick_smt_solver/Make/argument-1-A/P/Step_vec/index.html | 2 +- dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/P/index.html | 2 +- .../Sidekick_smt_solver/Make/argument-1-A/T/Fun/index.html | 2 +- .../Sidekick_smt_solver/Make/argument-1-A/T/Term/index.html | 2 +- .../Sidekick_smt_solver/Make/argument-1-A/T/Ty/index.html | 2 +- dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/T/index.html | 2 +- dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/index.html | 2 +- dev/sidekick/Sidekick_smt_solver/Make/index.html | 2 +- .../Sidekick_smt_solver/Make/module-type-THEORY/index.html | 2 +- dev/sidekick/Sidekick_smt_solver/index.html | 2 +- dev/sidekick/Sidekick_smt_solver/module-type-ARG/Lit/index.html | 2 +- .../Sidekick_smt_solver/module-type-ARG/P/Step_vec/index.html | 2 +- dev/sidekick/Sidekick_smt_solver/module-type-ARG/P/index.html | 2 +- .../Sidekick_smt_solver/module-type-ARG/T/Fun/index.html | 2 +- .../Sidekick_smt_solver/module-type-ARG/T/Term/index.html | 2 +- .../Sidekick_smt_solver/module-type-ARG/T/Ty/index.html | 2 +- dev/sidekick/Sidekick_smt_solver/module-type-ARG/T/index.html | 2 +- dev/sidekick/Sidekick_smt_solver/module-type-ARG/index.html | 2 +- dev/sidekick/Sidekick_tef/index.html | 2 +- .../Sidekick_th_bool_static/Make/argument-1-A/Gensym/index.html | 2 +- .../Sidekick_th_bool_static/Make/argument-1-A/S/Lit/index.html | 2 +- .../Make/argument-1-A/S/Model/index.html | 2 +- .../Make/argument-1-A/S/P/Step_vec/index.html | 2 +- .../Sidekick_th_bool_static/Make/argument-1-A/S/P/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/Actions/P/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/Actions/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/Expl/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/N/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/P/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/Simplify/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/index.html | 2 +- .../S/Solver_internal/module-type-PREPROCESS_ACTS/index.html | 2 +- .../Make/argument-1-A/S/T/Fun/index.html | 2 +- .../Make/argument-1-A/S/T/Term/index.html | 2 +- .../Sidekick_th_bool_static/Make/argument-1-A/S/T/Ty/index.html | 2 +- .../Sidekick_th_bool_static/Make/argument-1-A/S/T/index.html | 2 +- .../Make/argument-1-A/S/Unknown/index.html | 2 +- .../Sidekick_th_bool_static/Make/argument-1-A/S/index.html | 2 +- .../Make/argument-1-A/S/module-type-THEORY/index.html | 2 +- .../Sidekick_th_bool_static/Make/argument-1-A/index.html | 2 +- dev/sidekick/Sidekick_th_bool_static/Make/index.html | 2 +- dev/sidekick/Sidekick_th_bool_static/index.html | 2 +- .../Sidekick_th_bool_static/module-type-ARG/Gensym/index.html | 2 +- .../Sidekick_th_bool_static/module-type-ARG/S/Lit/index.html | 2 +- .../Sidekick_th_bool_static/module-type-ARG/S/Model/index.html | 2 +- .../module-type-ARG/S/P/Step_vec/index.html | 2 +- .../Sidekick_th_bool_static/module-type-ARG/S/P/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/Actions/P/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/Actions/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/Expl/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/N/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/P/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/index.html | 2 +- .../module-type-ARG/S/Solver_internal/Simplify/index.html | 2 +- .../module-type-ARG/S/Solver_internal/index.html | 2 +- .../S/Solver_internal/module-type-PREPROCESS_ACTS/index.html | 2 +- .../Sidekick_th_bool_static/module-type-ARG/S/T/Fun/index.html | 2 +- .../Sidekick_th_bool_static/module-type-ARG/S/T/Term/index.html | 2 +- .../Sidekick_th_bool_static/module-type-ARG/S/T/Ty/index.html | 2 +- .../Sidekick_th_bool_static/module-type-ARG/S/T/index.html | 2 +- .../module-type-ARG/S/Unknown/index.html | 2 +- .../Sidekick_th_bool_static/module-type-ARG/S/index.html | 2 +- .../module-type-ARG/S/module-type-THEORY/index.html | 2 +- dev/sidekick/Sidekick_th_bool_static/module-type-ARG/index.html | 2 +- .../Sidekick_th_bool_static/module-type-PROOF/index.html | 2 +- .../Sidekick_th_bool_static/module-type-S/A/Gensym/index.html | 2 +- .../Sidekick_th_bool_static/module-type-S/A/S/Lit/index.html | 2 +- .../Sidekick_th_bool_static/module-type-S/A/S/Model/index.html | 2 +- .../module-type-S/A/S/P/Step_vec/index.html | 2 +- .../Sidekick_th_bool_static/module-type-S/A/S/P/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/Actions/P/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/Actions/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/Expl/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/N/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/P/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/index.html | 2 +- .../module-type-S/A/S/Solver_internal/Simplify/index.html | 2 +- .../module-type-S/A/S/Solver_internal/index.html | 2 +- .../A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html | 2 +- .../Sidekick_th_bool_static/module-type-S/A/S/T/Fun/index.html | 2 +- .../Sidekick_th_bool_static/module-type-S/A/S/T/Term/index.html | 2 +- .../Sidekick_th_bool_static/module-type-S/A/S/T/Ty/index.html | 2 +- .../Sidekick_th_bool_static/module-type-S/A/S/T/index.html | 2 +- .../module-type-S/A/S/Unknown/index.html | 2 +- .../Sidekick_th_bool_static/module-type-S/A/S/index.html | 2 +- .../module-type-S/A/S/module-type-THEORY/index.html | 2 +- dev/sidekick/Sidekick_th_bool_static/module-type-S/A/index.html | 2 +- dev/sidekick/Sidekick_th_bool_static/module-type-S/index.html | 2 +- .../Sidekick_th_cstor/Make/argument-1-A/S/Lit/index.html | 2 +- .../Sidekick_th_cstor/Make/argument-1-A/S/Model/index.html | 2 +- .../Sidekick_th_cstor/Make/argument-1-A/S/P/Step_vec/index.html | 2 +- dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/P/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/Actions/P/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/Actions/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/Expl/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/N/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/P/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/Simplify/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/index.html | 2 +- .../S/Solver_internal/module-type-PREPROCESS_ACTS/index.html | 2 +- .../Sidekick_th_cstor/Make/argument-1-A/S/T/Fun/index.html | 2 +- .../Sidekick_th_cstor/Make/argument-1-A/S/T/Term/index.html | 2 +- .../Sidekick_th_cstor/Make/argument-1-A/S/T/Ty/index.html | 2 +- dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/T/index.html | 2 +- .../Sidekick_th_cstor/Make/argument-1-A/S/Unknown/index.html | 2 +- dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/index.html | 2 +- .../Make/argument-1-A/S/module-type-THEORY/index.html | 2 +- dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/index.html | 2 +- dev/sidekick/Sidekick_th_cstor/Make/index.html | 2 +- dev/sidekick/Sidekick_th_cstor/index.html | 2 +- dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Lit/index.html | 2 +- .../Sidekick_th_cstor/module-type-ARG/S/Model/index.html | 2 +- .../Sidekick_th_cstor/module-type-ARG/S/P/Step_vec/index.html | 2 +- dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/P/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/Actions/P/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/Actions/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/Expl/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/N/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/P/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/index.html | 2 +- .../module-type-ARG/S/Solver_internal/Simplify/index.html | 2 +- .../module-type-ARG/S/Solver_internal/index.html | 2 +- .../S/Solver_internal/module-type-PREPROCESS_ACTS/index.html | 2 +- .../Sidekick_th_cstor/module-type-ARG/S/T/Fun/index.html | 2 +- .../Sidekick_th_cstor/module-type-ARG/S/T/Term/index.html | 2 +- .../Sidekick_th_cstor/module-type-ARG/S/T/Ty/index.html | 2 +- dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/T/index.html | 2 +- .../Sidekick_th_cstor/module-type-ARG/S/Unknown/index.html | 2 +- dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/index.html | 2 +- .../module-type-ARG/S/module-type-THEORY/index.html | 2 +- dev/sidekick/Sidekick_th_cstor/module-type-ARG/index.html | 2 +- dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Lit/index.html | 2 +- .../Sidekick_th_cstor/module-type-S/A/S/Model/index.html | 2 +- .../Sidekick_th_cstor/module-type-S/A/S/P/Step_vec/index.html | 2 +- dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/P/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/Actions/P/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/Actions/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/Expl/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/N/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/P/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/index.html | 2 +- .../module-type-S/A/S/Solver_internal/Simplify/index.html | 2 +- .../module-type-S/A/S/Solver_internal/index.html | 2 +- .../A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html | 2 +- .../Sidekick_th_cstor/module-type-S/A/S/T/Fun/index.html | 2 +- .../Sidekick_th_cstor/module-type-S/A/S/T/Term/index.html | 2 +- .../Sidekick_th_cstor/module-type-S/A/S/T/Ty/index.html | 2 +- dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/T/index.html | 2 +- .../Sidekick_th_cstor/module-type-S/A/S/Unknown/index.html | 2 +- dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/index.html | 2 +- .../module-type-S/A/S/module-type-THEORY/index.html | 2 +- dev/sidekick/Sidekick_th_cstor/module-type-S/A/index.html | 2 +- dev/sidekick/Sidekick_th_cstor/module-type-S/index.html | 2 +- .../Sidekick_th_data/Make/argument-1-A/Cstor/index.html | 2 +- .../Sidekick_th_data/Make/argument-1-A/S/Lit/index.html | 2 +- .../Sidekick_th_data/Make/argument-1-A/S/Model/index.html | 2 +- .../Sidekick_th_data/Make/argument-1-A/S/P/Step_vec/index.html | 2 +- dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/P/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/Actions/P/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/Actions/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/Expl/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/N/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/P/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/CC/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/Simplify/index.html | 2 +- .../Make/argument-1-A/S/Solver_internal/index.html | 2 +- .../S/Solver_internal/module-type-PREPROCESS_ACTS/index.html | 2 +- .../Sidekick_th_data/Make/argument-1-A/S/T/Fun/index.html | 2 +- .../Sidekick_th_data/Make/argument-1-A/S/T/Term/index.html | 2 +- .../Sidekick_th_data/Make/argument-1-A/S/T/Ty/index.html | 2 +- dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/T/index.html | 2 +- .../Sidekick_th_data/Make/argument-1-A/S/Unknown/index.html | 2 +- dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/index.html | 2 +- .../Make/argument-1-A/S/module-type-THEORY/index.html | 2 +- dev/sidekick/Sidekick_th_data/Make/argument-1-A/index.html | 2 +- dev/sidekick/Sidekick_th_data/Make/index.html | 2 +- dev/sidekick/Sidekick_th_data/index.html | 2 +- dev/sidekick/Sidekick_th_data/module-type-ARG/Cstor/index.html | 2 +- dev/sidekick/Sidekick_th_data/module-type-ARG/S/Lit/index.html | 2 +- .../Sidekick_th_data/module-type-ARG/S/Model/index.html | 2 +- .../Sidekick_th_data/module-type-ARG/S/P/Step_vec/index.html | 2 +- dev/sidekick/Sidekick_th_data/module-type-ARG/S/P/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/Actions/P/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/Actions/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/Expl/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/N/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/P/index.html | 2 +- .../module-type-ARG/S/Solver_internal/CC/index.html | 2 +- .../module-type-ARG/S/Solver_internal/Simplify/index.html | 2 +- .../module-type-ARG/S/Solver_internal/index.html | 2 +- .../S/Solver_internal/module-type-PREPROCESS_ACTS/index.html | 2 +- .../Sidekick_th_data/module-type-ARG/S/T/Fun/index.html | 2 +- .../Sidekick_th_data/module-type-ARG/S/T/Term/index.html | 2 +- dev/sidekick/Sidekick_th_data/module-type-ARG/S/T/Ty/index.html | 2 +- dev/sidekick/Sidekick_th_data/module-type-ARG/S/T/index.html | 2 +- .../Sidekick_th_data/module-type-ARG/S/Unknown/index.html | 2 +- dev/sidekick/Sidekick_th_data/module-type-ARG/S/index.html | 2 +- .../module-type-ARG/S/module-type-THEORY/index.html | 2 +- dev/sidekick/Sidekick_th_data/module-type-ARG/index.html | 2 +- dev/sidekick/Sidekick_th_data/module-type-PROOF/index.html | 2 +- dev/sidekick/Sidekick_th_data/module-type-S/A/Cstor/index.html | 2 +- dev/sidekick/Sidekick_th_data/module-type-S/A/S/Lit/index.html | 2 +- .../Sidekick_th_data/module-type-S/A/S/Model/index.html | 2 +- .../Sidekick_th_data/module-type-S/A/S/P/Step_vec/index.html | 2 +- dev/sidekick/Sidekick_th_data/module-type-S/A/S/P/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/Actions/P/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/Actions/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/Expl/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/N/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/P/index.html | 2 +- .../module-type-S/A/S/Solver_internal/CC/index.html | 2 +- .../module-type-S/A/S/Solver_internal/Simplify/index.html | 2 +- .../module-type-S/A/S/Solver_internal/index.html | 2 +- .../A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html | 2 +- .../Sidekick_th_data/module-type-S/A/S/T/Fun/index.html | 2 +- .../Sidekick_th_data/module-type-S/A/S/T/Term/index.html | 2 +- dev/sidekick/Sidekick_th_data/module-type-S/A/S/T/Ty/index.html | 2 +- dev/sidekick/Sidekick_th_data/module-type-S/A/S/T/index.html | 2 +- .../Sidekick_th_data/module-type-S/A/S/Unknown/index.html | 2 +- dev/sidekick/Sidekick_th_data/module-type-S/A/S/index.html | 2 +- .../module-type-S/A/S/module-type-THEORY/index.html | 2 +- dev/sidekick/Sidekick_th_data/module-type-S/A/index.html | 2 +- dev/sidekick/Sidekick_th_data/module-type-S/index.html | 2 +- dev/sidekick/Sidekick_th_data__/index.html | 2 +- dev/sidekick/Sidekick_th_data__Th_intf/index.html | 2 +- dev/sidekick/Sidekick_th_data__Types/index.html | 2 +- dev/sidekick/Sidekick_util/Backtrack_stack/index.html | 2 +- .../Backtrackable_tbl/Make/argument-1-A/index.html | 2 +- dev/sidekick/Sidekick_util/Backtrackable_tbl/Make/index.html | 2 +- dev/sidekick/Sidekick_util/Backtrackable_tbl/index.html | 2 +- .../Sidekick_util/Backtrackable_tbl/module-type-ARG/index.html | 2 +- .../Sidekick_util/Backtrackable_tbl/module-type-S/index.html | 2 +- dev/sidekick/Sidekick_util/Bag/index.html | 2 +- dev/sidekick/Sidekick_util/Bitvec/index.html | 2 +- dev/sidekick/Sidekick_util/Chunk_stack/Buf/index.html | 2 +- dev/sidekick/Sidekick_util/Chunk_stack/Reader/index.html | 2 +- dev/sidekick/Sidekick_util/Chunk_stack/Writer/index.html | 2 +- dev/sidekick/Sidekick_util/Chunk_stack/index.html | 2 +- dev/sidekick/Sidekick_util/Error/index.html | 2 +- dev/sidekick/Sidekick_util/Hash/index.html | 2 +- dev/sidekick/Sidekick_util/IArray/index.html | 2 +- dev/sidekick/Sidekick_util/Int_id/Make/index.html | 2 +- dev/sidekick/Sidekick_util/Int_id/index.html | 2 +- dev/sidekick/Sidekick_util/Int_id/module-type-S/index.html | 2 +- dev/sidekick/Sidekick_util/Log/index.html | 2 +- dev/sidekick/Sidekick_util/Profile/Control/index.html | 2 +- dev/sidekick/Sidekick_util/Profile/index.html | 2 +- .../Sidekick_util/Profile/module-type-BACKEND/index.html | 2 +- dev/sidekick/Sidekick_util/Stat/index.html | 2 +- dev/sidekick/Sidekick_util/Util/index.html | 2 +- dev/sidekick/Sidekick_util/Vec/index.html | 2 +- dev/sidekick/Sidekick_util/VecI32/index.html | 2 +- dev/sidekick/Sidekick_util/VecSmallInt/index.html | 2 +- dev/sidekick/Sidekick_util/Vec_float/index.html | 2 +- .../Vec_sig/Make_extensions/argument-1-B/index.html | 2 +- dev/sidekick/Sidekick_util/Vec_sig/Make_extensions/index.html | 2 +- dev/sidekick/Sidekick_util/Vec_sig/index.html | 2 +- dev/sidekick/Sidekick_util/Vec_sig/module-type-BASE/index.html | 2 +- .../Sidekick_util/Vec_sig/module-type-BASE_RO/index.html | 2 +- .../Sidekick_util/Vec_sig/module-type-EXTENSIONS/index.html | 2 +- dev/sidekick/Sidekick_util/Vec_sig/module-type-S/index.html | 2 +- dev/sidekick/Sidekick_util/Vec_unit/index.html | 2 +- dev/sidekick/Sidekick_util/index.html | 2 +- dev/sidekick/Sidekick_util__/index.html | 2 +- dev/sidekick/Sidekick_util__Backtrack_stack/index.html | 2 +- dev/sidekick/Sidekick_util__Backtrackable_tbl/index.html | 2 +- dev/sidekick/Sidekick_util__Bag/index.html | 2 +- dev/sidekick/Sidekick_util__Bitvec/index.html | 2 +- dev/sidekick/Sidekick_util__Chunk_stack/index.html | 2 +- dev/sidekick/Sidekick_util__Error/index.html | 2 +- dev/sidekick/Sidekick_util__Hash/index.html | 2 +- dev/sidekick/Sidekick_util__IArray/index.html | 2 +- dev/sidekick/Sidekick_util__Int_id/index.html | 2 +- dev/sidekick/Sidekick_util__Log/index.html | 2 +- dev/sidekick/Sidekick_util__Profile/index.html | 2 +- dev/sidekick/Sidekick_util__Stat/index.html | 2 +- dev/sidekick/Sidekick_util__Util/index.html | 2 +- dev/sidekick/Sidekick_util__Vec/index.html | 2 +- dev/sidekick/Sidekick_util__VecI32/index.html | 2 +- dev/sidekick/Sidekick_util__VecSmallInt/index.html | 2 +- dev/sidekick/Sidekick_util__Vec_float/index.html | 2 +- dev/sidekick/Sidekick_util__Vec_sig/index.html | 2 +- dev/sidekick/Sidekick_util__Vec_unit/index.html | 2 +- dev/sidekick/Sidekick_zarith/Int/index.html | 2 +- dev/sidekick/Sidekick_zarith/Rational/index.html | 2 +- dev/sidekick/Sidekick_zarith/index.html | 2 +- dev/sidekick/index.html | 2 +- 1008 files changed, 1008 insertions(+), 1008 deletions(-) diff --git a/dev/odoc.css b/dev/odoc.css index 31951ebd..c5d2acb0 100644 --- a/dev/odoc.css +++ b/dev/odoc.css @@ -1,7 +1,7 @@ @charset "UTF-8"; /* Copyright (c) 2016 The odoc contributors. All rights reserved. Distributed under the ISC license, see terms at the end of the file. - odoc 2.0.0 */ + odoc 2.0.2 */ /* Fonts */ @import url('https://fonts.googleapis.com/css?family=Fira+Mono:400,500'); diff --git a/dev/sidekick-base/Sidekick_base/Base_types/Cstor/index.html b/dev/sidekick-base/Sidekick_base/Base_types/Cstor/index.html index c7f44cfc..0e4ff191 100644 --- a/dev/sidekick-base/Sidekick_base/Base_types/Cstor/index.html +++ b/dev/sidekick-base/Sidekick_base/Base_types/Cstor/index.html @@ -1,2 +1,2 @@ -Cstor (sidekick-base.Sidekick_base.Base_types.Cstor)

Module Base_types.Cstor

Datatype constructors.

A datatype has one or more constructors, each of which is a special kind of function symbol. Constructors are injective and pairwise distinct.

type t = cstor = {
cstor_id : ID.t;
cstor_is_a : ID.t;
mutable cstor_arity : int;
cstor_args : select list lazy_t;
cstor_ty_as_data : data;
cstor_ty : ty lazy_t;
}
val id : t -> ID.t
val ty_args : t -> ty Iter.t
val equal : cstor -> cstor -> bool
val pp : CCFormat.t -> t -> unit
\ No newline at end of file +Cstor (sidekick-base.Sidekick_base.Base_types.Cstor)

Module Base_types.Cstor

Datatype constructors.

A datatype has one or more constructors, each of which is a special kind of function symbol. Constructors are injective and pairwise distinct.

type t = cstor = {
cstor_id : ID.t;
cstor_is_a : ID.t;
mutable cstor_arity : int;
cstor_args : select list lazy_t;
cstor_ty_as_data : data;
cstor_ty : ty lazy_t;
}
val id : t -> ID.t
val ty_args : t -> ty Iter.t
val equal : cstor -> cstor -> bool
val pp : CCFormat.t -> t -> unit
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Base_types/Data/index.html b/dev/sidekick-base/Sidekick_base/Base_types/Data/index.html index 8c6dfb4e..11db3452 100644 --- a/dev/sidekick-base/Sidekick_base/Base_types/Data/index.html +++ b/dev/sidekick-base/Sidekick_base/Base_types/Data/index.html @@ -1,2 +1,2 @@ -Data (sidekick-base.Sidekick_base.Base_types.Data)

Module Base_types.Data

Datatypes

type t = data = {
data_id : ID.t;
data_cstors : cstor Sidekick_base__.ID.Map.t lazy_t;
data_as_ty : ty lazy_t;
}
val pp : CCFormat.t -> t -> unit
\ No newline at end of file +Data (sidekick-base.Sidekick_base.Base_types.Data)

Module Base_types.Data

Datatypes

type t = data = {
data_id : ID.t;
data_cstors : cstor Sidekick_base__.ID.Map.t lazy_t;
data_as_ty : ty lazy_t;
}
val pp : CCFormat.t -> t -> unit
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Base_types/Fun/index.html b/dev/sidekick-base/Sidekick_base/Base_types/Fun/index.html index 475292ed..f2958345 100644 --- a/dev/sidekick-base/Sidekick_base/Base_types/Fun/index.html +++ b/dev/sidekick-base/Sidekick_base/Base_types/Fun/index.html @@ -1,2 +1,2 @@ -Fun (sidekick-base.Sidekick_base.Base_types.Fun)

Module Base_types.Fun

Function symbols

type view = fun_view =
| Fun_undef of fun_ty
| Fun_select of select
| Fun_cstor of cstor
| Fun_is_a of cstor
| Fun_def of {
pp : a. ('a Fmt.printer -> 'a Sidekick_util.IArray.t Fmt.printer) option;
abs : self:term -> term Sidekick_util.IArray.t -> term * bool;
do_cc : bool;
relevant : a. ID.t -> 'a Sidekick_util.IArray.t -> int -> bool;
ty : ID.t -> term Sidekick_util.IArray.t -> ty;
eval : value Sidekick_util.IArray.t -> value;
}		(*

user defined function symbol. A good example can be found in Form for boolean connectives.

*)

Possible definitions for a function symbol

type t = fun_ = {
fun_id : ID.t;
fun_view : fun_view;
}

A function symbol

val id : t -> ID.t
val view : t -> view
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val as_undefined : t -> (t * Ty.Fun.t) option
val as_undefined_exn : t -> t * Ty.Fun.t
val is_undefined : t -> bool
val select : select -> t
val select_idx : cstor -> int -> t
val cstor : cstor -> t
val is_a : cstor -> t
val do_cc : t -> bool
val mk_undef : ID.t -> Ty.Fun.t -> t

Make a new uninterpreted function.

val mk_undef' : ID.t -> Ty.t list -> Ty.t -> t
val mk_undef_const : ID.t -> Ty.t -> t

Make a new uninterpreted constant.

val pp : t CCFormat.printer
module Map : CCMap.S with type key = t
module Tbl : CCHashtbl.S with type key = t
\ No newline at end of file +Fun (sidekick-base.Sidekick_base.Base_types.Fun)

Module Base_types.Fun

Function symbols

type view = fun_view =
| Fun_undef of fun_ty
| Fun_select of select
| Fun_cstor of cstor
| Fun_is_a of cstor
| Fun_def of {
pp : a. ('a Fmt.printer -> 'a Sidekick_util.IArray.t Fmt.printer) option;
abs : self:term -> term Sidekick_util.IArray.t -> term * bool;
do_cc : bool;
relevant : a. ID.t -> 'a Sidekick_util.IArray.t -> int -> bool;
ty : ID.t -> term Sidekick_util.IArray.t -> ty;
eval : value Sidekick_util.IArray.t -> value;
}		(*

user defined function symbol. A good example can be found in Form for boolean connectives.

*)

Possible definitions for a function symbol

type t = fun_ = {
fun_id : ID.t;
fun_view : fun_view;
}

A function symbol

val id : t -> ID.t
val view : t -> view
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val as_undefined : t -> (t * Ty.Fun.t) option
val as_undefined_exn : t -> t * Ty.Fun.t
val is_undefined : t -> bool
val select : select -> t
val select_idx : cstor -> int -> t
val cstor : cstor -> t
val is_a : cstor -> t
val do_cc : t -> bool
val mk_undef : ID.t -> Ty.Fun.t -> t

Make a new uninterpreted function.

val mk_undef' : ID.t -> Ty.t list -> Ty.t -> t
val mk_undef_const : ID.t -> Ty.t -> t

Make a new uninterpreted constant.

val pp : t CCFormat.printer
module Map : CCMap.S with type key = t
module Tbl : CCHashtbl.S with type key = t
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Base_types/Select/index.html b/dev/sidekick-base/Sidekick_base/Base_types/Select/index.html index cf2ae7f8..2a4abf6a 100644 --- a/dev/sidekick-base/Sidekick_base/Base_types/Select/index.html +++ b/dev/sidekick-base/Sidekick_base/Base_types/Select/index.html @@ -1,2 +1,2 @@ -Select (sidekick-base.Sidekick_base.Base_types.Select)

Module Base_types.Select

Datatype selectors.

A selector is a kind of function that allows to obtain an argument of a given constructor.

type t = select = {
select_id : ID.t;
select_cstor : cstor;
select_ty : ty lazy_t;
select_i : int;
}
val ty : t -> ty
\ No newline at end of file +Select (sidekick-base.Sidekick_base.Base_types.Select)

Module Base_types.Select

Datatype selectors.

A selector is a kind of function that allows to obtain an argument of a given constructor.

type t = select = {
select_id : ID.t;
select_cstor : cstor;
select_ty : ty lazy_t;
select_i : int;
}
val ty : t -> ty
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Base_types/Statement/index.html b/dev/sidekick-base/Sidekick_base/Base_types/Statement/index.html index 971be533..5203da1e 100644 --- a/dev/sidekick-base/Sidekick_base/Base_types/Statement/index.html +++ b/dev/sidekick-base/Sidekick_base/Base_types/Statement/index.html @@ -1,2 +1,2 @@ -Statement (sidekick-base.Sidekick_base.Base_types.Statement)

Module Base_types.Statement

Statements.

A statement is an instruction for the SMT solver to do something, like asserting that a formula is true, declaring a new constant, or checking satisfiabilty of the current set of assertions.

type t = statement =
| Stmt_set_logic of string
| Stmt_set_option of string list
| Stmt_set_info of string * string
| Stmt_data of data list
| Stmt_ty_decl of ID.t * int
| Stmt_decl of ID.t * ty list * ty
| Stmt_define of definition list
| Stmt_assert of term
| Stmt_assert_clause of term list
| Stmt_check_sat of (bool * term) list
| Stmt_exit
val pp : Fmt.t -> t -> unit

Pretty print a statement

\ No newline at end of file +Statement (sidekick-base.Sidekick_base.Base_types.Statement)

Module Base_types.Statement

Statements.

A statement is an instruction for the SMT solver to do something, like asserting that a formula is true, declaring a new constant, or checking satisfiabilty of the current set of assertions.

type t = statement =
| Stmt_set_logic of string
| Stmt_set_option of string list
| Stmt_set_info of string * string
| Stmt_data of data list
| Stmt_ty_decl of ID.t * int
| Stmt_decl of ID.t * ty list * ty
| Stmt_define of definition list
| Stmt_assert of term
| Stmt_assert_clause of term list
| Stmt_check_sat of (bool * term) list
| Stmt_exit
val pp : Fmt.t -> t -> unit

Pretty print a statement

\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Base_types/Term/Iter_dag/index.html b/dev/sidekick-base/Sidekick_base/Base_types/Term/Iter_dag/index.html index 1a38b4d6..3b6729c3 100644 --- a/dev/sidekick-base/Sidekick_base/Base_types/Term/Iter_dag/index.html +++ b/dev/sidekick-base/Sidekick_base/Base_types/Term/Iter_dag/index.html @@ -1,2 +1,2 @@ -Iter_dag (sidekick-base.Sidekick_base.Base_types.Term.Iter_dag)

Module Term.Iter_dag

type t
type order =
| Pre
| Post
val create : unit -> t
val iter_dag : ?order:order -> t -> term -> term Iter.t
\ No newline at end of file +Iter_dag (sidekick-base.Sidekick_base.Base_types.Term.Iter_dag)

Module Term.Iter_dag

type t
type order =
| Pre
| Post
val create : unit -> t
val iter_dag : ?order:order -> t -> term -> term Iter.t
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Base_types/Term/LRA/index.html b/dev/sidekick-base/Sidekick_base/Base_types/Term/LRA/index.html index 227d64f4..adcb4541 100644 --- a/dev/sidekick-base/Sidekick_base/Base_types/Term/LRA/index.html +++ b/dev/sidekick-base/Sidekick_base/Base_types/Term/LRA/index.html @@ -1,2 +1,2 @@ -LRA (sidekick-base.Sidekick_base.Base_types.Term.LRA)

Module Term.LRA

Helpers for LRA

val plus : store -> t -> t -> t
val minus : store -> t -> t -> t
val mult : store -> Q.t -> t -> t
val const : store -> Q.t -> t
val leq : store -> t -> t -> t
val lt : store -> t -> t -> t
val geq : store -> t -> t -> t
val gt : store -> t -> t -> t
val eq : store -> t -> t -> t
val neq : store -> t -> t -> t
val var : store -> t -> t
\ No newline at end of file +LRA (sidekick-base.Sidekick_base.Base_types.Term.LRA)

Module Term.LRA

Helpers for LRA

val plus : store -> t -> t -> t
val minus : store -> t -> t -> t
val mult : store -> Q.t -> t -> t
val const : store -> Q.t -> t
val leq : store -> t -> t -> t
val lt : store -> t -> t -> t
val geq : store -> t -> t -> t
val gt : store -> t -> t -> t
val eq : store -> t -> t -> t
val neq : store -> t -> t -> t
val var : store -> t -> t
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Base_types/Term/index.html b/dev/sidekick-base/Sidekick_base/Base_types/Term/index.html index 15af394f..d3f74f0a 100644 --- a/dev/sidekick-base/Sidekick_base/Base_types/Term/index.html +++ b/dev/sidekick-base/Sidekick_base/Base_types/Term/index.html @@ -1,2 +1,2 @@ -Term (sidekick-base.Sidekick_base.Base_types.Term)

Module Base_types.Term

Term creation and manipulation

type t = term = {
mutable term_id : int;
mutable term_ty : ty;
term_view : t term_view;
}
type 'a view = 'a term_view =
| Bool of bool
| App_fun of fun_ * 'a Sidekick_util.IArray.t
| Eq of 'a * 'a
| Not of 'a
| Ite of 'a * 'a * 'a
| LRA of (Q.t, 'a) lra_view
val id : t -> int
val view : t -> term view
val ty : t -> Ty.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
type store
val create : ?size:int -> unit -> store
val make : store -> t view -> t
val true_ : store -> t
val false_ : store -> t
val bool : store -> bool -> t
val const : store -> fun_ -> t
val app_fun : store -> fun_ -> t Sidekick_util.IArray.t -> t
val app_fun_l : store -> fun_ -> t list -> t
val eq : store -> t -> t -> t
val not_ : store -> t -> t
val ite : store -> t -> t -> t -> t
val app_undefined : store -> ID.t -> Ty.Fun.t -> t Sidekick_util.IArray.t -> t

app_undefined store f ty args is app store (Fun.mk_undef f ty) args. It builds a function symbol and applies it into a term immediately

val const_undefined : store -> ID.t -> Ty.t -> t

const_undefined store f ty is const store (Fun.mk_undef_const f ty). It builds a constant function symbol and makes it into a term immediately.

val select : store -> select -> t -> t
val app_cstor : store -> cstor -> t Sidekick_util.IArray.t -> t
val is_a : store -> cstor -> t -> t
val lra : store -> (Q.t, t) lra_view -> t
module LRA : sig ... end

Helpers for LRA

val abs : store -> t -> t * bool

Obtain unsigned version of t, + the sign as a boolean

module Iter_dag : sig ... end
val iter_dag_with : order:Iter_dag.order -> t -> t Iter.t
val iter_dag : t -> t Iter.t
val map_shallow : store -> (t -> t) -> t -> t
val pp : t Fmt.printer

Views

val is_true : t -> bool
val is_false : t -> bool
val is_const : t -> bool
val cc_view : t -> (fun_, t, t Iter.t) CC_view.t
val as_fun_undef : t -> (fun_ * Ty.Fun.t) option
val as_bool : t -> bool option

Store

val store_size : store -> int
val store_iter : store -> term Iter.t

Containers

module Tbl : CCHashtbl.S with type key = t
module Map : CCMap.S with type key = t
module Set : CCSet.S with type elt = t
\ No newline at end of file +Term (sidekick-base.Sidekick_base.Base_types.Term)

Module Base_types.Term

Term creation and manipulation

type t = term = {
mutable term_id : int;
mutable term_ty : ty;
term_view : t term_view;
}
type 'a view = 'a term_view =
| Bool of bool
| App_fun of fun_ * 'a Sidekick_util.IArray.t
| Eq of 'a * 'a
| Not of 'a
| Ite of 'a * 'a * 'a
| LRA of (Q.t, 'a) lra_view
val id : t -> int
val view : t -> term view
val ty : t -> Ty.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
type store
val create : ?size:int -> unit -> store
val make : store -> t view -> t
val true_ : store -> t
val false_ : store -> t
val bool : store -> bool -> t
val const : store -> fun_ -> t
val app_fun : store -> fun_ -> t Sidekick_util.IArray.t -> t
val app_fun_l : store -> fun_ -> t list -> t
val eq : store -> t -> t -> t
val not_ : store -> t -> t
val ite : store -> t -> t -> t -> t
val app_undefined : store -> ID.t -> Ty.Fun.t -> t Sidekick_util.IArray.t -> t

app_undefined store f ty args is app store (Fun.mk_undef f ty) args. It builds a function symbol and applies it into a term immediately

val const_undefined : store -> ID.t -> Ty.t -> t

const_undefined store f ty is const store (Fun.mk_undef_const f ty). It builds a constant function symbol and makes it into a term immediately.

val select : store -> select -> t -> t
val app_cstor : store -> cstor -> t Sidekick_util.IArray.t -> t
val is_a : store -> cstor -> t -> t
val lra : store -> (Q.t, t) lra_view -> t
module LRA : sig ... end

Helpers for LRA

val abs : store -> t -> t * bool

Obtain unsigned version of t, + the sign as a boolean

module Iter_dag : sig ... end
val iter_dag_with : order:Iter_dag.order -> t -> t Iter.t
val iter_dag : t -> t Iter.t
val map_shallow : store -> (t -> t) -> t -> t
val pp : t Fmt.printer

Views

val is_true : t -> bool
val is_false : t -> bool
val is_const : t -> bool
val cc_view : t -> (fun_, t, t Iter.t) CC_view.t
val as_fun_undef : t -> (fun_ * Ty.Fun.t) option
val as_bool : t -> bool option

Store

val store_size : store -> int
val store_iter : store -> term Iter.t

Containers

module Tbl : CCHashtbl.S with type key = t
module Map : CCMap.S with type key = t
module Set : CCSet.S with type elt = t
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Base_types/Term_cell/Make_eq/argument-1-X/index.html b/dev/sidekick-base/Sidekick_base/Base_types/Term_cell/Make_eq/argument-1-X/index.html index cbcacbd0..73da3453 100644 --- a/dev/sidekick-base/Sidekick_base/Base_types/Term_cell/Make_eq/argument-1-X/index.html +++ b/dev/sidekick-base/Sidekick_base/Base_types/Term_cell/Make_eq/argument-1-X/index.html @@ -1,2 +1,2 @@ -X (sidekick-base.Sidekick_base.Base_types.Term_cell.Make_eq.1-X)

Parameter Make_eq.1-X

type t
val hash : t -> int
val equal : t -> t -> bool
val pp : t Fmt.printer
\ No newline at end of file +X (sidekick-base.Sidekick_base.Base_types.Term_cell.Make_eq.1-X)

Parameter Make_eq.1-X

type t
val hash : t -> int
val equal : t -> t -> bool
val pp : t Fmt.printer
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Base_types/Term_cell/Make_eq/index.html b/dev/sidekick-base/Sidekick_base/Base_types/Term_cell/Make_eq/index.html index 8aa1c723..d23ce76e 100644 --- a/dev/sidekick-base/Sidekick_base/Base_types/Term_cell/Make_eq/index.html +++ b/dev/sidekick-base/Sidekick_base/Base_types/Term_cell/Make_eq/index.html @@ -1,2 +1,2 @@ -Make_eq (sidekick-base.Sidekick_base.Base_types.Term_cell.Make_eq)

Module Term_cell.Make_eq

Parameters

module X : ARG

Signature

val equal : X.t view -> X.t view -> bool
val hash : X.t view -> int
val pp : X.t view Fmt.printer
\ No newline at end of file +Make_eq (sidekick-base.Sidekick_base.Base_types.Term_cell.Make_eq)

Module Term_cell.Make_eq

Parameters

module X : ARG

Signature

val equal : X.t view -> X.t view -> bool
val hash : X.t view -> int
val pp : X.t view Fmt.printer
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Base_types/Term_cell/index.html b/dev/sidekick-base/Sidekick_base/Base_types/Term_cell/index.html index cc8aaf78..e3e82e2f 100644 --- a/dev/sidekick-base/Sidekick_base/Base_types/Term_cell/index.html +++ b/dev/sidekick-base/Sidekick_base/Base_types/Term_cell/index.html @@ -1,2 +1,2 @@ -Term_cell (sidekick-base.Sidekick_base.Base_types.Term_cell)

Module Base_types.Term_cell

type 'a view = 'a term_view =
| Bool of bool
| App_fun of fun_ * 'a Sidekick_util.IArray.t
| Eq of 'a * 'a
| Not of 'a
| Ite of 'a * 'a * 'a
| LRA of (Q.t, 'a) lra_view
type t = term view
val equal : t -> t -> bool
val hash : t -> int
val true_ : t
val false_ : t
val const : fun_ -> t
val app_fun : fun_ -> term Sidekick_util.IArray.t -> t
val eq : term -> term -> t
val not_ : term -> t
val ite : term -> term -> term -> t
val lra : (Q.t, term) lra_view -> t
val ty : t -> Ty.t

Compute the type of this term cell. Not totally free

val pp : t Fmt.printer
val map : ('a -> 'b) -> 'a view -> 'b view
val iter : ('a -> unit) -> 'a view -> unit
module type ARG = sig ... end
module Make_eq (X : ARG) : sig ... end
\ No newline at end of file +Term_cell (sidekick-base.Sidekick_base.Base_types.Term_cell)

Module Base_types.Term_cell

type 'a view = 'a term_view =
| Bool of bool
| App_fun of fun_ * 'a Sidekick_util.IArray.t
| Eq of 'a * 'a
| Not of 'a
| Ite of 'a * 'a * 'a
| LRA of (Q.t, 'a) lra_view
type t = term view
val equal : t -> t -> bool
val hash : t -> int
val true_ : t
val false_ : t
val const : fun_ -> t
val app_fun : fun_ -> term Sidekick_util.IArray.t -> t
val eq : term -> term -> t
val not_ : term -> t
val ite : term -> term -> term -> t
val lra : (Q.t, term) lra_view -> t
val ty : t -> Ty.t

Compute the type of this term cell. Not totally free

val pp : t Fmt.printer
val map : ('a -> 'b) -> 'a view -> 'b view
val iter : ('a -> unit) -> 'a view -> unit
module type ARG = sig ... end
module Make_eq (X : ARG) : sig ... end
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Base_types/Term_cell/module-type-ARG/index.html b/dev/sidekick-base/Sidekick_base/Base_types/Term_cell/module-type-ARG/index.html index 4fcc7e46..b9873cad 100644 --- a/dev/sidekick-base/Sidekick_base/Base_types/Term_cell/module-type-ARG/index.html +++ b/dev/sidekick-base/Sidekick_base/Base_types/Term_cell/module-type-ARG/index.html @@ -1,2 +1,2 @@ -ARG (sidekick-base.Sidekick_base.Base_types.Term_cell.ARG)

Module type Term_cell.ARG

type t
val hash : t -> int
val equal : t -> t -> bool
val pp : t Fmt.printer
\ No newline at end of file +ARG (sidekick-base.Sidekick_base.Base_types.Term_cell.ARG)

Module type Term_cell.ARG

type t
val hash : t -> int
val equal : t -> t -> bool
val pp : t Fmt.printer
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Base_types/Ty/Fun/index.html b/dev/sidekick-base/Sidekick_base/Base_types/Ty/Fun/index.html index 5f2ff961..320326a4 100644 --- a/dev/sidekick-base/Sidekick_base/Base_types/Ty/Fun/index.html +++ b/dev/sidekick-base/Sidekick_base/Base_types/Ty/Fun/index.html @@ -1,2 +1,2 @@ -Fun (sidekick-base.Sidekick_base.Base_types.Ty.Fun)

Module Ty.Fun

type t = fun_ty
val args : t -> ty list
val ret : t -> ty
val arity : t -> int
val unfold : t -> ty list * ty
val mk : ty list -> ty -> t
val pp : t CCFormat.printer
\ No newline at end of file +Fun (sidekick-base.Sidekick_base.Base_types.Ty.Fun)

Module Ty.Fun

type t = fun_ty
val args : t -> ty list
val ret : t -> ty
val arity : t -> int
val unfold : t -> ty list * ty
val mk : ty list -> ty -> t
val pp : t CCFormat.printer
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Base_types/Ty/index.html b/dev/sidekick-base/Sidekick_base/Base_types/Ty/index.html index f336a438..d6e5a7f6 100644 --- a/dev/sidekick-base/Sidekick_base/Base_types/Ty/index.html +++ b/dev/sidekick-base/Sidekick_base/Base_types/Ty/index.html @@ -1,2 +1,2 @@ -Ty (sidekick-base.Sidekick_base.Base_types.Ty)

Module Base_types.Ty

Types

type t = ty
type store = unit
type view = ty_view =
| Ty_bool
| Ty_real
| Ty_atomic of {
def : ty_def;
args : ty list;
mutable finite : bool;
}
type def = ty_def =
| Ty_uninterpreted of ID.t
| Ty_data of {
data : data;
}
| Ty_def of {
id : ID.t;
pp : ty Fmt.printer -> ty list Fmt.printer;
default_val : value list -> value;
}
val id : t -> int
val view : t -> view
val bool : store -> t
val real : store -> t
val atomic : def -> t list -> t
val id_of_def : def -> ID.t
val atomic_uninterpreted : ID.t -> t
val finite : t -> bool
val set_finite : t -> bool -> unit
val is_bool : t -> bool
val is_uninterpreted : t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t CCFormat.printer
module Tbl : CCHashtbl.S with type key = t
module Fun : sig ... end
\ No newline at end of file +Ty (sidekick-base.Sidekick_base.Base_types.Ty)

Module Base_types.Ty

Types

type t = ty
type store = unit
type view = ty_view =
| Ty_bool
| Ty_real
| Ty_atomic of {
def : ty_def;
args : ty list;
mutable finite : bool;
}
type def = ty_def =
| Ty_uninterpreted of ID.t
| Ty_data of {
data : data;
}
| Ty_def of {
id : ID.t;
pp : ty Fmt.printer -> ty list Fmt.printer;
default_val : value list -> value;
}
val id : t -> int
val view : t -> view
val bool : store -> t
val real : store -> t
val atomic : def -> t list -> t
val id_of_def : def -> ID.t
val atomic_uninterpreted : ID.t -> t
val finite : t -> bool
val set_finite : t -> bool -> unit
val is_bool : t -> bool
val is_uninterpreted : t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t CCFormat.printer
module Tbl : CCHashtbl.S with type key = t
module Fun : sig ... end
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Base_types/Value/index.html b/dev/sidekick-base/Sidekick_base/Base_types/Value/index.html index af6ec3d7..1107fbe1 100644 --- a/dev/sidekick-base/Sidekick_base/Base_types/Value/index.html +++ b/dev/sidekick-base/Sidekick_base/Base_types/Value/index.html @@ -1,2 +1,2 @@ -Value (sidekick-base.Sidekick_base.Base_types.Value)

Module Base_types.Value

Values (used in models)

type t = value =
| V_bool of bool
| V_element of {
id : ID.t;
ty : ty;
}
| V_cstor of {
c : cstor;
args : value list;
}
| V_custom of {
view : value_custom_view;
pp : value_custom_view Fmt.printer;
eq : value_custom_view -> value_custom_view -> bool;
hash : value_custom_view -> int;
}
| V_real of Q.t
val true_ : t
val false_ : t
val bool : bool -> t
val real : Q.t -> t
val real_of_string : string -> t
val mk_elt : ID.t -> Ty.t -> t
val is_bool : t -> bool
val is_true : t -> bool
val is_false : t -> bool
val cstor_app : cstor -> t list -> t
val fresh : Term.t -> t
val hash : t -> int
val equal : t -> t -> bool
val pp : t Fmt.printer
\ No newline at end of file +Value (sidekick-base.Sidekick_base.Base_types.Value)

Module Base_types.Value

Values (used in models)

type t = value =
| V_bool of bool
| V_element of {
id : ID.t;
ty : ty;
}
| V_cstor of {
c : cstor;
args : value list;
}
| V_custom of {
view : value_custom_view;
pp : value_custom_view Fmt.printer;
eq : value_custom_view -> value_custom_view -> bool;
hash : value_custom_view -> int;
}
| V_real of Q.t
val true_ : t
val false_ : t
val bool : bool -> t
val real : Q.t -> t
val real_of_string : string -> t
val mk_elt : ID.t -> Ty.t -> t
val is_bool : t -> bool
val is_true : t -> bool
val is_false : t -> bool
val cstor_app : cstor -> t list -> t
val fresh : Term.t -> t
val hash : t -> int
val equal : t -> t -> bool
val pp : t Fmt.printer
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Base_types/index.html b/dev/sidekick-base/Sidekick_base/Base_types/index.html index 64f5266a..e8a913ed 100644 --- a/dev/sidekick-base/Sidekick_base/Base_types/index.html +++ b/dev/sidekick-base/Sidekick_base/Base_types/index.html @@ -1,2 +1,2 @@ -Base_types (sidekick-base.Sidekick_base.Base_types)

Module Sidekick_base.Base_types

Basic type definitions for Sidekick_base

module Vec = Sidekick_util.Vec
module Log = Sidekick_util.Log
module Fmt = CCFormat
module CC_view = Sidekick_core.CC_view
type lra_pred = Sidekick_arith_lra.Predicate.t =
| Leq
| Geq
| Lt
| Gt
| Eq
| Neq
type lra_op = Sidekick_arith_lra.op =
| Plus
| Minus
type ('num, 'a) lra_view = ('num, 'a) Sidekick_arith_lra.lra_view =
| LRA_pred of lra_pred * 'a * 'a
| LRA_op of lra_op * 'a * 'a
| LRA_mult of 'num * 'a
| LRA_const of 'num
| LRA_simplex_var of 'a
| LRA_simplex_pred of 'a * Sidekick_arith_lra.S_op.t * 'num
| LRA_other of 'a
type term = {
mutable term_id : int;
mutable term_ty : ty;
term_view : term term_view;
}

Term.

A term, with its own view, type, and a unique identifier. Do not create directly, see Term.

and 'a term_view =
| Bool of bool
| App_fun of fun_ * 'a Sidekick_util.IArray.t
| Eq of 'a * 'a
| Not of 'a
| Ite of 'a * 'a * 'a
| LRA of (Q.t, 'a) lra_view

Shallow structure of a term.

A term is a DAG (direct acyclic graph) of nodes, each of which has a term view.

and fun_ = {
fun_id : ID.t;
fun_view : fun_view;
}

type of function symbols

and fun_view =
| Fun_undef of fun_ty
| Fun_select of select
| Fun_cstor of cstor
| Fun_is_a of cstor
| Fun_def of {
pp : a. ('a Fmt.printer -> 'a Sidekick_util.IArray.t Fmt.printer) option;
abs : self:term -> term Sidekick_util.IArray.t -> term * bool;
do_cc : bool;
relevant : a. ID.t -> 'a Sidekick_util.IArray.t -> int -> bool;
ty : ID.t -> term Sidekick_util.IArray.t -> ty;
eval : value Sidekick_util.IArray.t -> value;
}		(*

Methods on the custom term view whose arguments are 'a. Terms must be printable, and provide some additional theory handles.

  • relevant must return a subset of args (possibly the same set). The terms it returns will be activated and evaluated whenever possible. Terms in args \ relevant args are considered for congruence but not for evaluation.
*)
and fun_ty = {
fun_ty_args : ty list;
fun_ty_ret : ty;
}

Function type

and ty = {
mutable ty_id : int;
ty_view : ty_view;
}

Hashconsed type

and ty_view =
| Ty_bool
| Ty_real
| Ty_atomic of {
def : ty_def;
args : ty list;
mutable finite : bool;
}
and ty_def =
| Ty_uninterpreted of ID.t
| Ty_data of {
data : data;
}
| Ty_def of {
id : ID.t;
pp : ty Fmt.printer -> ty list Fmt.printer;
default_val : value list -> value;
}
and data = {
data_id : ID.t;
data_cstors : cstor Sidekick_base__.ID.Map.t lazy_t;
data_as_ty : ty lazy_t;
}
and cstor = {
cstor_id : ID.t;
cstor_is_a : ID.t;
mutable cstor_arity : int;
cstor_args : select list lazy_t;
cstor_ty_as_data : data;
cstor_ty : ty lazy_t;
}
and select = {
select_id : ID.t;
select_cstor : cstor;
select_ty : ty lazy_t;
select_i : int;
}
and value =
| V_bool of bool
| V_element of {
id : ID.t;
ty : ty;
}		(*

a named constant, distinct from any other constant

*)
| V_cstor of {
c : cstor;
args : value list;
}
| V_custom of {
view : value_custom_view;
pp : value_custom_view Fmt.printer;
eq : value_custom_view -> value_custom_view -> bool;
hash : value_custom_view -> int;
}		(*

Custom value

*)
| V_real of Q.t

Semantic values, used for models (and possibly model-constructing calculi)

and value_custom_view = ..
type definition = ID.t * ty * term
type statement =
| Stmt_set_logic of string
| Stmt_set_option of string list
| Stmt_set_info of string * string
| Stmt_data of data list
| Stmt_ty_decl of ID.t * int
| Stmt_decl of ID.t * ty list * ty
| Stmt_define of definition list
| Stmt_assert of term
| Stmt_assert_clause of term list
| Stmt_check_sat of (bool * term) list
| Stmt_exit
val term_equal_ : term -> term -> bool
val term_hash_ : term -> int
val term_cmp_ : term -> term -> int
val fun_compare : fun_ -> fun_ -> int
val pp_fun : CCFormat.t -> fun_ -> unit
val id_of_fun : fun_ -> ID.t
val eq_ty : ty -> ty -> bool
val eq_cstor : cstor -> cstor -> bool
val eq_value : value -> value -> bool
val hash_value : value Sidekick_util.Hash.t
val pp_db : Stdlib.Format.formatter -> (int * 'a) -> unit
val string_of_lra_pred : lra_pred -> string
val pp_pred : Fmt.t -> lra_pred -> unit
val string_of_lra_op : lra_op -> string
val pp_lra_op : Fmt.t -> lra_op -> unit
val pp_term_view_gen : pp_id:(Fmt.t -> ID.t -> unit) -> pp_t:'a Fmt.printer -> Fmt.t -> 'a term_view -> unit
val pp_term_top : ids:bool -> Fmt.t -> term -> unit
val pp_term : Fmt.t -> term -> unit
val pp_term_view : Fmt.t -> term term_view -> unit
module Ty : sig ... end

Types

module Fun : sig ... end

Function symbols

module Term_cell : sig ... end
module Term : sig ... end

Term creation and manipulation

module Value : sig ... end

Values (used in models)

module Data : sig ... end

Datatypes

module Select : sig ... end

Datatype selectors.

module Cstor : sig ... end

Datatype constructors.

module Statement : sig ... end

Statements.

\ No newline at end of file +Base_types (sidekick-base.Sidekick_base.Base_types)

Module Sidekick_base.Base_types

Basic type definitions for Sidekick_base

module Vec = Sidekick_util.Vec
module Log = Sidekick_util.Log
module Fmt = CCFormat
module CC_view = Sidekick_core.CC_view
type lra_pred = Sidekick_arith_lra.Predicate.t =
| Leq
| Geq
| Lt
| Gt
| Eq
| Neq
type lra_op = Sidekick_arith_lra.op =
| Plus
| Minus
type ('num, 'a) lra_view = ('num, 'a) Sidekick_arith_lra.lra_view =
| LRA_pred of lra_pred * 'a * 'a
| LRA_op of lra_op * 'a * 'a
| LRA_mult of 'num * 'a
| LRA_const of 'num
| LRA_simplex_var of 'a
| LRA_simplex_pred of 'a * Sidekick_arith_lra.S_op.t * 'num
| LRA_other of 'a
type term = {
mutable term_id : int;
mutable term_ty : ty;
term_view : term term_view;
}

Term.

A term, with its own view, type, and a unique identifier. Do not create directly, see Term.

and 'a term_view =
| Bool of bool
| App_fun of fun_ * 'a Sidekick_util.IArray.t
| Eq of 'a * 'a
| Not of 'a
| Ite of 'a * 'a * 'a
| LRA of (Q.t, 'a) lra_view

Shallow structure of a term.

A term is a DAG (direct acyclic graph) of nodes, each of which has a term view.

and fun_ = {
fun_id : ID.t;
fun_view : fun_view;
}

type of function symbols

and fun_view =
| Fun_undef of fun_ty
| Fun_select of select
| Fun_cstor of cstor
| Fun_is_a of cstor
| Fun_def of {
pp : a. ('a Fmt.printer -> 'a Sidekick_util.IArray.t Fmt.printer) option;
abs : self:term -> term Sidekick_util.IArray.t -> term * bool;
do_cc : bool;
relevant : a. ID.t -> 'a Sidekick_util.IArray.t -> int -> bool;
ty : ID.t -> term Sidekick_util.IArray.t -> ty;
eval : value Sidekick_util.IArray.t -> value;
}		(*

Methods on the custom term view whose arguments are 'a. Terms must be printable, and provide some additional theory handles.

  • relevant must return a subset of args (possibly the same set). The terms it returns will be activated and evaluated whenever possible. Terms in args \ relevant args are considered for congruence but not for evaluation.
*)
and fun_ty = {
fun_ty_args : ty list;
fun_ty_ret : ty;
}

Function type

and ty = {
mutable ty_id : int;
ty_view : ty_view;
}

Hashconsed type

and ty_view =
| Ty_bool
| Ty_real
| Ty_atomic of {
def : ty_def;
args : ty list;
mutable finite : bool;
}
and ty_def =
| Ty_uninterpreted of ID.t
| Ty_data of {
data : data;
}
| Ty_def of {
id : ID.t;
pp : ty Fmt.printer -> ty list Fmt.printer;
default_val : value list -> value;
}
and data = {
data_id : ID.t;
data_cstors : cstor Sidekick_base__.ID.Map.t lazy_t;
data_as_ty : ty lazy_t;
}
and cstor = {
cstor_id : ID.t;
cstor_is_a : ID.t;
mutable cstor_arity : int;
cstor_args : select list lazy_t;
cstor_ty_as_data : data;
cstor_ty : ty lazy_t;
}
and select = {
select_id : ID.t;
select_cstor : cstor;
select_ty : ty lazy_t;
select_i : int;
}
and value =
| V_bool of bool
| V_element of {
id : ID.t;
ty : ty;
}		(*

a named constant, distinct from any other constant

*)
| V_cstor of {
c : cstor;
args : value list;
}
| V_custom of {
view : value_custom_view;
pp : value_custom_view Fmt.printer;
eq : value_custom_view -> value_custom_view -> bool;
hash : value_custom_view -> int;
}		(*

Custom value

*)
| V_real of Q.t

Semantic values, used for models (and possibly model-constructing calculi)

and value_custom_view = ..
type definition = ID.t * ty * term
type statement =
| Stmt_set_logic of string
| Stmt_set_option of string list
| Stmt_set_info of string * string
| Stmt_data of data list
| Stmt_ty_decl of ID.t * int
| Stmt_decl of ID.t * ty list * ty
| Stmt_define of definition list
| Stmt_assert of term
| Stmt_assert_clause of term list
| Stmt_check_sat of (bool * term) list
| Stmt_exit
val term_equal_ : term -> term -> bool
val term_hash_ : term -> int
val term_cmp_ : term -> term -> int
val fun_compare : fun_ -> fun_ -> int
val pp_fun : CCFormat.t -> fun_ -> unit
val id_of_fun : fun_ -> ID.t
val eq_ty : ty -> ty -> bool
val eq_cstor : cstor -> cstor -> bool
val eq_value : value -> value -> bool
val hash_value : value Sidekick_util.Hash.t
val pp_db : Stdlib.Format.formatter -> (int * 'a) -> unit
val string_of_lra_pred : lra_pred -> string
val pp_pred : Fmt.t -> lra_pred -> unit
val string_of_lra_op : lra_op -> string
val pp_lra_op : Fmt.t -> lra_op -> unit
val pp_term_view_gen : pp_id:(Fmt.t -> ID.t -> unit) -> pp_t:'a Fmt.printer -> Fmt.t -> 'a term_view -> unit
val pp_term_top : ids:bool -> Fmt.t -> term -> unit
val pp_term : Fmt.t -> term -> unit
val pp_term_view : Fmt.t -> term term_view -> unit
module Ty : sig ... end

Types

module Fun : sig ... end

Function symbols

module Term_cell : sig ... end
module Term : sig ... end

Term creation and manipulation

module Value : sig ... end

Values (used in models)

module Data : sig ... end

Datatypes

module Select : sig ... end

Datatype selectors.

module Cstor : sig ... end

Datatype constructors.

module Statement : sig ... end

Statements.

\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Form/Funs/index.html b/dev/sidekick-base/Sidekick_base/Form/Funs/index.html index 3aa578dd..13c1ab0f 100644 --- a/dev/sidekick-base/Sidekick_base/Form/Funs/index.html +++ b/dev/sidekick-base/Sidekick_base/Form/Funs/index.html @@ -1,2 +1,2 @@ -Funs (sidekick-base.Sidekick_base.Form.Funs)

Module Form.Funs

val get_ty : 'a -> 'b -> Ty.t
val abs : self:T.t -> 'a -> T.t * bool
val relevant : 'a -> 'b -> 'c -> bool
val mk_fun : ?do_cc:bool -> ID.t -> Fun.t
val and_ : Fun.t
val or_ : Fun.t
val imply : Fun.t
val ite : T.store -> T.t -> T.t -> T.t -> T.t
\ No newline at end of file +Funs (sidekick-base.Sidekick_base.Form.Funs)

Module Form.Funs

val get_ty : 'a -> 'b -> Ty.t
val abs : self:T.t -> 'a -> T.t * bool
val relevant : 'a -> 'b -> 'c -> bool
val mk_fun : ?do_cc:bool -> ID.t -> Fun.t
val and_ : Fun.t
val or_ : Fun.t
val imply : Fun.t
val ite : T.store -> T.t -> T.t -> T.t -> T.t
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Form/Gensym/index.html b/dev/sidekick-base/Sidekick_base/Form/Gensym/index.html index e157f86d..d8921715 100644 --- a/dev/sidekick-base/Sidekick_base/Form/Gensym/index.html +++ b/dev/sidekick-base/Sidekick_base/Form/Gensym/index.html @@ -1,2 +1,2 @@ -Gensym (sidekick-base.Sidekick_base.Form.Gensym)

Module Form.Gensym

type t = {
tst : T.store;
mutable fresh : int;
}
val create : T.store -> t
val fresh_term : t -> pre:string -> Ty.t -> T.t
\ No newline at end of file +Gensym (sidekick-base.Sidekick_base.Form.Gensym)

Module Form.Gensym

type t = {
tst : T.store;
mutable fresh : int;
}
val create : T.store -> t
val fresh_term : t -> pre:string -> Ty.t -> T.t
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Form/index.html b/dev/sidekick-base/Sidekick_base/Form/index.html index ac9b5fcc..6c9c44cd 100644 --- a/dev/sidekick-base/Sidekick_base/Form/index.html +++ b/dev/sidekick-base/Sidekick_base/Form/index.html @@ -1,2 +1,2 @@ -Form (sidekick-base.Sidekick_base.Form)

Module Sidekick_base.Form

Formulas (boolean terms).

This module defines function symbols, constants, and views to manipulate boolean formulas in Sidekick_base. This is useful to have the ability to use boolean connectives instead of being limited to clauses; by using Sidekick_th_bool_static, the formulas are turned into clauses automatically for you.

module T = Base_types.Term
module Ty = Base_types.Ty
module Fun = Base_types.Fun
module Value = Base_types.Value
exception Not_a_th_term
val id_and : ID.t
val id_or : ID.t
val id_imply : ID.t
module Funs : sig ... end
val as_id : ID.t -> T.t -> T.t Sidekick_util.IArray.t option
val flatten_id : ID.t -> bool -> T.t list -> T.t list
val and_l : T.store -> T.t list -> T.t
val or_l : T.store -> T.t list -> T.t
val and_ : T.store -> T.t -> T.t -> T.t
val or_ : T.store -> T.t -> T.t -> T.t
val eq : T.store -> T.t -> T.t -> T.t
val not_ : T.store -> T.t -> T.t
val ite : T.store -> T.t -> T.t -> T.t -> T.t
val equiv : T.store -> T.t -> T.t -> T.t
val neq : T.store -> T.t -> T.t -> T.t
val imply_a : T.store -> T.t Sidekick_util.IArray.t -> T.t -> T.t
val imply_l : T.store -> T.t list -> T.t -> T.t
val imply : T.store -> T.t -> T.t -> T.t
val xor : T.store -> T.t -> T.t -> T.t
val distinct_l : T.store -> T.t CCList.t -> T.t
module Gensym : sig ... end
val check_congruence_classes : bool
\ No newline at end of file +Form (sidekick-base.Sidekick_base.Form)

Module Sidekick_base.Form

Formulas (boolean terms).

This module defines function symbols, constants, and views to manipulate boolean formulas in Sidekick_base. This is useful to have the ability to use boolean connectives instead of being limited to clauses; by using Sidekick_th_bool_static, the formulas are turned into clauses automatically for you.

module T = Base_types.Term
module Ty = Base_types.Ty
module Fun = Base_types.Fun
module Value = Base_types.Value
exception Not_a_th_term
val id_and : ID.t
val id_or : ID.t
val id_imply : ID.t
module Funs : sig ... end
val as_id : ID.t -> T.t -> T.t Sidekick_util.IArray.t option
val flatten_id : ID.t -> bool -> T.t list -> T.t list
val and_l : T.store -> T.t list -> T.t
val or_l : T.store -> T.t list -> T.t
val and_ : T.store -> T.t -> T.t -> T.t
val or_ : T.store -> T.t -> T.t -> T.t
val eq : T.store -> T.t -> T.t -> T.t
val not_ : T.store -> T.t -> T.t
val ite : T.store -> T.t -> T.t -> T.t -> T.t
val equiv : T.store -> T.t -> T.t -> T.t
val neq : T.store -> T.t -> T.t -> T.t
val imply_a : T.store -> T.t Sidekick_util.IArray.t -> T.t -> T.t
val imply_l : T.store -> T.t list -> T.t -> T.t
val imply : T.store -> T.t -> T.t -> T.t
val xor : T.store -> T.t -> T.t -> T.t
val distinct_l : T.store -> T.t CCList.t -> T.t
module Gensym : sig ... end
val check_congruence_classes : bool
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/ID/index.html b/dev/sidekick-base/Sidekick_base/ID/index.html index 2611dc4a..b95bb974 100644 --- a/dev/sidekick-base/Sidekick_base/ID/index.html +++ b/dev/sidekick-base/Sidekick_base/ID/index.html @@ -1,2 +1,2 @@ -ID (sidekick-base.Sidekick_base.ID)

Module Sidekick_base.ID

Unique Identifiers

We use generative identifiers everywhere in Sidekick_base. Unlike strings, there are no risk of collision: during parsing, a new declaration or definition should create a fresh ID.t and associate it with the string name, and later references should look into some hashtable or map to get the ID corresponding to a string.

This allows us to handle definition shadowing or binder shadowing easily.

type t

The opaque type of unique identifiers

val make : string -> t

make s creates a new identifier with name s and some internal information. It is different than any other identifier created before or after, even with the same name.

val makef : ('a, Stdlib.Format.formatter, unit, t) Stdlib.format4 -> 'a

makef "foo %d bar %b" 42 true is like make (Format.asprintf "foo %d bar %b" 42 true).

val copy : t -> t

Fresh copy of the identifier, distinct from it, but with the same name.

val id : t -> int

Unique integer counter for this identifier.

val to_string : t -> string

Print identifier.

val to_string_full : t -> string

Printer name and unique counter for this ID.

include Sidekick_util.Intf.EQ with type t := t
val equal : t -> t -> bool
include Sidekick_util.Intf.ORD with type t := t
val compare : t -> t -> int
include Sidekick_util.Intf.HASH with type t := t
val hash : t -> int
include Sidekick_util.Intf.PRINT with type t := t
val pp : t CCFormat.printer
val pp_name : t CCFormat.printer
module Map : CCMap.S with type key = t
module Set : CCSet.S with type elt = t
module Tbl : CCHashtbl.S with type key = t
\ No newline at end of file +ID (sidekick-base.Sidekick_base.ID)

Module Sidekick_base.ID

Unique Identifiers

We use generative identifiers everywhere in Sidekick_base. Unlike strings, there are no risk of collision: during parsing, a new declaration or definition should create a fresh ID.t and associate it with the string name, and later references should look into some hashtable or map to get the ID corresponding to a string.

This allows us to handle definition shadowing or binder shadowing easily.

type t

The opaque type of unique identifiers

val make : string -> t

make s creates a new identifier with name s and some internal information. It is different than any other identifier created before or after, even with the same name.

val makef : ('a, Stdlib.Format.formatter, unit, t) Stdlib.format4 -> 'a

makef "foo %d bar %b" 42 true is like make (Format.asprintf "foo %d bar %b" 42 true).

val copy : t -> t

Fresh copy of the identifier, distinct from it, but with the same name.

val id : t -> int

Unique integer counter for this identifier.

val to_string : t -> string

Print identifier.

val to_string_full : t -> string

Printer name and unique counter for this ID.

include Sidekick_util.Intf.EQ with type t := t
val equal : t -> t -> bool
include Sidekick_util.Intf.ORD with type t := t
val compare : t -> t -> int
include Sidekick_util.Intf.HASH with type t := t
val hash : t -> int
include Sidekick_util.Intf.PRINT with type t := t
val pp : t CCFormat.printer
val pp_name : t CCFormat.printer
module Map : CCMap.S with type key = t
module Set : CCSet.S with type elt = t
module Tbl : CCHashtbl.S with type key = t
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Lit/index.html b/dev/sidekick-base/Sidekick_base/Lit/index.html index ebfb5c4b..97c1f8ce 100644 --- a/dev/sidekick-base/Sidekick_base/Lit/index.html +++ b/dev/sidekick-base/Sidekick_base/Lit/index.html @@ -1,2 +1,2 @@ -Lit (sidekick-base.Sidekick_base.Lit)

Module Sidekick_base.Lit

include Sidekick_core.LIT with module T = Solver_arg
module T = Solver_arg

Literals depend on terms

type t

A literal

val term : t -> T.Term.t

Get the (positive) term

val sign : t -> bool

Get the sign. A negated literal has sign false.

val neg : t -> t

Take negation of literal. sign (neg lit) = not (sign lit).

val abs : t -> t

abs lit is like lit but always positive, i.e. sign (abs lit) = true

val signed_term : t -> T.Term.t * bool

Return the atom and the sign

val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t

atom store t makes a literal out of a term, possibly normalizing its sign in the process.

  • parameter sign

    if provided, and sign=false, negate the resulting lit.

val norm_sign : t -> t * bool

norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.

val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
\ No newline at end of file +Lit (sidekick-base.Sidekick_base.Lit)

Module Sidekick_base.Lit

include Sidekick_core.LIT with module T = Solver_arg
module T = Solver_arg

Literals depend on terms

type t

A literal

val term : t -> T.Term.t

Get the (positive) term

val sign : t -> bool

Get the sign. A negated literal has sign false.

val neg : t -> t

Take negation of literal. sign (neg lit) = not (sign lit).

val abs : t -> t

abs lit is like lit but always positive, i.e. sign (abs lit) = true

val signed_term : t -> T.Term.t * bool

Return the atom and the sign

val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t

atom store t makes a literal out of a term, possibly normalizing its sign in the process.

  • parameter sign

    if provided, and sign=false, negate the resulting lit.

val norm_sign : t -> t * bool

norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.

val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Model/Fun_interpretation/index.html b/dev/sidekick-base/Sidekick_base/Model/Fun_interpretation/index.html index e08bfefd..ed56efff 100644 --- a/dev/sidekick-base/Sidekick_base/Model/Fun_interpretation/index.html +++ b/dev/sidekick-base/Sidekick_base/Model/Fun_interpretation/index.html @@ -1,2 +1,2 @@ -Fun_interpretation (sidekick-base.Sidekick_base.Model.Fun_interpretation)

Module Model.Fun_interpretation

Model for function symbols.

Function models are a finite map from argument tuples to values, accompanied with a default value that every other argument tuples map to. In other words, it's of the form:

lambda x y. if (x=vx1,y=vy1) then v1 else if … then … else vdefault

type t = {
cases : Base_types.Value.t Val_map.t;
default : Base_types.Value.t;
}
val default : t -> Base_types.Value.t
val cases_list : t -> (Base_types.Value.t list * Base_types.Value.t) list
val make : default:Base_types.Value.t -> (Base_types.Value.t list * Base_types.Value.t) list -> t
\ No newline at end of file +Fun_interpretation (sidekick-base.Sidekick_base.Model.Fun_interpretation)

Module Model.Fun_interpretation

Model for function symbols.

Function models are a finite map from argument tuples to values, accompanied with a default value that every other argument tuples map to. In other words, it's of the form:

lambda x y. if (x=vx1,y=vy1) then v1 else if … then … else vdefault

type t = {
cases : Base_types.Value.t Val_map.t;
default : Base_types.Value.t;
}
val default : t -> Base_types.Value.t
val cases_list : t -> (Base_types.Value.t list * Base_types.Value.t) list
val make : default:Base_types.Value.t -> (Base_types.Value.t list * Base_types.Value.t) list -> t
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Model/Val_map/index.html b/dev/sidekick-base/Sidekick_base/Model/Val_map/index.html index 4f961904..abd9fe0c 100644 --- a/dev/sidekick-base/Sidekick_base/Model/Val_map/index.html +++ b/dev/sidekick-base/Sidekick_base/Model/Val_map/index.html @@ -1,2 +1,2 @@ -Val_map (sidekick-base.Sidekick_base.Model.Val_map)

Module Model.Val_map

type key = Base_types.Value.t list
type 'a t
val empty : 'a t
val is_empty : _ t -> bool
val cardinal : _ t -> int
val find : key -> 'a t -> 'a option
val add : key -> 'a -> 'a t -> 'a t
\ No newline at end of file +Val_map (sidekick-base.Sidekick_base.Model.Val_map)

Module Model.Val_map

type key = Base_types.Value.t list
type 'a t
val empty : 'a t
val is_empty : _ t -> bool
val cardinal : _ t -> int
val find : key -> 'a t -> 'a option
val add : key -> 'a -> 'a t -> 'a t
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Model/index.html b/dev/sidekick-base/Sidekick_base/Model/index.html index 472eccbd..76f605f3 100644 --- a/dev/sidekick-base/Sidekick_base/Model/index.html +++ b/dev/sidekick-base/Sidekick_base/Model/index.html @@ -1,2 +1,2 @@ -Model (sidekick-base.Sidekick_base.Model)

Module Sidekick_base.Model

Models

A model is a solution to the satisfiability question, created by the SMT solver when it proves the formula to be satisfiable.

A model gives a value to each term of the original formula(s), in such a way that the formula(s) is true when the term is replaced by its value.

module Val_map : sig ... end
module Fun_interpretation : sig ... end

Model for function symbols.

type t = {
values : Base_types.Value.t Sidekick_base__.Base_types.Term.Map.t;
funs : Fun_interpretation.t Sidekick_base__.Base_types.Fun.Map.t;
}

Model

val empty : t

Empty model

val mem : Base_types.Term.t -> t -> bool
val find : Base_types.Term.t -> t -> Base_types.Value.t option
val merge : t -> t -> t
val pp : t CCFormat.printer
val eval : t -> Base_types.Term.t -> Base_types.Value.t option

eval m t tries to evaluate term t in the model. If it succeeds, the value is returned, otherwise None is.

\ No newline at end of file +Model (sidekick-base.Sidekick_base.Model)

Module Sidekick_base.Model

Models

A model is a solution to the satisfiability question, created by the SMT solver when it proves the formula to be satisfiable.

A model gives a value to each term of the original formula(s), in such a way that the formula(s) is true when the term is replaced by its value.

module Val_map : sig ... end
module Fun_interpretation : sig ... end

Model for function symbols.

type t = {
values : Base_types.Value.t Sidekick_base__.Base_types.Term.Map.t;
funs : Fun_interpretation.t Sidekick_base__.Base_types.Fun.Map.t;
}

Model

val empty : t

Empty model

val mem : Base_types.Term.t -> t -> bool
val find : Base_types.Term.t -> t -> Base_types.Value.t option
val merge : t -> t -> t
val pp : t CCFormat.printer
val eval : t -> Base_types.Term.t -> Base_types.Value.t option

eval m t tries to evaluate term t in the model. If it succeeds, the value is returned, otherwise None is.

\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Proof/Config/index.html b/dev/sidekick-base/Sidekick_base/Proof/Config/index.html index 7139720e..8d3e8333 100644 --- a/dev/sidekick-base/Sidekick_base/Proof/Config/index.html +++ b/dev/sidekick-base/Sidekick_base/Proof/Config/index.html @@ -1,2 +1,2 @@ -Config (sidekick-base.Sidekick_base.Proof.Config)

Module Proof.Config

Configuration of proofs

type t
val pp : t Sidekick_base__.Base_types.Fmt.printer
val default : t

Default proof config, enabled

val empty : t

Disabled proof, without storage

val enable : bool -> t -> t

Enable/disable proof storage

val store_in_memory : t -> t

Store proof in memory

val store_on_disk_at : string -> t -> t

store_on_disk_at file stores temporary proof in file file

val no_store : t -> t
\ No newline at end of file +Config (sidekick-base.Sidekick_base.Proof.Config)

Module Proof.Config

Configuration of proofs

type t
val pp : t Sidekick_base__.Base_types.Fmt.printer
val default : t

Default proof config, enabled

val empty : t

Disabled proof, without storage

val enable : bool -> t -> t

Enable/disable proof storage

val store_in_memory : t -> t

Store proof in memory

val store_on_disk_at : string -> t -> t

store_on_disk_at file stores temporary proof in file file

val no_store : t -> t
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Proof/Step_vec/index.html b/dev/sidekick-base/Sidekick_base/Proof/Step_vec/index.html index a4280a6a..22e4067c 100644 --- a/dev/sidekick-base/Sidekick_base/Proof/Step_vec/index.html +++ b/dev/sidekick-base/Sidekick_base/Proof/Step_vec/index.html @@ -1,2 +1,2 @@ -Step_vec (sidekick-base.Sidekick_base.Proof.Step_vec)

Module Proof.Step_vec

A vector of steps

include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit

Remove element at index i without preserving order (swap with last element)

val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer
\ No newline at end of file +Step_vec (sidekick-base.Sidekick_base.Proof.Step_vec)

Module Proof.Step_vec

A vector of steps

include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit

Remove element at index i without preserving order (swap with last element)

val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Proof/Unsafe_/index.html b/dev/sidekick-base/Sidekick_base/Proof/Unsafe_/index.html index 4bdad0e5..da4e0901 100644 --- a/dev/sidekick-base/Sidekick_base/Proof/Unsafe_/index.html +++ b/dev/sidekick-base/Sidekick_base/Proof/Unsafe_/index.html @@ -1,2 +1,2 @@ -Unsafe_ (sidekick-base.Sidekick_base.Proof.Unsafe_)

Module Proof.Unsafe_

val id_of_proof_step_ : proof_step -> Base_types.Proof_ser.ID.t
\ No newline at end of file +Unsafe_ (sidekick-base.Sidekick_base.Proof.Unsafe_)

Module Proof.Unsafe_

val id_of_proof_step_ : proof_step -> Base_types.Proof_ser.ID.t
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Proof/index.html b/dev/sidekick-base/Sidekick_base/Proof/index.html index b7ea3ef7..87c873a9 100644 --- a/dev/sidekick-base/Sidekick_base/Proof/index.html +++ b/dev/sidekick-base/Sidekick_base/Proof/index.html @@ -1,2 +1,2 @@ -Proof (sidekick-base.Sidekick_base.Proof)

Module Sidekick_base.Proof

Proof representation

module Config : sig ... end

Configuration of proofs

Main Proof API

type t

A container for the whole proof

type proof_step

A proof step in the trace.

The proof will store all steps, and at the end when we find the empty clause we can filter them to keep only the relevant ones.

include Sidekick_core.PROOF with type t := t and type proof_step := proof_step and type lit = Lit.t and type term = Base_types.Term.t
type term = Base_types.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step

lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule

A vector of steps

val enabled : t -> bool

Returns true if proof production is enabled

val emit_input_clause : lit Iter.t -> proof_rule

Emit an input clause.

val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule

Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.

val emit_unsat_core : lit Iter.t -> proof_rule

Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?

val emit_unsat : proof_step -> t -> unit

Signal "unsat" result at the given proof

val del_clause : proof_step -> lit Iter.t -> t -> unit

Forget a clause. Only useful for performance considerations.

val define_term : term -> term -> proof_rule

define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u

val proof_p1 : proof_step -> proof_step -> proof_rule

proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.

val with_defs : proof_step -> proof_step Iter.t -> proof_rule

with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.

val lemma_true : term -> proof_rule

lemma_true (true) p asserts the clause (true)

val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule

lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.

The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.

From now on, t and u will be used interchangeably.

  • returns

    a proof_rule ID for the clause (t=u).

val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule

lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

val lemma_lra : Lit.t Iter.t -> proof_rule
include Sidekick_th_data.PROOF with type proof := t and type proof_step := proof_step and type lit := Lit.t and type term := Base_types.Term.t
val lemma_isa_cstor : cstor_t:Base_types.Term.t -> Base_types.Term.t -> t -> proof_step

lemma_isa_cstor (d …) (is-c t) returns the clause (c …) = t |- is-c t or (d …) = t |- ¬ (is-c t)

val lemma_select_cstor : cstor_t:Base_types.Term.t -> Base_types.Term.t -> t -> proof_step

lemma_select_cstor (c t1…tn) (sel-c-i t) returns a proof of t = c t1…tn |- (sel-c-i t) = ti

val lemma_isa_split : Base_types.Term.t -> Lit.t Iter.t -> t -> proof_step

lemma_isa_split t lits is the proof of is-c1 t \/ is-c2 t \/ … \/ is-c_n t

val lemma_isa_sel : Base_types.Term.t -> t -> proof_step

lemma_isa_sel (is-c t) is the proof of is-c t |- t = c (sel-c-1 t)…(sel-c-n t)

val lemma_isa_disj : Lit.t -> Lit.t -> t -> proof_step

lemma_isa_disj (is-c t) (is-d t) is the proof of ¬ (is-c t) \/ ¬ (is-c t)

val lemma_cstor_inj : Base_types.Term.t -> Base_types.Term.t -> int -> t -> proof_step

lemma_cstor_inj (c t1…tn) (c u1…un) i is the proof of c t1…tn = c u1…un |- ti = ui

val lemma_cstor_distinct : Base_types.Term.t -> Base_types.Term.t -> t -> proof_step

lemma_isa_distinct (c …) (d …) is the proof of the unit clause |- (c …) ≠ (d …)

val lemma_acyclicity : (Base_types.Term.t * Base_types.Term.t) Iter.t -> t -> proof_step

lemma_acyclicity pairs is a proof of t1=u1, …, tn=un |- false by acyclicity.

include Sidekick_th_bool_static.PROOF with type proof := t and type proof_step := proof_step and type lit := Lit.t and type term := Base_types.Term.t
val lemma_bool_tauto : Lit.t Iter.t -> t -> proof_step

Boolean tautology lemma (clause)

val lemma_bool_c : string -> Base_types.Term.t list -> t -> proof_step

Basic boolean logic lemma for a clause |- c. proof_bool_c b name cs is the rule designated by name.

val lemma_bool_equiv : Base_types.Term.t -> Base_types.Term.t -> t -> proof_step

Boolean tautology lemma (equivalence)

val lemma_ite_true : ite:Base_types.Term.t -> t -> proof_step

lemma a ==> ite a b c = b

val lemma_ite_false : ite:Base_types.Term.t -> t -> proof_step

lemma ¬a ==> ite a b c = c

Creation

val create : ?config:Config.t -> unit -> t

Create new proof.

  • parameter config

    modifies the proof behavior

val empty : t

Empty proof, stores nothing

val disable : t -> unit

Disable proof, even if the config would enable it

Use the proof

val iter_steps_backward : t -> Base_types.Proof_ser.Step.t Iter.t

Iterates on all the steps of the proof, from the end.

This will yield nothing if the proof was disabled or used a dummy backend.

module Unsafe_ : sig ... end
\ No newline at end of file +Proof (sidekick-base.Sidekick_base.Proof)

Module Sidekick_base.Proof

Proof representation

module Config : sig ... end

Configuration of proofs

Main Proof API

type t

A container for the whole proof

type proof_step

A proof step in the trace.

The proof will store all steps, and at the end when we find the empty clause we can filter them to keep only the relevant ones.

include Sidekick_core.PROOF with type t := t and type proof_step := proof_step and type lit = Lit.t and type term = Base_types.Term.t
type term = Base_types.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step

lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule

A vector of steps

val enabled : t -> bool

Returns true if proof production is enabled

val emit_input_clause : lit Iter.t -> proof_rule

Emit an input clause.

val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule

Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.

val emit_unsat_core : lit Iter.t -> proof_rule

Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?

val emit_unsat : proof_step -> t -> unit

Signal "unsat" result at the given proof

val del_clause : proof_step -> lit Iter.t -> t -> unit

Forget a clause. Only useful for performance considerations.

val define_term : term -> term -> proof_rule

define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u

val proof_p1 : proof_step -> proof_step -> proof_rule

proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.

val with_defs : proof_step -> proof_step Iter.t -> proof_rule

with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.

val lemma_true : term -> proof_rule

lemma_true (true) p asserts the clause (true)

val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule

lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.

The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.

From now on, t and u will be used interchangeably.

  • returns

    a proof_rule ID for the clause (t=u).

val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule

lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

val lemma_lra : Lit.t Iter.t -> proof_rule
include Sidekick_th_data.PROOF with type proof := t and type proof_step := proof_step and type lit := Lit.t and type term := Base_types.Term.t
val lemma_isa_cstor : cstor_t:Base_types.Term.t -> Base_types.Term.t -> t -> proof_step

lemma_isa_cstor (d …) (is-c t) returns the clause (c …) = t |- is-c t or (d …) = t |- ¬ (is-c t)

val lemma_select_cstor : cstor_t:Base_types.Term.t -> Base_types.Term.t -> t -> proof_step

lemma_select_cstor (c t1…tn) (sel-c-i t) returns a proof of t = c t1…tn |- (sel-c-i t) = ti

val lemma_isa_split : Base_types.Term.t -> Lit.t Iter.t -> t -> proof_step

lemma_isa_split t lits is the proof of is-c1 t \/ is-c2 t \/ … \/ is-c_n t

val lemma_isa_sel : Base_types.Term.t -> t -> proof_step

lemma_isa_sel (is-c t) is the proof of is-c t |- t = c (sel-c-1 t)…(sel-c-n t)

val lemma_isa_disj : Lit.t -> Lit.t -> t -> proof_step

lemma_isa_disj (is-c t) (is-d t) is the proof of ¬ (is-c t) \/ ¬ (is-c t)

val lemma_cstor_inj : Base_types.Term.t -> Base_types.Term.t -> int -> t -> proof_step

lemma_cstor_inj (c t1…tn) (c u1…un) i is the proof of c t1…tn = c u1…un |- ti = ui

val lemma_cstor_distinct : Base_types.Term.t -> Base_types.Term.t -> t -> proof_step

lemma_isa_distinct (c …) (d …) is the proof of the unit clause |- (c …) ≠ (d …)

val lemma_acyclicity : (Base_types.Term.t * Base_types.Term.t) Iter.t -> t -> proof_step

lemma_acyclicity pairs is a proof of t1=u1, …, tn=un |- false by acyclicity.

include Sidekick_th_bool_static.PROOF with type proof := t and type proof_step := proof_step and type lit := Lit.t and type term := Base_types.Term.t
val lemma_bool_tauto : Lit.t Iter.t -> t -> proof_step

Boolean tautology lemma (clause)

val lemma_bool_c : string -> Base_types.Term.t list -> t -> proof_step

Basic boolean logic lemma for a clause |- c. proof_bool_c b name cs is the rule designated by name.

val lemma_bool_equiv : Base_types.Term.t -> Base_types.Term.t -> t -> proof_step

Boolean tautology lemma (equivalence)

val lemma_ite_true : ite:Base_types.Term.t -> t -> proof_step

lemma a ==> ite a b c = b

val lemma_ite_false : ite:Base_types.Term.t -> t -> proof_step

lemma ¬a ==> ite a b c = c

Creation

val create : ?config:Config.t -> unit -> t

Create new proof.

  • parameter config

    modifies the proof behavior

val empty : t

Empty proof, stores nothing

val disable : t -> unit

Disable proof, even if the config would enable it

Use the proof

val iter_steps_backward : t -> Base_types.Proof_ser.Step.t Iter.t

Iterates on all the steps of the proof, from the end.

This will yield nothing if the proof was disabled or used a dummy backend.

module Unsafe_ : sig ... end
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Proof_dummy/Step_vec/index.html b/dev/sidekick-base/Sidekick_base/Proof_dummy/Step_vec/index.html index 9498be59..8b6bc6fc 100644 --- a/dev/sidekick-base/Sidekick_base/Proof_dummy/Step_vec/index.html +++ b/dev/sidekick-base/Sidekick_base/Proof_dummy/Step_vec/index.html @@ -1,2 +1,2 @@ -Step_vec (sidekick-base.Sidekick_base.Proof_dummy.Step_vec)

Module Proof_dummy.Step_vec

A vector of steps

include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit

Remove element at index i without preserving order (swap with last element)

val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer
\ No newline at end of file +Step_vec (sidekick-base.Sidekick_base.Proof_dummy.Step_vec)

Module Proof_dummy.Step_vec

A vector of steps

include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit

Remove element at index i without preserving order (swap with last element)

val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Proof_dummy/index.html b/dev/sidekick-base/Sidekick_base/Proof_dummy/index.html index f4acdbee..f89ef843 100644 --- a/dev/sidekick-base/Sidekick_base/Proof_dummy/index.html +++ b/dev/sidekick-base/Sidekick_base/Proof_dummy/index.html @@ -1,3 +1,3 @@ -Proof_dummy (sidekick-base.Sidekick_base.Proof_dummy)

Module Sidekick_base.Proof_dummy

Dummy proof module that does nothing.

include Sidekick_core.PROOF with type t = private unit and type proof_step = private unit and type +Proof_dummy (sidekick-base.Sidekick_base.Proof_dummy)

Module Sidekick_base.Proof_dummy

Dummy proof module that does nothing.

include Sidekick_core.PROOF with type t = private unit and type proof_step = private unit and type lit = Lit.t and type term = Base_types.Term.t
type t = private unit

The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)

type proof_step = private unit

Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)

type term = Base_types.Term.t
type lit = Lit.t
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step

lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := t -> proof_step

A vector of steps

val enabled : t -> bool

Returns true if proof production is enabled

val emit_input_clause : lit Iter.t -> t -> proof_step

Emit an input clause.

val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> t -> proof_step

Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.

val emit_unsat_core : lit Iter.t -> t -> proof_step

Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?

val emit_unsat : proof_step -> t -> unit

Signal "unsat" result at the given proof

val del_clause : proof_step -> lit Iter.t -> t -> unit

Forget a clause. Only useful for performance considerations.

val define_term : term -> term -> t -> proof_step

define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u

val proof_p1 : proof_step -> proof_step -> t -> proof_step

proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.

val with_defs : proof_step -> proof_step Iter.t -> t -> proof_step

with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.

val lemma_true : term -> t -> proof_step

lemma_true (true) p asserts the clause (true)

val lemma_preprocess : term -> term -> using:proof_step Iter.t -> t -> proof_step

lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.

The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.

From now on, t and u will be used interchangeably.

  • returns

    a proof_rule ID for the clause (t=u).

val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> t -> proof_step

lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

type proof_rule = t -> proof_step
val create : unit -> t
val lemma_lra : Lit.t Iter.t -> proof_rule
include Sidekick_th_data.PROOF with type proof := t and type proof_step := proof_step and type lit := Lit.t and type term := Base_types.Term.t
val lemma_isa_cstor : cstor_t:Base_types.Term.t -> Base_types.Term.t -> t -> proof_step

lemma_isa_cstor (d …) (is-c t) returns the clause (c …) = t |- is-c t or (d …) = t |- ¬ (is-c t)

val lemma_select_cstor : cstor_t:Base_types.Term.t -> Base_types.Term.t -> t -> proof_step

lemma_select_cstor (c t1…tn) (sel-c-i t) returns a proof of t = c t1…tn |- (sel-c-i t) = ti

val lemma_isa_split : Base_types.Term.t -> Lit.t Iter.t -> t -> proof_step

lemma_isa_split t lits is the proof of is-c1 t \/ is-c2 t \/ … \/ is-c_n t

val lemma_isa_sel : Base_types.Term.t -> t -> proof_step

lemma_isa_sel (is-c t) is the proof of is-c t |- t = c (sel-c-1 t)…(sel-c-n t)

val lemma_isa_disj : Lit.t -> Lit.t -> t -> proof_step

lemma_isa_disj (is-c t) (is-d t) is the proof of ¬ (is-c t) \/ ¬ (is-c t)

val lemma_cstor_inj : Base_types.Term.t -> Base_types.Term.t -> int -> t -> proof_step

lemma_cstor_inj (c t1…tn) (c u1…un) i is the proof of c t1…tn = c u1…un |- ti = ui

val lemma_cstor_distinct : Base_types.Term.t -> Base_types.Term.t -> t -> proof_step

lemma_isa_distinct (c …) (d …) is the proof of the unit clause |- (c …) ≠ (d …)

val lemma_acyclicity : (Base_types.Term.t * Base_types.Term.t) Iter.t -> t -> proof_step

lemma_acyclicity pairs is a proof of t1=u1, …, tn=un |- false by acyclicity.

include Sidekick_th_bool_static.PROOF with type proof := t and type proof_step := proof_step and type lit := Lit.t and type term := Base_types.Term.t
val lemma_bool_tauto : Lit.t Iter.t -> t -> proof_step

Boolean tautology lemma (clause)

val lemma_bool_c : string -> Base_types.Term.t list -> t -> proof_step

Basic boolean logic lemma for a clause |- c. proof_bool_c b name cs is the rule designated by name.

val lemma_bool_equiv : Base_types.Term.t -> Base_types.Term.t -> t -> proof_step

Boolean tautology lemma (equivalence)

val lemma_ite_true : ite:Base_types.Term.t -> t -> proof_step

lemma a ==> ite a b c = b

val lemma_ite_false : ite:Base_types.Term.t -> t -> proof_step

lemma ¬a ==> ite a b c = c

\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Proof_quip/index.html b/dev/sidekick-base/Sidekick_base/Proof_quip/index.html index ecbf6c8d..f76655f6 100644 --- a/dev/sidekick-base/Sidekick_base/Proof_quip/index.html +++ b/dev/sidekick-base/Sidekick_base/Proof_quip/index.html @@ -1,2 +1,2 @@ -Proof_quip (sidekick-base.Sidekick_base.Proof_quip)

Module Sidekick_base.Proof_quip

Export to Quip from Proof.

We use Sidekick_quip but do not export anything from it.

type t
val of_proof : Proof.t -> unsat:Proof.proof_step -> t
type out_format = Sidekick_quip.out_format =
| Sexp
| CSexp
val output : ?fmt:out_format -> Stdlib.out_channel -> t -> unit
\ No newline at end of file +Proof_quip (sidekick-base.Sidekick_base.Proof_quip)

Module Sidekick_base.Proof_quip

Export to Quip from Proof.

We use Sidekick_quip but do not export anything from it.

type t
val of_proof : Proof.t -> unsat:Proof.proof_step -> t
type out_format = Sidekick_quip.out_format =
| Sexp
| CSexp
val output : ?fmt:out_format -> Stdlib.out_channel -> t -> unit
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Solver_arg/Fun/index.html b/dev/sidekick-base/Sidekick_base/Solver_arg/Fun/index.html index d123eb69..1231a272 100644 --- a/dev/sidekick-base/Sidekick_base/Solver_arg/Fun/index.html +++ b/dev/sidekick-base/Sidekick_base/Solver_arg/Fun/index.html @@ -1,2 +1,2 @@ -Fun (sidekick-base.Sidekick_base.Solver_arg.Fun)

Module Solver_arg.Fun

A function symbol, like "f" or "plus" or "is_human" or "socrates"

val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
\ No newline at end of file +Fun (sidekick-base.Sidekick_base.Solver_arg.Fun)

Module Solver_arg.Fun

A function symbol, like "f" or "plus" or "is_human" or "socrates"

val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
\ No newline at end of file diff --git a/dev/sidekick-base/Sidekick_base/Solver_arg/Term/index.html b/dev/sidekick-base/Sidekick_base/Solver_arg/Term/index.html index 902aff9c..9810416b 100644 --- a/dev/sidekick-base/Sidekick_base/Solver_arg/Term/index.html +++ b/dev/sidekick-base/Sidekick_base/Solver_arg/Term/index.html @@ -1,5 +1,5 @@ -Term (sidekick-base.Sidekick_base.Solver_arg.Term)

Module Solver_arg.Term

Term structure.

Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.

val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.

val ty : t -> Ty.t
val bool : store -> bool -> t

build true/false

val as_bool : t -> bool option

as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.

val abs : store -> t -> t * bool

abs t returns an "absolute value" for the term, along with the sign of t.

The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).

The store is passed in case a new term needs to be created.

val map_shallow : store -> (t -> t) -> t -> t

Map function on immediate subterms. This should not be recursive.

val iter_dag : t -> (t -> unit) -> unit

iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.

For example, in:

let x = 2 in
+Term (sidekick-base.Sidekick_base.Solver_arg.Term)
Module Solver_arg.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick-base/Sidekick_base/Solver_arg/Ty/index.html b/dev/sidekick-base/Sidekick_base/Solver_arg/Ty/index.html
index 99940560..d2d99f21 100644
--- a/dev/sidekick-base/Sidekick_base/Solver_arg/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base/Solver_arg/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base.Solver_arg.Ty)
Module Solver_arg.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = Base_types.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base.Solver_arg.Ty)
Module Solver_arg.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = Base_types.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base/Solver_arg/index.html b/dev/sidekick-base/Sidekick_base/Solver_arg/index.html
index 8641e45e..72bdb1aa 100644
--- a/dev/sidekick-base/Sidekick_base/Solver_arg/index.html
+++ b/dev/sidekick-base/Sidekick_base/Solver_arg/index.html
@@ -1,2 +1,2 @@
 
-Solver_arg (sidekick-base.Sidekick_base.Solver_arg)
Module Sidekick_base.Solver_arg
Concrete implementation of Sidekick_core.TERM
this module gathers most definitions above in a form that is compatible with what Sidekick expects for terms, functions, etc.
include Sidekick_core.TERM with type Term.t = Base_types.Term.t and type Fun.t = Base_types.Fun.t and type Ty.t = Base_types.Ty.t and type Term.store = Base_types.Term.store and type Ty.store = Base_types.Ty.store
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+Solver_arg (sidekick-base.Sidekick_base.Solver_arg)
Module Sidekick_base.Solver_arg
Concrete implementation of Sidekick_core.TERM
this module gathers most definitions above in a form that is compatible with what Sidekick expects for terms, functions, etc.
include Sidekick_core.TERM with type Term.t = Base_types.Term.t and type Fun.t = Base_types.Fun.t and type Ty.t = Base_types.Ty.t and type Term.store = Base_types.Term.store and type Ty.store = Base_types.Ty.store
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base/index.html b/dev/sidekick-base/Sidekick_base/index.html
index 6f4d36d9..39d6f8c2 100644
--- a/dev/sidekick-base/Sidekick_base/index.html
+++ b/dev/sidekick-base/Sidekick_base/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_base (sidekick-base.Sidekick_base)
Module Sidekick_base
Sidekick base
This library is a starting point for writing concrete implementations of SMT solvers with Sidekick.
It provides a representation of terms, boolean formulas, linear arithmetic expressions, datatypes for the functors in Sidekick.
In addition, it has a notion of Statement. Statements are instructions for the SMT solver to do something, such as: define a new constant, declare a new constant, assert a formula as being true, set an option, check satisfiability of the set of statements added so far, etc. Logic formats such as SMT-LIB 2.6 are in fact based on a similar notion of statements, and a .smt2 files contains a list of statements.
module Base_types : sig ... end
Basic type definitions for Sidekick_base
module ID : sig ... end
Unique Identifiers
module Fun = Base_types.Fun
module Stat = Sidekick_util.Stat
module Model : sig ... end
Models
module Term = Base_types.Term
module Value = Base_types.Value
module Term_cell = Base_types.Term_cell
module Ty = Base_types.Ty
module Statement = Base_types.Statement
module Data = Base_types.Data
module Select = Base_types.Select
module Form : sig ... end
Formulas (boolean terms).
module Solver_arg : sig ... end
Concrete implementation of Sidekick_core.TERM
module Lit : sig ... end
module Proof_dummy : sig ... end
Dummy proof module that does nothing.
module Proof : sig ... end
Proof representation
module Proof_quip : sig ... end
Export to Quip from Proof.
module IArray = Sidekick_util.IArray

\ No newline at end of file
+Sidekick_base (sidekick-base.Sidekick_base)
Module Sidekick_base
Sidekick base
This library is a starting point for writing concrete implementations of SMT solvers with Sidekick.
It provides a representation of terms, boolean formulas, linear arithmetic expressions, datatypes for the functors in Sidekick.
In addition, it has a notion of Statement. Statements are instructions for the SMT solver to do something, such as: define a new constant, declare a new constant, assert a formula as being true, set an option, check satisfiability of the set of statements added so far, etc. Logic formats such as SMT-LIB 2.6 are in fact based on a similar notion of statements, and a .smt2 files contains a list of statements.
module Base_types : sig ... end
Basic type definitions for Sidekick_base
module ID : sig ... end
Unique Identifiers
module Fun = Base_types.Fun
module Stat = Sidekick_util.Stat
module Model : sig ... end
Models
module Term = Base_types.Term
module Value = Base_types.Value
module Term_cell = Base_types.Term_cell
module Ty = Base_types.Ty
module Statement = Base_types.Statement
module Data = Base_types.Data
module Select = Base_types.Select
module Form : sig ... end
Formulas (boolean terms).
module Solver_arg : sig ... end
Concrete implementation of Sidekick_core.TERM
module Lit : sig ... end
module Proof_dummy : sig ... end
Dummy proof module that does nothing.
module Proof : sig ... end
Proof representation
module Proof_quip : sig ... end
Export to Quip from Proof.
module IArray = Sidekick_util.IArray

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base__/index.html b/dev/sidekick-base/Sidekick_base__/index.html
index cfd73637..39259875 100644
--- a/dev/sidekick-base/Sidekick_base__/index.html
+++ b/dev/sidekick-base/Sidekick_base__/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_base__ (sidekick-base.Sidekick_base__)
Module Sidekick_base__

\ No newline at end of file
+Sidekick_base__ (sidekick-base.Sidekick_base__)
Module Sidekick_base__

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base__Base_types/index.html b/dev/sidekick-base/Sidekick_base__Base_types/index.html
index db469442..64c2357a 100644
--- a/dev/sidekick-base/Sidekick_base__Base_types/index.html
+++ b/dev/sidekick-base/Sidekick_base__Base_types/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_base__Base_types (sidekick-base.Sidekick_base__Base_types)
Module Sidekick_base__Base_types

\ No newline at end of file
+Sidekick_base__Base_types (sidekick-base.Sidekick_base__Base_types)
Module Sidekick_base__Base_types

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base__CCHet/index.html b/dev/sidekick-base/Sidekick_base__CCHet/index.html
index 9730143b..c834ebdc 100644
--- a/dev/sidekick-base/Sidekick_base__CCHet/index.html
+++ b/dev/sidekick-base/Sidekick_base__CCHet/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_base__CCHet (sidekick-base.Sidekick_base__CCHet)
Module Sidekick_base__CCHet

\ No newline at end of file
+Sidekick_base__CCHet (sidekick-base.Sidekick_base__CCHet)
Module Sidekick_base__CCHet

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base__Config/index.html b/dev/sidekick-base/Sidekick_base__Config/index.html
index d9a2744e..c83de69e 100644
--- a/dev/sidekick-base/Sidekick_base__Config/index.html
+++ b/dev/sidekick-base/Sidekick_base__Config/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_base__Config (sidekick-base.Sidekick_base__Config)
Module Sidekick_base__Config

\ No newline at end of file
+Sidekick_base__Config (sidekick-base.Sidekick_base__Config)
Module Sidekick_base__Config

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base__Form/index.html b/dev/sidekick-base/Sidekick_base__Form/index.html
index 9aea568b..338a446e 100644
--- a/dev/sidekick-base/Sidekick_base__Form/index.html
+++ b/dev/sidekick-base/Sidekick_base__Form/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_base__Form (sidekick-base.Sidekick_base__Form)
Module Sidekick_base__Form

\ No newline at end of file
+Sidekick_base__Form (sidekick-base.Sidekick_base__Form)
Module Sidekick_base__Form

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base__Hashcons/index.html b/dev/sidekick-base/Sidekick_base__Hashcons/index.html
index a400df86..074ddbd6 100644
--- a/dev/sidekick-base/Sidekick_base__Hashcons/index.html
+++ b/dev/sidekick-base/Sidekick_base__Hashcons/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_base__Hashcons (sidekick-base.Sidekick_base__Hashcons)
Module Sidekick_base__Hashcons

\ No newline at end of file
+Sidekick_base__Hashcons (sidekick-base.Sidekick_base__Hashcons)
Module Sidekick_base__Hashcons

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base__ID/index.html b/dev/sidekick-base/Sidekick_base__ID/index.html
index 3c9804f8..b4917176 100644
--- a/dev/sidekick-base/Sidekick_base__ID/index.html
+++ b/dev/sidekick-base/Sidekick_base__ID/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_base__ID (sidekick-base.Sidekick_base__ID)
Module Sidekick_base__ID

\ No newline at end of file
+Sidekick_base__ID (sidekick-base.Sidekick_base__ID)
Module Sidekick_base__ID

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base__Lit/index.html b/dev/sidekick-base/Sidekick_base__Lit/index.html
index e0591bfc..38f955bb 100644
--- a/dev/sidekick-base/Sidekick_base__Lit/index.html
+++ b/dev/sidekick-base/Sidekick_base__Lit/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_base__Lit (sidekick-base.Sidekick_base__Lit)
Module Sidekick_base__Lit

\ No newline at end of file
+Sidekick_base__Lit (sidekick-base.Sidekick_base__Lit)
Module Sidekick_base__Lit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base__Model/index.html b/dev/sidekick-base/Sidekick_base__Model/index.html
index 7184b1b6..cf1b8300 100644
--- a/dev/sidekick-base/Sidekick_base__Model/index.html
+++ b/dev/sidekick-base/Sidekick_base__Model/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_base__Model (sidekick-base.Sidekick_base__Model)
Module Sidekick_base__Model

\ No newline at end of file
+Sidekick_base__Model (sidekick-base.Sidekick_base__Model)
Module Sidekick_base__Model

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base__Proof/index.html b/dev/sidekick-base/Sidekick_base__Proof/index.html
index fedcc214..7bf4ecbf 100644
--- a/dev/sidekick-base/Sidekick_base__Proof/index.html
+++ b/dev/sidekick-base/Sidekick_base__Proof/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_base__Proof (sidekick-base.Sidekick_base__Proof)
Module Sidekick_base__Proof

\ No newline at end of file
+Sidekick_base__Proof (sidekick-base.Sidekick_base__Proof)
Module Sidekick_base__Proof

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base__Proof_dummy/index.html b/dev/sidekick-base/Sidekick_base__Proof_dummy/index.html
index 3a45d02e..25e9d3c6 100644
--- a/dev/sidekick-base/Sidekick_base__Proof_dummy/index.html
+++ b/dev/sidekick-base/Sidekick_base__Proof_dummy/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_base__Proof_dummy (sidekick-base.Sidekick_base__Proof_dummy)
Module Sidekick_base__Proof_dummy

\ No newline at end of file
+Sidekick_base__Proof_dummy (sidekick-base.Sidekick_base__Proof_dummy)
Module Sidekick_base__Proof_dummy

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base__Proof_quip/index.html b/dev/sidekick-base/Sidekick_base__Proof_quip/index.html
index 5aa2484b..d3ad076f 100644
--- a/dev/sidekick-base/Sidekick_base__Proof_quip/index.html
+++ b/dev/sidekick-base/Sidekick_base__Proof_quip/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_base__Proof_quip (sidekick-base.Sidekick_base__Proof_quip)
Module Sidekick_base__Proof_quip

\ No newline at end of file
+Sidekick_base__Proof_quip (sidekick-base.Sidekick_base__Proof_quip)
Module Sidekick_base__Proof_quip

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base__Solver_arg/index.html b/dev/sidekick-base/Sidekick_base__Solver_arg/index.html
index 1280f81e..0931c704 100644
--- a/dev/sidekick-base/Sidekick_base__Solver_arg/index.html
+++ b/dev/sidekick-base/Sidekick_base__Solver_arg/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_base__Solver_arg (sidekick-base.Sidekick_base__Solver_arg)
Module Sidekick_base__Solver_arg

\ No newline at end of file
+Sidekick_base__Solver_arg (sidekick-base.Sidekick_base__Solver_arg)
Module Sidekick_base__Solver_arg

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Bare/Decode/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Bare/Decode/index.html
index 31da5cd4..606d8fd4 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Bare/Decode/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Bare/Decode/index.html
@@ -1,2 +1,2 @@
 
-Decode (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Bare.Decode)
Module Bare.Decode
exception Error of string
type t = {
bs : bytes;
mutable off : int;
}
type 'a dec = t -> 'a
val fail_ : string -> 'a
val fail_eof_ : string -> 'a
val uint : t -> int64
val int : t -> int64
val u8 : t -> char
val i8 : t -> char
val u16 : t -> int
val i16 : t -> int
val u32 : t -> int32
val i32 : t -> int32
val u64 : t -> int64
val i64 : t -> int64
val bool : t -> bool
val f32 : t -> float
val f64 : t -> float
val data_of : size:int -> t -> bytes
val data : t -> bytes
val string : t -> string
val optional : (t -> 'a) -> t -> 'a option

\ No newline at end of file
+Decode (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Bare.Decode)
Module Bare.Decode
exception Error of string
type t = {
bs : bytes;
mutable off : int;
}
type 'a dec = t -> 'a
val fail_ : string -> 'a
val fail_eof_ : string -> 'a
val uint : t -> int64
val int : t -> int64
val u8 : t -> char
val i8 : t -> char
val u16 : t -> int
val i16 : t -> int
val u32 : t -> int32
val i32 : t -> int32
val u64 : t -> int64
val i64 : t -> int64
val bool : t -> bool
val f32 : t -> float
val f64 : t -> float
val data_of : size:int -> t -> bytes
val data : t -> bytes
val string : t -> string
val optional : (t -> 'a) -> t -> 'a option

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Bare/Encode/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Bare/Encode/index.html
index f14af8cb..a30f4c2f 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Bare/Encode/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Bare/Encode/index.html
@@ -1,2 +1,2 @@
 
-Encode (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Bare.Encode)
Module Bare.Encode
type t = Stdlib.Buffer.t
val of_buffer : t -> t
type 'a enc = t -> 'a -> unit
val unsafe_chr : int -> char
val uint : t -> int64 -> unit
val int : t -> int64 -> unit
val u8 : Stdlib.Buffer.t -> char -> unit
val i8 : Stdlib.Buffer.t -> char -> unit
val u16 : Stdlib.Buffer.t -> int -> unit
val i16 : Stdlib.Buffer.t -> int -> unit
val u32 : Stdlib.Buffer.t -> int32 -> unit
val i32 : Stdlib.Buffer.t -> int32 -> unit
val u64 : Stdlib.Buffer.t -> int64 -> unit
val i64 : Stdlib.Buffer.t -> int64 -> unit
val bool : Stdlib.Buffer.t -> bool -> unit
val f64 : t -> float -> unit
val data_of : size:int -> Stdlib.Buffer.t -> bytes -> unit
val data : t -> bytes -> unit
val string : t -> string -> unit
val optional : (Stdlib.Buffer.t -> 'a -> unit) -> Stdlib.Buffer.t -> 'a option -> unit

\ No newline at end of file
+Encode (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Bare.Encode)
Module Bare.Encode
type t = Stdlib.Buffer.t
val of_buffer : t -> t
type 'a enc = t -> 'a -> unit
val unsafe_chr : int -> char
val uint : t -> int64 -> unit
val int : t -> int64 -> unit
val u8 : Stdlib.Buffer.t -> char -> unit
val i8 : Stdlib.Buffer.t -> char -> unit
val u16 : Stdlib.Buffer.t -> int -> unit
val i16 : Stdlib.Buffer.t -> int -> unit
val u32 : Stdlib.Buffer.t -> int32 -> unit
val i32 : Stdlib.Buffer.t -> int32 -> unit
val u64 : Stdlib.Buffer.t -> int64 -> unit
val i64 : Stdlib.Buffer.t -> int64 -> unit
val bool : Stdlib.Buffer.t -> bool -> unit
val f64 : t -> float -> unit
val data_of : size:int -> Stdlib.Buffer.t -> bytes -> unit
val data : t -> bytes -> unit
val string : t -> string -> unit
val optional : (Stdlib.Buffer.t -> 'a -> unit) -> Stdlib.Buffer.t -> 'a option -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Bare/Pp/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Bare/Pp/index.html
index ce39d5fa..b4af184c 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Bare/Pp/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Bare/Pp/index.html
@@ -1,2 +1,2 @@
 
-Pp (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Bare.Pp)
Module Bare.Pp
type 'a t = Stdlib.Format.formatter -> 'a -> unit
type 'a iter = ('a -> unit) -> unit
val unit : Stdlib.Format.formatter -> unit -> unit
val int8 : Stdlib.Format.formatter -> char -> unit
val int : Stdlib.Format.formatter -> int -> unit
val int32 : Stdlib.Format.formatter -> int32 -> unit
val int64 : Stdlib.Format.formatter -> int64 -> unit
val float : Stdlib.Format.formatter -> float -> unit
val bool : Stdlib.Format.formatter -> bool -> unit
val string : Stdlib.Format.formatter -> string -> unit
val data : Stdlib.Format.formatter -> bytes -> unit
val option : (Stdlib.Format.formatter -> 'a -> unit) -> Stdlib.Format.formatter -> 'a option -> unit
val array : (Stdlib.Format.formatter -> 'a -> unit) -> Stdlib.Format.formatter -> 'a array -> unit
val iter : (Stdlib.Format.formatter -> 'a -> 'b) -> Stdlib.Format.formatter -> (('a -> 'b) -> unit) -> unit
val list : (Stdlib.Format.formatter -> 'a -> unit) -> Stdlib.Format.formatter -> 'a list -> unit

\ No newline at end of file
+Pp (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Bare.Pp)
Module Bare.Pp
type 'a t = Stdlib.Format.formatter -> 'a -> unit
type 'a iter = ('a -> unit) -> unit
val unit : Stdlib.Format.formatter -> unit -> unit
val int8 : Stdlib.Format.formatter -> char -> unit
val int : Stdlib.Format.formatter -> int -> unit
val int32 : Stdlib.Format.formatter -> int32 -> unit
val int64 : Stdlib.Format.formatter -> int64 -> unit
val float : Stdlib.Format.formatter -> float -> unit
val bool : Stdlib.Format.formatter -> bool -> unit
val string : Stdlib.Format.formatter -> string -> unit
val data : Stdlib.Format.formatter -> bytes -> unit
val option : (Stdlib.Format.formatter -> 'a -> unit) -> Stdlib.Format.formatter -> 'a option -> unit
val array : (Stdlib.Format.formatter -> 'a -> unit) -> Stdlib.Format.formatter -> 'a array -> unit
val iter : (Stdlib.Format.formatter -> 'a -> 'b) -> Stdlib.Format.formatter -> (('a -> 'b) -> unit) -> unit
val list : (Stdlib.Format.formatter -> 'a -> unit) -> Stdlib.Format.formatter -> 'a list -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Bare/String_map/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Bare/String_map/index.html
index 236c529d..124ac6ac 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Bare/String_map/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Bare/String_map/index.html
@@ -1,2 +1,2 @@
 
-String_map (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Bare.String_map)
Module Bare.String_map
type key = Stdlib.String.t
type !'a t = 'a Stdlib__map.Make(Stdlib.String).t
val empty : 'a t
val is_empty : 'a t -> bool
val mem : key -> 'a t -> bool
val add : key -> 'a -> 'a t -> 'a t
val update : key -> ('a option -> 'a option) -> 'a t -> 'a t
val singleton : key -> 'a -> 'a t
val remove : key -> 'a t -> 'a t
val merge : (key -> 'a option -> 'b option -> 'c option) -> 'a t -> 'b t -> 'c t
val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val cardinal : 'a t -> int
val bindings : 'a t -> (key * 'a) list
val min_binding : 'a t -> key * 'a
val min_binding_opt : 'a t -> (key * 'a) option
val max_binding : 'a t -> key * 'a
val max_binding_opt : 'a t -> (key * 'a) option
val choose : 'a t -> key * 'a
val choose_opt : 'a t -> (key * 'a) option
val split : key -> 'a t -> 'a t * 'a option * 'a t
val find : key -> 'a t -> 'a
val find_opt : key -> 'a t -> 'a option
val find_first : (key -> bool) -> 'a t -> key * 'a
val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option
val find_last : (key -> bool) -> 'a t -> key * 'a
val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t
val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

\ No newline at end of file
+String_map (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Bare.String_map)
Module Bare.String_map
type key = Stdlib.String.t
type !'a t = 'a Stdlib__map.Make(Stdlib.String).t
val empty : 'a t
val is_empty : 'a t -> bool
val mem : key -> 'a t -> bool
val add : key -> 'a -> 'a t -> 'a t
val update : key -> ('a option -> 'a option) -> 'a t -> 'a t
val singleton : key -> 'a -> 'a t
val remove : key -> 'a t -> 'a t
val merge : (key -> 'a option -> 'b option -> 'c option) -> 'a t -> 'b t -> 'c t
val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val cardinal : 'a t -> int
val bindings : 'a t -> (key * 'a) list
val min_binding : 'a t -> key * 'a
val min_binding_opt : 'a t -> (key * 'a) option
val max_binding : 'a t -> key * 'a
val max_binding_opt : 'a t -> (key * 'a) option
val choose : 'a t -> key * 'a
val choose_opt : 'a t -> (key * 'a) option
val split : key -> 'a t -> 'a t * 'a option * 'a t
val find : key -> 'a t -> 'a
val find_opt : key -> 'a t -> 'a option
val find_first : (key -> bool) -> 'a t -> key * 'a
val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option
val find_last : (key -> bool) -> 'a t -> key * 'a
val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t
val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Bare/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Bare/index.html
index 4061b7e1..43bc91b7 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Bare/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Bare/index.html
@@ -1,2 +1,2 @@
 
-Bare (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Bare)
Module Proof_ser.Bare
module String_map : sig ... end
val spf : ('a, unit, string) Stdlib.format -> 'a
module Decode : sig ... end
module Encode : sig ... end
module Pp : sig ... end
val to_string : 'a Encode.enc -> 'a -> string
val of_bytes_exn : ?off:int -> (Decode.t -> 'a) -> bytes -> 'a
val of_bytes : ?off:int -> (Decode.t -> 'a) -> bytes -> ('a, string) Stdlib.result
val of_string_exn : (Decode.t -> 'a) -> string -> 'a
val of_string : (Decode.t -> 'a) -> string -> ('a, string) Stdlib.result

\ No newline at end of file
+Bare (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Bare)
Module Proof_ser.Bare
module String_map : sig ... end
val spf : ('a, unit, string) Stdlib.format -> 'a
module Decode : sig ... end
module Encode : sig ... end
module Pp : sig ... end
val to_string : 'a Encode.enc -> 'a -> string
val of_bytes_exn : ?off:int -> (Decode.t -> 'a) -> bytes -> 'a
val of_bytes : ?off:int -> (Decode.t -> 'a) -> bytes -> ('a, string) Stdlib.result
val of_string_exn : (Decode.t -> 'a) -> string -> 'a
val of_string : (Decode.t -> 'a) -> string -> ('a, string) Stdlib.result

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Clause/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Clause/index.html
index 6d28dca1..9093c632 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Clause/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Clause/index.html
@@ -1,2 +1,2 @@
 
-Clause (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Clause)
Module Proof_ser.Clause
type t = {
lits : Lit.t array;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+Clause (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Clause)
Module Proof_ser.Clause
type t = {
lits : Lit.t array;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_app/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_app/index.html
index 24b18f2f..40c41dd8 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_app/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_app/index.html
@@ -1,2 +1,2 @@
 
-Expr_app (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Expr_app)
Module Proof_ser.Expr_app
type t = {
f : ID.t;
args : ID.t array;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+Expr_app (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Expr_app)
Module Proof_ser.Expr_app
type t = {
f : ID.t;
args : ID.t array;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_bool/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_bool/index.html
index aff9edd0..6f66b789 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_bool/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_bool/index.html
@@ -1,2 +1,2 @@
 
-Expr_bool (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Expr_bool)
Module Proof_ser.Expr_bool
type t = {
b : bool;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+Expr_bool (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Expr_bool)
Module Proof_ser.Expr_bool
type t = {
b : bool;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_def/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_def/index.html
index d0a1d94c..70083b0b 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_def/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_def/index.html
@@ -1,2 +1,2 @@
 
-Expr_def (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Expr_def)
Module Proof_ser.Expr_def
type t = {
c : ID.t;
rhs : ID.t;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+Expr_def (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Expr_def)
Module Proof_ser.Expr_def
type t = {
c : ID.t;
rhs : ID.t;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_eq/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_eq/index.html
index 827bbad8..e89da8a2 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_eq/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_eq/index.html
@@ -1,2 +1,2 @@
 
-Expr_eq (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Expr_eq)
Module Proof_ser.Expr_eq
type t = {
lhs : ID.t;
rhs : ID.t;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+Expr_eq (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Expr_eq)
Module Proof_ser.Expr_eq
type t = {
lhs : ID.t;
rhs : ID.t;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_if/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_if/index.html
index d6f11267..8000a6bd 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_if/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_if/index.html
@@ -1,2 +1,2 @@
 
-Expr_if (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Expr_if)
Module Proof_ser.Expr_if
type t = {
cond : ID.t;
then_ : ID.t;
else_ : ID.t;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+Expr_if (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Expr_if)
Module Proof_ser.Expr_if
type t = {
cond : ID.t;
then_ : ID.t;
else_ : ID.t;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_not/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_not/index.html
index bcc7c2cb..fa1e8b42 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_not/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Expr_not/index.html
@@ -1,2 +1,2 @@
 
-Expr_not (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Expr_not)
Module Proof_ser.Expr_not
type t = {
f : ID.t;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+Expr_not (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Expr_not)
Module Proof_ser.Expr_not
type t = {
f : ID.t;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Fun_decl/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Fun_decl/index.html
index 629ba012..1d44d1df 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Fun_decl/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Fun_decl/index.html
@@ -1,2 +1,2 @@
 
-Fun_decl (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Fun_decl)
Module Proof_ser.Fun_decl
type t = {
f : string;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+Fun_decl (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Fun_decl)
Module Proof_ser.Fun_decl
type t = {
f : string;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/ID/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/ID/index.html
index f7167741..4f95203f 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/ID/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/ID/index.html
@@ -1,2 +1,2 @@
 
-ID (sidekick-base.Sidekick_base_proof_trace.Proof_ser.ID)
Module Proof_ser.ID
type t = int32
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+ID (sidekick-base.Sidekick_base_proof_trace.Proof_ser.ID)
Module Proof_ser.ID
type t = int32
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Lit/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Lit/index.html
index 8176fa9d..b000c326 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Lit/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Lit)
Module Proof_ser.Lit
type t = ID.t
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+Lit (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Lit)
Module Proof_ser.Lit
type t = ID.t
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step/index.html
index ab2f4877..94da1acf 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step/index.html
@@ -1,2 +1,2 @@
 
-Step (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step)
Module Proof_ser.Step
type t = {
id : ID.t;
view : Step_view.t;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+Step (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step)
Module Proof_ser.Step
type t = {
id : ID.t;
view : Step_view.t;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_bool_c/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_bool_c/index.html
index e87f414e..23e6a756 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_bool_c/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_bool_c/index.html
@@ -1,2 +1,2 @@
 
-Step_bool_c (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_bool_c)
Module Proof_ser.Step_bool_c
type t = {
rule : string;
exprs : ID.t array;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+Step_bool_c (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_bool_c)
Module Proof_ser.Step_bool_c
type t = {
rule : string;
exprs : ID.t array;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_bool_tauto/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_bool_tauto/index.html
index b95edb2e..086b3aaa 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_bool_tauto/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_bool_tauto/index.html
@@ -1,2 +1,2 @@
 
-Step_bool_tauto (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_bool_tauto)
Module Proof_ser.Step_bool_tauto
type t = {
lits : Lit.t array;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+Step_bool_tauto (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_bool_tauto)
Module Proof_ser.Step_bool_tauto
type t = {
lits : Lit.t array;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_bridge_lit_expr/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_bridge_lit_expr/index.html
index af7c03b7..7c444c2e 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_bridge_lit_expr/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_bridge_lit_expr/index.html
@@ -1,2 +1,2 @@
 
-Step_bridge_lit_expr (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_bridge_lit_expr)
Module Proof_ser.Step_bridge_lit_expr
type t = {
lit : Lit.t;
expr : ID.t;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+Step_bridge_lit_expr (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_bridge_lit_expr)
Module Proof_ser.Step_bridge_lit_expr
type t = {
lit : Lit.t;
expr : ID.t;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_cc/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_cc/index.html
index c8ce2a3c..432ba14d 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_cc/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_cc/index.html
@@ -1,2 +1,2 @@
 
-Step_cc (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_cc)
Module Proof_ser.Step_cc
type t = {
eqns : ID.t array;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+Step_cc (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_cc)
Module Proof_ser.Step_cc
type t = {
eqns : ID.t array;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_clause_rw/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_clause_rw/index.html
index b9a3c035..695a44c5 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_clause_rw/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_clause_rw/index.html
@@ -1,2 +1,2 @@
 
-Step_clause_rw (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_clause_rw)
Module Proof_ser.Step_clause_rw
type t = {
c : ID.t;
res : Clause.t;
using : ID.t array;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+Step_clause_rw (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_clause_rw)
Module Proof_ser.Step_clause_rw
type t = {
c : ID.t;
res : Clause.t;
using : ID.t array;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_input/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_input/index.html
index 66ce7429..b658093b 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_input/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_input/index.html
@@ -1,2 +1,2 @@
 
-Step_input (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_input)
Module Proof_ser.Step_input
type t = {
c : Clause.t;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+Step_input (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_input)
Module Proof_ser.Step_input
type t = {
c : Clause.t;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_preprocess/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_preprocess/index.html
index 4eaf5490..e4212b9c 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_preprocess/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_preprocess/index.html
@@ -1,2 +1,2 @@
 
-Step_preprocess (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_preprocess)
Module Proof_ser.Step_preprocess
type t = {
t : ID.t;
u : ID.t;
using : ID.t array;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+Step_preprocess (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_preprocess)
Module Proof_ser.Step_preprocess
type t = {
t : ID.t;
u : ID.t;
using : ID.t array;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_proof_p1/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_proof_p1/index.html
index 266b38d6..b3fa1d63 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_proof_p1/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_proof_p1/index.html
@@ -1,2 +1,2 @@
 
-Step_proof_p1 (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_proof_p1)
Module Proof_ser.Step_proof_p1
type t = {
rw_with : ID.t;
c : ID.t;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+Step_proof_p1 (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_proof_p1)
Module Proof_ser.Step_proof_p1
type t = {
rw_with : ID.t;
c : ID.t;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_rup/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_rup/index.html
index 0feeb823..4bdb78e3 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_rup/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_rup/index.html
@@ -1,2 +1,2 @@
 
-Step_rup (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_rup)
Module Proof_ser.Step_rup
type t = {
res : Clause.t;
hyps : ID.t array;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+Step_rup (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_rup)
Module Proof_ser.Step_rup
type t = {
res : Clause.t;
hyps : ID.t array;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_true/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_true/index.html
index 70b78e17..e44019fe 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_true/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_true/index.html
@@ -1,2 +1,2 @@
 
-Step_true (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_true)
Module Proof_ser.Step_true
type t = {
true_ : ID.t;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+Step_true (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_true)
Module Proof_ser.Step_true
type t = {
true_ : ID.t;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_unsat/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_unsat/index.html
index d5e63f17..c725ba62 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_unsat/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_unsat/index.html
@@ -1,2 +1,2 @@
 
-Step_unsat (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_unsat)
Module Proof_ser.Step_unsat
type t = {
c : ID.t;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+Step_unsat (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_unsat)
Module Proof_ser.Step_unsat
type t = {
c : ID.t;
}
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_view/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_view/index.html
index 62b01354..a81492f0 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_view/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/Step_view/index.html
@@ -1,2 +1,2 @@
 
-Step_view (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_view)
Module Proof_ser.Step_view
type t = 
| Step_input of Step_input.t
| Step_unsat of Step_unsat.t
| Step_rup of Step_rup.t
| Step_bridge_lit_expr of Step_bridge_lit_expr.t
| Step_cc of Step_cc.t
| Step_preprocess of Step_preprocess.t
| Step_clause_rw of Step_clause_rw.t
| Step_bool_tauto of Step_bool_tauto.t
| Step_bool_c of Step_bool_c.t
| Step_proof_p1 of Step_proof_p1.t
| Step_true of Step_true.t
| Fun_decl of Fun_decl.t
| Expr_def of Expr_def.t
| Expr_bool of Expr_bool.t
| Expr_if of Expr_if.t
| Expr_not of Expr_not.t
| Expr_eq of Expr_eq.t
| Expr_app of Expr_app.t
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+Step_view (sidekick-base.Sidekick_base_proof_trace.Proof_ser.Step_view)
Module Proof_ser.Step_view
type t = 
| Step_input of Step_input.t
| Step_unsat of Step_unsat.t
| Step_rup of Step_rup.t
| Step_bridge_lit_expr of Step_bridge_lit_expr.t
| Step_cc of Step_cc.t
| Step_preprocess of Step_preprocess.t
| Step_clause_rw of Step_clause_rw.t
| Step_bool_tauto of Step_bool_tauto.t
| Step_bool_c of Step_bool_c.t
| Step_proof_p1 of Step_proof_p1.t
| Step_true of Step_true.t
| Fun_decl of Fun_decl.t
| Expr_def of Expr_def.t
| Expr_bool of Expr_bool.t
| Expr_if of Expr_if.t
| Expr_not of Expr_not.t
| Expr_eq of Expr_eq.t
| Expr_app of Expr_app.t
val decode : Bare.Decode.t -> t
  • raises Bare.Decode.Error 
    in case of error.
val encode : Bare.Encode.t -> t -> unit
val pp : Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/index.html
index e333511a..43450830 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Proof_ser/index.html
@@ -1,2 +1,2 @@
 
-Proof_ser (sidekick-base.Sidekick_base_proof_trace.Proof_ser)
Module Sidekick_base_proof_trace.Proof_ser
module Bare : sig ... end
module ID : sig ... end
module Lit : sig ... end
module Clause : sig ... end
module Step_input : sig ... end
module Step_rup : sig ... end
module Step_bridge_lit_expr : sig ... end
module Step_cc : sig ... end
module Step_preprocess : sig ... end
module Step_clause_rw : sig ... end
module Step_unsat : sig ... end
module Step_proof_p1 : sig ... end
module Step_bool_tauto : sig ... end
module Step_bool_c : sig ... end
module Step_true : sig ... end
module Fun_decl : sig ... end
module Expr_def : sig ... end
module Expr_bool : sig ... end
module Expr_if : sig ... end
module Expr_not : sig ... end
module Expr_eq : sig ... end
module Expr_app : sig ... end
module Step_view : sig ... end
module Step : sig ... end

\ No newline at end of file
+Proof_ser (sidekick-base.Sidekick_base_proof_trace.Proof_ser)
Module Sidekick_base_proof_trace.Proof_ser
module Bare : sig ... end
module ID : sig ... end
module Lit : sig ... end
module Clause : sig ... end
module Step_input : sig ... end
module Step_rup : sig ... end
module Step_bridge_lit_expr : sig ... end
module Step_cc : sig ... end
module Step_preprocess : sig ... end
module Step_clause_rw : sig ... end
module Step_unsat : sig ... end
module Step_proof_p1 : sig ... end
module Step_bool_tauto : sig ... end
module Step_bool_c : sig ... end
module Step_true : sig ... end
module Fun_decl : sig ... end
module Expr_def : sig ... end
module Expr_bool : sig ... end
module Expr_if : sig ... end
module Expr_not : sig ... end
module Expr_eq : sig ... end
module Expr_app : sig ... end
module Step_view : sig ... end
module Step : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/Storage/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/Storage/index.html
index c2f5b1dc..153800ad 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/Storage/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/Storage/index.html
@@ -1,2 +1,2 @@
 
-Storage (sidekick-base.Sidekick_base_proof_trace.Storage)
Module Sidekick_base_proof_trace.Storage
type t = 
| No_store
| In_memory of Sidekick_util.Chunk_stack.Buf.t
| On_disk of string * Stdlib.out_channel
val pp : Stdlib.Format.formatter -> t -> unit
val iter_steps_backward : t -> Proof_ser.Step.t Iter.t

\ No newline at end of file
+Storage (sidekick-base.Sidekick_base_proof_trace.Storage)
Module Sidekick_base_proof_trace.Storage
type t = 
| No_store
| In_memory of Sidekick_util.Chunk_stack.Buf.t
| On_disk of string * Stdlib.out_channel
val pp : Stdlib.Format.formatter -> t -> unit
val iter_steps_backward : t -> Proof_ser.Step.t Iter.t

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace/index.html b/dev/sidekick-base/Sidekick_base_proof_trace/index.html
index 9cde0f1c..e1b3c8b9 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_base_proof_trace (sidekick-base.Sidekick_base_proof_trace)
Module Sidekick_base_proof_trace
Proof trace with serialization
This library is useful to serialize a series of reasoning steps in memory or into a file, to be able to reconstruct a proper proof later.
module Proof_ser : sig ... end
module Storage : sig ... end
val iter_steps_backward : Storage.t -> Proof_ser.Step.t Iter.t

\ No newline at end of file
+Sidekick_base_proof_trace (sidekick-base.Sidekick_base_proof_trace)
Module Sidekick_base_proof_trace
Proof trace with serialization
This library is useful to serialize a series of reasoning steps in memory or into a file, to be able to reconstruct a proper proof later.
module Proof_ser : sig ... end
module Storage : sig ... end
val iter_steps_backward : Storage.t -> Proof_ser.Step.t Iter.t

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace__/index.html b/dev/sidekick-base/Sidekick_base_proof_trace__/index.html
index 35906ac3..297c3827 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace__/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace__/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_base_proof_trace__ (sidekick-base.Sidekick_base_proof_trace__)
Module Sidekick_base_proof_trace__

\ No newline at end of file
+Sidekick_base_proof_trace__ (sidekick-base.Sidekick_base_proof_trace__)
Module Sidekick_base_proof_trace__

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace__Proof_ser/index.html b/dev/sidekick-base/Sidekick_base_proof_trace__Proof_ser/index.html
index 2d6b2af9..3b6af99f 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace__Proof_ser/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace__Proof_ser/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_base_proof_trace__Proof_ser (sidekick-base.Sidekick_base_proof_trace__Proof_ser)
Module Sidekick_base_proof_trace__Proof_ser

\ No newline at end of file
+Sidekick_base_proof_trace__Proof_ser (sidekick-base.Sidekick_base_proof_trace__Proof_ser)
Module Sidekick_base_proof_trace__Proof_ser

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_proof_trace__Storage/index.html b/dev/sidekick-base/Sidekick_base_proof_trace__Storage/index.html
index 50463873..54dd0a8c 100644
--- a/dev/sidekick-base/Sidekick_base_proof_trace__Storage/index.html
+++ b/dev/sidekick-base/Sidekick_base_proof_trace__Storage/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_base_proof_trace__Storage (sidekick-base.Sidekick_base_proof_trace__Storage)
Module Sidekick_base_proof_trace__Storage

\ No newline at end of file
+Sidekick_base_proof_trace__Storage (sidekick-base.Sidekick_base_proof_trace__Storage)
Module Sidekick_base_proof_trace__Storage

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/T/Fun/index.html
index 91c53d20..7a5c56ef 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Solver.Lit.T.Fun)
Module T.Fun
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Solver.Lit.T.Fun)
Module T.Fun
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/T/Term/Tbl/index.html
index e253927c..142a3986 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Solver.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a Solver_arg.T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Solver.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a Solver_arg.T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/T/Term/index.html
index ff93b658..dcb01fbc 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Solver.Lit.T.Term)
Module T.Term
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Solver.Lit.T.Term)
Module T.Term
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/T/Ty/index.html
index 6f4fded0..31448b47 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Solver.Lit.T.Ty)
Module T.Ty
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Solver.Lit.T.Ty)
Module T.Ty
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/T/index.html
index 03faaa00..dcd04019 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Solver.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Solver.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/index.html
index 49f201b2..7b51d18f 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick-base.Sidekick_base_solver.Solver.Lit)
Module Solver.Lit
module T : sig ... end
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick-base.Sidekick_base_solver.Solver.Lit)
Module Solver.Lit
module T : sig ... end
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Model/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Model/index.html
index aa2e9229..613e47a3 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Model/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Model/index.html
@@ -1,2 +1,2 @@
 
-Model (sidekick-base.Sidekick_base_solver.Solver.Model)
Module Solver.Model
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Model (sidekick-base.Sidekick_base_solver.Solver.Model)
Module Solver.Model
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/P/Step_vec/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/P/Step_vec/index.html
index 3206547c..939e7c3d 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/P/Step_vec/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick-base.Sidekick_base_solver.Solver.P.Step_vec)
Module P.Step_vec
type elt = proof_step
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick-base.Sidekick_base_solver.Solver.P.Step_vec)
Module P.Step_vec
type elt = proof_step
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/P/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/P/index.html
index c152c8a5..beef1b8b 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/P/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick-base.Sidekick_base_solver.Solver.P)
Module Solver.P
type proof_step = Solver_arg.proof_step
type lit = Solver_arg.Lit.t
type proof_rule = t -> proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
module Step_vec : sig ... end
val enabled : t -> bool
val emit_input_clause : lit Iter.t -> proof_rule
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
val emit_unsat_core : lit Iter.t -> proof_rule
val emit_unsat : proof_step -> t -> unit
val del_clause : proof_step -> lit Iter.t -> t -> unit
val define_term : term -> term -> proof_rule
val proof_p1 : proof_step -> proof_step -> proof_rule
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
val lemma_true : term -> proof_rule
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule

\ No newline at end of file
+P (sidekick-base.Sidekick_base_solver.Solver.P)
Module Solver.P
type proof_step = Solver_arg.proof_step
type lit = Solver_arg.Lit.t
type proof_rule = t -> proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
module Step_vec : sig ... end
val enabled : t -> bool
val emit_input_clause : lit Iter.t -> proof_rule
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
val emit_unsat_core : lit Iter.t -> proof_rule
val emit_unsat : proof_step -> t -> unit
val del_clause : proof_step -> lit Iter.t -> t -> unit
val define_term : term -> term -> proof_rule
val proof_p1 : proof_step -> proof_step -> proof_rule
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
val lemma_true : term -> proof_rule
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/T/Fun/index.html
index 3d5f74b8..d1373f70 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/T/Term/Tbl/index.html
index abc4c348..2a097a6c 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/T/Term/index.html
index 50ac336f..7acc7c6e 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/T/Ty/index.html
index 941fc3a7..1191f5b3 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/T/index.html
index eeb88034..76d6ac53 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/index.html
index b0198075..78a5eef0 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.Lit)
Module Actions.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.Lit)
Module Actions.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/P/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/P/index.html
index 00c6e790..4805350f 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/P/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step

\ No newline at end of file
+P (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/T/Fun/index.html
index 6927620c..e48b9faf 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/T/Term/Tbl/index.html
index 07543073..4781be29 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/T/Term/index.html
index dcde36d5..08bae5b5 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/T/Ty/index.html
index 9b59853e..24b1d431 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/T/index.html
index b0ebe3aa..01727bb1 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.T)
Module Actions.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions.T)
Module Actions.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/index.html
index 3bf0be33..16725d1c 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions)
Module CC.Actions
module T : sig ... end
module Lit : sig ... end
type proof = proof
type proof_step = proof_step
module P : sig ... end
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit

\ No newline at end of file
+Actions (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Actions)
Module CC.Actions
module T : sig ... end
module Lit : sig ... end
type proof = proof
type proof_step = proof_step
module P : sig ... end
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Debug_/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Debug_/index.html
index fa1710d8..93632cbb 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Debug_/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Debug_/index.html
@@ -1,2 +1,2 @@
 
-Debug_ (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Debug_)
Module CC.Debug_
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Debug_ (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Debug_)
Module CC.Debug_
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Expl/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Expl/index.html
index 6bcf0bd5..d5d716a9 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Expl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Expl)
Module CC.Expl
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Expl)
Module CC.Expl
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/T/Fun/index.html
index 00ccedf3..47322363 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/T/Term/Tbl/index.html
index 115fee1c..806237ea 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/T/Term/index.html
index d8d6c78b..2810ddfe 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/T/Ty/index.html
index 85efb630..49249fda 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/T/index.html
index cc276ae6..4716a106 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/index.html
index 72ea2348..7eccb7aa 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Lit)
Module CC.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.Lit)
Module CC.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/N/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/N/index.html
index 38fbf8b7..e74cd3e4 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/N/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.N)
Module CC.N
val term : t -> term
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val is_root : t -> bool
val iter_class : t -> t Iter.t
val iter_parents : t -> t Iter.t

\ No newline at end of file
+N (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.N)
Module CC.N
val term : t -> term
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val is_root : t -> bool
val iter_class : t -> t Iter.t
val iter_parents : t -> t Iter.t

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/P/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/P/index.html
index 1af7669c..a13db5bb 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/P/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step

\ No newline at end of file
+P (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/T/Fun/index.html
index fee91a7d..5ddc59d3 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/T/Term/Tbl/index.html
index e4e5dfa8..c9e1a864 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/T/Term/index.html
index d257524a..3d3b9667 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/T/Ty/index.html
index 3c7569a0..be9d7421 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/T/index.html
index 7cb28540..0eaf211f 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.T)
Module CC.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC.T)
Module CC.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/index.html
index 7031ffb6..aa04f1c4 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/CC/index.html
@@ -1,4 +1,4 @@
 
-CC (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC)
Module Solver_internal.CC
module T : sig ... end
module Lit : sig ... end
type proof = proof
type proof_step = proof_step
module P : sig ... end
module Actions : sig ... end
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
module N : sig ... end
module Expl : sig ... end
type node = N.t
type repr = N.t
type explanation = Expl.t
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
val add_term : t -> term -> node
val mem_term : t -> term -> bool
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
type ev_on_new_term = t -> N.t -> term -> unit
type ev_on_conflict = t -> th:bool -> lit list -> unit
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
type ev_on_is_subterm = N.t -> term -> unit
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+CC (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.CC)
Module Solver_internal.CC
module T : sig ... end
module Lit : sig ... end
type proof = proof
type proof_step = proof_step
module P : sig ... end
module Actions : sig ... end
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
module N : sig ... end
module Expl : sig ... end
type node = N.t
type repr = N.t
type explanation = Expl.t
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
val add_term : t -> term -> node
val mem_term : t -> term -> bool
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
type ev_on_new_term = t -> N.t -> term -> unit
type ev_on_conflict = t -> th:bool -> lit list -> unit
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
type ev_on_is_subterm = N.t -> term -> unit
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Big | `Small ] -> term_store -> proof -> t
val allocate_bitfield : descr:string -> t -> N.bitfield
val get_bitfield : t -> N.bitfield -> N.t -> bool
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
val on_pre_merge : t -> ev_on_pre_merge -> unit
val on_post_merge : t -> ev_on_post_merge -> unit
val on_new_term : t -> ev_on_new_term -> unit
val on_conflict : t -> ev_on_conflict -> unit
val on_propagate : t -> ev_on_propagate -> unit
val on_is_subterm : t -> ev_on_is_subterm -> unit
val set_as_lit : t -> N.t -> lit -> unit
val find_t : t -> term -> repr
val add_seq : t -> term Iter.t -> unit
val all_classes : t -> repr Iter.t
val assert_lit : t -> lit -> unit
val assert_lits : t -> lit Iter.t -> unit
val explain_eq : t -> N.t -> N.t -> lit list
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
val n_true : t -> N.t
val n_false : t -> N.t
val n_bool : t -> bool -> N.t
val merge : t -> N.t -> N.t -> Expl.t -> unit
val merge_t : t -> term -> term -> Expl.t -> unit
val check : t -> actions -> unit
val new_merges : t -> bool
val push_level : t -> unit
val pop_levels : t -> int -> unit
val get_model : t -> N.t Iter.t Iter.t
module Debug_ : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/T/Fun/index.html
index f18cc537..8a74ead7 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/T/Term/Tbl/index.html
index 6c7ef9d8..1e8280e5 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/T/Term/index.html
index b87eabf1..be3d6971 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/T/Ty/index.html
index a30e1884..c54fd93b 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/T/index.html
index 2e1ed0f3..7e4832fd 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/index.html
index 8a7b8c80..b0b26153 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.Lit)
Module Solver_internal.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.Lit)
Module Solver_internal.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/P/Step_vec/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/P/Step_vec/index.html
index b0ec83fa..a760606f 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/P/Step_vec/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.P.Step_vec)
Module P.Step_vec
type elt = proof_step
type t = P.Step_vec.t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.P.Step_vec)
Module P.Step_vec
type elt = proof_step
type t = P.Step_vec.t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/P/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/P/index.html
index cfad1666..c044c59a 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/P/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.P)
Module Solver_internal.P
type t = proof
type proof_step = proof_step
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
module Step_vec : sig ... end
val enabled : t -> bool
val emit_input_clause : lit Iter.t -> proof_rule
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
val emit_unsat_core : lit Iter.t -> proof_rule
val emit_unsat : proof_step -> t -> unit
val del_clause : proof_step -> lit Iter.t -> t -> unit
val define_term : term -> term -> proof_rule
val proof_p1 : proof_step -> proof_step -> proof_rule
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
val lemma_true : term -> proof_rule
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule

\ No newline at end of file
+P (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.P)
Module Solver_internal.P
type t = proof
type proof_step = proof_step
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
module Step_vec : sig ... end
val enabled : t -> bool
val emit_input_clause : lit Iter.t -> proof_rule
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
val emit_unsat_core : lit Iter.t -> proof_rule
val emit_unsat : proof_step -> t -> unit
val del_clause : proof_step -> lit Iter.t -> t -> unit
val define_term : term -> term -> proof_rule
val proof_p1 : proof_step -> proof_step -> proof_rule
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
val lemma_true : term -> proof_rule
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Simplify/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Simplify/index.html
index 44bd6f93..16b62014 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Simplify/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/Simplify/index.html
@@ -1,2 +1,2 @@
 
-Simplify (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.Simplify)
Module Solver_internal.Simplify
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
val proof : t -> proof
type hook = t -> term -> (term * proof_step Iter.t) option
val normalize : t -> term -> (term * proof_step) option
val normalize_t : t -> term -> term * proof_step option

\ No newline at end of file
+Simplify (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.Simplify)
Module Solver_internal.Simplify
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
val proof : t -> proof
type hook = t -> term -> (term * proof_step Iter.t) option
val normalize : t -> term -> (term * proof_step) option
val normalize_t : t -> term -> term * proof_step option

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/T/Fun/index.html
index 7ba74e41..380337fd 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/T/Term/Tbl/index.html
index c17bc1a4..6326f95a 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/T/Term/index.html
index 8d1e32a5..d0746389 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/T/Ty/index.html
index 2cc91af2..9a9e63e9 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/T/index.html
index 77c3e1f0..c88d02e9 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.T)
Module Solver_internal.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.T)
Module Solver_internal.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/index.html
index 4693345e..5d34e18a 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/index.html
@@ -1,2 +1,2 @@
 
-Solver_internal (sidekick-base.Sidekick_base_solver.Solver.Solver_internal)
Module Solver.Solver_internal
module T : sig ... end
module Lit : sig ... end
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type proof = proof
type proof_step = proof_step
module P : sig ... end
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
type lit = Lit.t
module CC : sig ... end
val cc : t -> CC.t
module Simplify : sig ... end
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
val simplify_t : t -> term -> (term * proof_step) option
val simp_t : t -> term -> term * proof_step option
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
val on_preprocess : t -> preprocess_hook -> unit
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
val push_decision : t -> theory_actions -> lit -> unit
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
val cc_find : t -> CC.N.t -> CC.N.t
val cc_are_equal : t -> term -> term -> bool
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
val cc_add_term : t -> term -> CC.N.t
val cc_mem_term : t -> term -> bool
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
val on_model_gen : t -> model_hook -> unit

\ No newline at end of file
+Solver_internal (sidekick-base.Sidekick_base_solver.Solver.Solver_internal)
Module Solver.Solver_internal
module T : sig ... end
module Lit : sig ... end
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type proof = proof
type proof_step = proof_step
module P : sig ... end
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
type lit = Lit.t
module CC : sig ... end
val cc : t -> CC.t
module Simplify : sig ... end
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
val simplify_t : t -> term -> (term * proof_step) option
val simp_t : t -> term -> term * proof_step option
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
val on_preprocess : t -> preprocess_hook -> unit
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
val push_decision : t -> theory_actions -> lit -> unit
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
val cc_find : t -> CC.N.t -> CC.N.t
val cc_are_equal : t -> term -> term -> bool
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
val cc_add_term : t -> term -> CC.N.t
val cc_mem_term : t -> term -> bool
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
val on_model_gen : t -> model_hook -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/module-type-PREPROCESS_ACTS/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/module-type-PREPROCESS_ACTS/index.html
index db81a4ed..3e610389 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/module-type-PREPROCESS_ACTS/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Solver_internal/module-type-PREPROCESS_ACTS/index.html
@@ -1,2 +1,2 @@
 
-PREPROCESS_ACTS (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
val mk_lit : ?sign:bool -> term -> lit * proof_step option
val add_clause : lit list -> proof_step -> unit
val add_lit : ?default_pol:bool -> lit -> unit

\ No newline at end of file
+PREPROCESS_ACTS (sidekick-base.Sidekick_base_solver.Solver.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
val mk_lit : ?sign:bool -> term -> lit * proof_step option
val add_clause : lit list -> proof_step -> unit
val add_lit : ?default_pol:bool -> lit -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/T/Fun/index.html
index 88ed3859..f75b3ff7 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Solver.T.Fun)
Module T.Fun
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Solver.T.Fun)
Module T.Fun
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/T/Term/Tbl/index.html
index b6287a3d..088bd721 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Solver.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a Solver_arg.T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Solver.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a Solver_arg.T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/T/Term/index.html
index 24286b80..98600341 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Solver.T.Term)
Module T.Term
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Solver.T.Term)
Module T.Term
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/T/Ty/index.html
index 199f5783..36b0fa24 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Solver.T.Ty)
Module T.Ty
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Solver.T.Ty)
Module T.Ty
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/T/index.html
index cfefd3eb..52dda1e9 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Solver.T)
Module Solver.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Solver.T)
Module Solver.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/Unknown/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/Unknown/index.html
index 5e19ab4a..982aa378 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/Unknown/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/Unknown/index.html
@@ -1,2 +1,2 @@
 
-Unknown (sidekick-base.Sidekick_base_solver.Solver.Unknown)
Module Solver.Unknown
val pp : t CCFormat.printer

\ No newline at end of file
+Unknown (sidekick-base.Sidekick_base_solver.Solver.Unknown)
Module Solver.Unknown
val pp : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/index.html
index d280f389..d2773e51 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/index.html
@@ -1,5 +1,5 @@
 
-Solver (sidekick-base.Sidekick_base_solver.Solver)
Module Sidekick_base_solver.Solver
SMT solver, obtained from Sidekick_smt_solver
module T : sig ... end
module Lit : sig ... end
type proof = Solver_arg.proof
type proof_step = Solver_arg.proof_step
module P : sig ... end
module Solver_internal : sig ... end
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
type !'a theory_p = (module THEORY with type t = 'a)
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
+Solver (sidekick-base.Sidekick_base_solver.Solver)
Module Sidekick_base_solver.Solver
SMT solver, obtained from Sidekick_smt_solver
module T : sig ... end
module Lit : sig ... end
type proof = Solver_arg.proof
type proof_step = Solver_arg.proof_step
module P : sig ... end
module Solver_internal : sig ... end
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
type !'a theory_p = (module THEORY with type t = 'a)
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
 ?push_level:('th -> unit) -> ?pop_levels:('th -> int -> unit) -> unit -> theory
module Model : sig ... end
module Unknown : sig ... end
val stats : t -> Sidekick_util.Stat.t
val tst : t -> T.Term.store
val ty_st : t -> T.Ty.store
val proof : t -> proof
val create : ?stat:Sidekick_util.Stat.t -> ?size:[ `Big | `Small | `Tiny ] -> proof:proof -> theories:theory list ->
 T.Term.store -> T.Ty.store -> unit -> t
val add_theory : t -> theory -> unit
val add_theory_p : t -> 'a theory_p -> 'a
val add_theory_l : t -> theory list -> unit
val mk_lit_t : t -> ?sign:bool -> term -> lit
val add_clause : t -> lit Sidekick_util.IArray.t -> proof_step -> unit
val add_clause_l : t -> lit list -> proof_step -> unit
val assert_terms : t -> term list -> unit
val assert_term : t -> term -> unit
type res = Sidekick_smt_solver.Make(Solver_arg).res = 
| Sat of Model.t
| Unsat of {
unsat_core : unit -> lit Iter.t;
unsat_proof_step : unit -> proof_step option;
}
| Unknown of Unknown.t
val solve : ?on_exit:(unit -> unit) list -> ?check:bool -> ?on_progress:(t -> unit) ->
 assumptions:lit list -> t -> res
val pp_stats : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver/module-type-THEORY/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver/module-type-THEORY/index.html
index f58f0082..d45724fd 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver/module-type-THEORY/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver/module-type-THEORY/index.html
@@ -1,2 +1,2 @@
 
-THEORY (sidekick-base.Sidekick_base_solver.Solver.THEORY)
Module type Solver.THEORY
type t
val name : string
val create_and_setup : Solver_internal.t -> t
val push_level : t -> unit
val pop_levels : t -> int -> unit

\ No newline at end of file
+THEORY (sidekick-base.Sidekick_base_solver.Solver.THEORY)
Module type Solver.THEORY
type t
val name : string
val create_and_setup : Solver_internal.t -> t
val push_level : t -> unit
val pop_levels : t -> int -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Solver_arg/index.html b/dev/sidekick-base/Sidekick_base_solver/Solver_arg/index.html
index 4d387852..789a530d 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Solver_arg/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Solver_arg/index.html
@@ -1,2 +1,2 @@
 
-Solver_arg (sidekick-base.Sidekick_base_solver.Solver_arg)
Module Sidekick_base_solver.Solver_arg
Argument to the SMT solver
module Lit = Sidekick_base.Lit
val cc_view : Sidekick_base.Term.t -> (Sidekick_base__Base_types.fun_, Sidekick_base.Term.t, Sidekick_base.Term.t Iter.t) Sidekick_core.CC_view.t
val is_valid_literal : 'a -> bool
type proof = P.t
type proof_step = P.proof_step

\ No newline at end of file
+Solver_arg (sidekick-base.Sidekick_base_solver.Solver_arg)
Module Sidekick_base_solver.Solver_arg
Argument to the SMT solver
module Lit = Sidekick_base.Lit
val cc_view : Sidekick_base.Term.t -> (Sidekick_base__Base_types.fun_, Sidekick_base.Term.t, Sidekick_base.Term.t Iter.t) Sidekick_core.CC_view.t
val is_valid_literal : 'a -> bool
type proof = P.t
type proof_step = P.proof_step

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/Gensym/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/Gensym/index.html
index a5dce5a3..8eee7ecf 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/Gensym/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/Gensym/index.html
@@ -1,2 +1,2 @@
 
-Gensym (sidekick-base.Sidekick_base_solver.Th_bool.A.Gensym)
Module A.Gensym
type t
val create : S.T.Term.store -> t
val fresh_term : t -> pre:string -> S.T.Ty.t -> term

\ No newline at end of file
+Gensym (sidekick-base.Sidekick_base_solver.Th_bool.A.Gensym)
Module A.Gensym
type t
val create : S.T.Term.store -> t
val fresh_term : t -> pre:string -> S.T.Ty.t -> term

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/T/Fun/index.html
index a7bf6464..9521573d 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/T/Term/Tbl/index.html
index b0f59a6e..702f1b52 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/T/Term/index.html
index 7e62c409..ec253b84 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/T/Ty/index.html
index a3c32ed6..7bdaade7 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/T/index.html
index d799e4bb..e0283448 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/index.html
index a1416ae5..b7981247 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Lit)
Module S.Lit
module T : sig ... end
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Lit)
Module S.Lit
module T : sig ... end
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Model/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Model/index.html
index 396dba46..f5c7dab0 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Model/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Model/index.html
@@ -1,2 +1,2 @@
 
-Model (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Model)
Module S.Model
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Model (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Model)
Module S.Model
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/P/Step_vec/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/P/Step_vec/index.html
index b54f26cc..3de689f8 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/P/Step_vec/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick-base.Sidekick_base_solver.Th_bool.A.S.P.Step_vec)
Module P.Step_vec
type elt = proof_step
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick-base.Sidekick_base_solver.Th_bool.A.S.P.Step_vec)
Module P.Step_vec
type elt = proof_step
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/P/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/P/index.html
index 9625e813..61e1c216 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/P/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick-base.Sidekick_base_solver.Th_bool.A.S.P)
Module S.P
type t = proof
type proof_step = proof_step
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
module Step_vec : sig ... end
val enabled : t -> bool
val emit_input_clause : lit Iter.t -> proof_rule
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
val emit_unsat_core : lit Iter.t -> proof_rule
val emit_unsat : proof_step -> t -> unit
val del_clause : proof_step -> lit Iter.t -> t -> unit
val define_term : term -> term -> proof_rule
val proof_p1 : proof_step -> proof_step -> proof_rule
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
val lemma_true : term -> proof_rule
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule

\ No newline at end of file
+P (sidekick-base.Sidekick_base_solver.Th_bool.A.S.P)
Module S.P
type t = proof
type proof_step = proof_step
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
module Step_vec : sig ... end
val enabled : t -> bool
val emit_input_clause : lit Iter.t -> proof_rule
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
val emit_unsat_core : lit Iter.t -> proof_rule
val emit_unsat : proof_step -> t -> unit
val del_clause : proof_step -> lit Iter.t -> t -> unit
val define_term : term -> term -> proof_rule
val proof_p1 : proof_step -> proof_step -> proof_rule
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
val lemma_true : term -> proof_rule
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/T/Fun/index.html
index 30832ffc..6746191f 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/T/Term/Tbl/index.html
index ccd4d218..aaf65652 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/T/Term/index.html
index 5ecc33b4..e42a42f1 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/T/Ty/index.html
index f79f1785..7e8577bf 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/T/index.html
index 17687290..b4a83289 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/index.html
index a2b1f44f..a6839650 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.Lit)
Module Actions.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.Lit)
Module Actions.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/P/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/P/index.html
index 57b95497..7da2ff63 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/P/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step

\ No newline at end of file
+P (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/T/Fun/index.html
index c33677f0..fd7c9a37 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/T/Term/Tbl/index.html
index 95b65425..7708ed65 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/T/Term/index.html
index 40c6af5b..1d2e2661 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/T/Ty/index.html
index 532ab03e..03a10dd1 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/T/index.html
index 55a75c96..b400f69b 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.T)
Module Actions.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions.T)
Module Actions.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/index.html
index 49ba2270..653413f0 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions)
Module CC.Actions
module T : sig ... end
module Lit : sig ... end
type proof = proof
type proof_step = proof_step
module P : sig ... end
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit

\ No newline at end of file
+Actions (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Actions)
Module CC.Actions
module T : sig ... end
module Lit : sig ... end
type proof = proof
type proof_step = proof_step
module P : sig ... end
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Debug_/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Debug_/index.html
index 6075a22b..3507aba3 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Debug_/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Debug_/index.html
@@ -1,2 +1,2 @@
 
-Debug_ (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Debug_)
Module CC.Debug_
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Debug_ (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Debug_)
Module CC.Debug_
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Expl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Expl/index.html
index 445b7ddd..3926f83c 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Expl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Expl)
Module CC.Expl
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Expl)
Module CC.Expl
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/T/Fun/index.html
index 385d809b..8aab89f3 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/T/Term/Tbl/index.html
index 0c5a0e71..c213249e 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/T/Term/index.html
index 8666e58f..a21dc3e5 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/T/Ty/index.html
index 51860622..e8c580f7 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/T/index.html
index fbe78c75..c2ae58c8 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/index.html
index ce7bcb07..2039ae89 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Lit)
Module CC.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.Lit)
Module CC.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/N/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/N/index.html
index bada0264..900eef30 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/N/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.N)
Module CC.N
val term : t -> term
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val is_root : t -> bool
val iter_class : t -> t Iter.t
val iter_parents : t -> t Iter.t

\ No newline at end of file
+N (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.N)
Module CC.N
val term : t -> term
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val is_root : t -> bool
val iter_class : t -> t Iter.t
val iter_parents : t -> t Iter.t

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/P/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/P/index.html
index 32a3c8cf..3160f1b8 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/P/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step

\ No newline at end of file
+P (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/T/Fun/index.html
index a1dcf8db..1b4bf17c 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/T/Term/Tbl/index.html
index f9f7d092..96662668 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/T/Term/index.html
index cb3fd627..99cd9b63 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/T/Ty/index.html
index 501009b8..48c0bb70 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/T/index.html
index e3afe752..c54f1984 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.T)
Module CC.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC.T)
Module CC.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/index.html
index 054c86ff..a4c9fbd1 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/CC/index.html
@@ -1,4 +1,4 @@
 
-CC (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC)
Module Solver_internal.CC
module T : sig ... end
module Lit : sig ... end
type proof = proof
type proof_step = proof_step
module P : sig ... end
module Actions : sig ... end
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
module N : sig ... end
module Expl : sig ... end
type node = N.t
type repr = N.t
type explanation = Expl.t
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
val add_term : t -> term -> node
val mem_term : t -> term -> bool
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
type ev_on_new_term = t -> N.t -> term -> unit
type ev_on_conflict = t -> th:bool -> lit list -> unit
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
type ev_on_is_subterm = N.t -> term -> unit
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+CC (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.CC)
Module Solver_internal.CC
module T : sig ... end
module Lit : sig ... end
type proof = proof
type proof_step = proof_step
module P : sig ... end
module Actions : sig ... end
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
module N : sig ... end
module Expl : sig ... end
type node = N.t
type repr = N.t
type explanation = Expl.t
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
val add_term : t -> term -> node
val mem_term : t -> term -> bool
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
type ev_on_new_term = t -> N.t -> term -> unit
type ev_on_conflict = t -> th:bool -> lit list -> unit
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
type ev_on_is_subterm = N.t -> term -> unit
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Big | `Small ] -> term_store -> proof -> t
val allocate_bitfield : descr:string -> t -> N.bitfield
val get_bitfield : t -> N.bitfield -> N.t -> bool
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
val on_pre_merge : t -> ev_on_pre_merge -> unit
val on_post_merge : t -> ev_on_post_merge -> unit
val on_new_term : t -> ev_on_new_term -> unit
val on_conflict : t -> ev_on_conflict -> unit
val on_propagate : t -> ev_on_propagate -> unit
val on_is_subterm : t -> ev_on_is_subterm -> unit
val set_as_lit : t -> N.t -> lit -> unit
val find_t : t -> term -> repr
val add_seq : t -> term Iter.t -> unit
val all_classes : t -> repr Iter.t
val assert_lit : t -> lit -> unit
val assert_lits : t -> lit Iter.t -> unit
val explain_eq : t -> N.t -> N.t -> lit list
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
val n_true : t -> N.t
val n_false : t -> N.t
val n_bool : t -> bool -> N.t
val merge : t -> N.t -> N.t -> Expl.t -> unit
val merge_t : t -> term -> term -> Expl.t -> unit
val check : t -> actions -> unit
val new_merges : t -> bool
val push_level : t -> unit
val pop_levels : t -> int -> unit
val get_model : t -> N.t Iter.t Iter.t
module Debug_ : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/T/Fun/index.html
index 5cfac9f5..0f502450 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/T/Term/Tbl/index.html
index f64dbda0..91c53574 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/T/Term/index.html
index 380a95ee..3833d7f8 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/T/Ty/index.html
index b485b0f5..554e45b8 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/T/index.html
index d3bd7b07..8b8b07ae 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/index.html
index 6c743991..967d1705 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.Lit)
Module Solver_internal.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.Lit)
Module Solver_internal.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/P/Step_vec/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/P/Step_vec/index.html
index a4cc4dc6..4b618323 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/P/Step_vec/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.P.Step_vec)
Module P.Step_vec
type elt = proof_step
type t = P.Step_vec.t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.P.Step_vec)
Module P.Step_vec
type elt = proof_step
type t = P.Step_vec.t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/P/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/P/index.html
index 0c30be0d..0c0252f4 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/P/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.P)
Module Solver_internal.P
type t = proof
type proof_step = proof_step
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
module Step_vec : sig ... end
val enabled : t -> bool
val emit_input_clause : lit Iter.t -> proof_rule
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
val emit_unsat_core : lit Iter.t -> proof_rule
val emit_unsat : proof_step -> t -> unit
val del_clause : proof_step -> lit Iter.t -> t -> unit
val define_term : term -> term -> proof_rule
val proof_p1 : proof_step -> proof_step -> proof_rule
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
val lemma_true : term -> proof_rule
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule

\ No newline at end of file
+P (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.P)
Module Solver_internal.P
type t = proof
type proof_step = proof_step
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
module Step_vec : sig ... end
val enabled : t -> bool
val emit_input_clause : lit Iter.t -> proof_rule
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
val emit_unsat_core : lit Iter.t -> proof_rule
val emit_unsat : proof_step -> t -> unit
val del_clause : proof_step -> lit Iter.t -> t -> unit
val define_term : term -> term -> proof_rule
val proof_p1 : proof_step -> proof_step -> proof_rule
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
val lemma_true : term -> proof_rule
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Simplify/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Simplify/index.html
index a8b67c87..35dfb318 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Simplify/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/Simplify/index.html
@@ -1,2 +1,2 @@
 
-Simplify (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
val proof : t -> proof
type hook = t -> term -> (term * proof_step Iter.t) option
val normalize : t -> term -> (term * proof_step) option
val normalize_t : t -> term -> term * proof_step option

\ No newline at end of file
+Simplify (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
val proof : t -> proof
type hook = t -> term -> (term * proof_step Iter.t) option
val normalize : t -> term -> (term * proof_step) option
val normalize_t : t -> term -> term * proof_step option

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/T/Fun/index.html
index c424a404..1daca23a 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/T/Term/Tbl/index.html
index aed3fa37..2af39a50 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/T/Term/index.html
index 5858b370..ee3697a3 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/T/Ty/index.html
index 4c70557b..5ead314f 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/T/index.html
index 119d2a38..8f7dd936 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.T)
Module Solver_internal.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.T)
Module Solver_internal.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/index.html
index e3f8a777..7804acb2 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/index.html
@@ -1,2 +1,2 @@
 
-Solver_internal (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal)
Module S.Solver_internal
module T : sig ... end
module Lit : sig ... end
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type proof = proof
type proof_step = proof_step
module P : sig ... end
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
type lit = Lit.t
module CC : sig ... end
val cc : t -> CC.t
module Simplify : sig ... end
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
val simplify_t : t -> term -> (term * proof_step) option
val simp_t : t -> term -> term * proof_step option
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
val on_preprocess : t -> preprocess_hook -> unit
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
val push_decision : t -> theory_actions -> lit -> unit
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
val cc_find : t -> CC.N.t -> CC.N.t
val cc_are_equal : t -> term -> term -> bool
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
val cc_add_term : t -> term -> CC.N.t
val cc_mem_term : t -> term -> bool
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
val on_model_gen : t -> model_hook -> unit

\ No newline at end of file
+Solver_internal (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal)
Module S.Solver_internal
module T : sig ... end
module Lit : sig ... end
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type proof = proof
type proof_step = proof_step
module P : sig ... end
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
type lit = Lit.t
module CC : sig ... end
val cc : t -> CC.t
module Simplify : sig ... end
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
val simplify_t : t -> term -> (term * proof_step) option
val simp_t : t -> term -> term * proof_step option
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
val on_preprocess : t -> preprocess_hook -> unit
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
val push_decision : t -> theory_actions -> lit -> unit
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
val cc_find : t -> CC.N.t -> CC.N.t
val cc_are_equal : t -> term -> term -> bool
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
val cc_add_term : t -> term -> CC.N.t
val cc_mem_term : t -> term -> bool
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
val on_model_gen : t -> model_hook -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
index 168a197d..71e70854 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
@@ -1,2 +1,2 @@
 
-PREPROCESS_ACTS (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
val mk_lit : ?sign:bool -> term -> lit * proof_step option
val add_clause : lit list -> proof_step -> unit
val add_lit : ?default_pol:bool -> lit -> unit

\ No newline at end of file
+PREPROCESS_ACTS (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
val mk_lit : ?sign:bool -> term -> lit * proof_step option
val add_clause : lit list -> proof_step -> unit
val add_lit : ?default_pol:bool -> lit -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/T/Fun/index.html
index 16d21fba..8550d0eb 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_bool.A.S.T.Fun)
Module T.Fun
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_bool.A.S.T.Fun)
Module T.Fun
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/T/Term/Tbl/index.html
index 7a0b8806..a616624a 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_bool.A.S.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a Solver_arg.T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_bool.A.S.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a Solver_arg.T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/T/Term/index.html
index c73f39d9..29c94eb1 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_bool.A.S.T.Term)
Module T.Term
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_bool.A.S.T.Term)
Module T.Term
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/T/Ty/index.html
index 30f29087..817afcbb 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_bool.A.S.T.Ty)
Module T.Ty
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_bool.A.S.T.Ty)
Module T.Ty
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/T/index.html
index 22c64327..9264fdc0 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_bool.A.S.T)
Module S.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_bool.A.S.T)
Module S.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Unknown/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Unknown/index.html
index c5651118..c412325f 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Unknown/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/Unknown/index.html
@@ -1,2 +1,2 @@
 
-Unknown (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Unknown)
Module S.Unknown
val pp : t CCFormat.printer

\ No newline at end of file
+Unknown (sidekick-base.Sidekick_base_solver.Th_bool.A.S.Unknown)
Module S.Unknown
val pp : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/index.html
index 6edf03ab..578b4661 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/index.html
@@ -1,5 +1,5 @@
 
-S (sidekick-base.Sidekick_base_solver.Th_bool.A.S)
Module A.S
module T : sig ... end
module Lit : sig ... end
type proof = Solver_arg.proof
type proof_step = Solver_arg.proof_step
module P : sig ... end
module Solver_internal : sig ... end
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
type !'a theory_p = (module THEORY with type t = 'a)
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
+S (sidekick-base.Sidekick_base_solver.Th_bool.A.S)
Module A.S
module T : sig ... end
module Lit : sig ... end
type proof = Solver_arg.proof
type proof_step = Solver_arg.proof_step
module P : sig ... end
module Solver_internal : sig ... end
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
type !'a theory_p = (module THEORY with type t = 'a)
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
 ?push_level:('th -> unit) -> ?pop_levels:('th -> int -> unit) -> unit -> theory
module Model : sig ... end
module Unknown : sig ... end
val stats : t -> Sidekick_util.Stat.t
val tst : t -> T.Term.store
val ty_st : t -> T.Ty.store
val proof : t -> proof
val create : ?stat:Sidekick_util.Stat.t -> ?size:[ `Big | `Small | `Tiny ] -> proof:proof -> theories:theory list ->
 T.Term.store -> T.Ty.store -> unit -> t
val add_theory : t -> theory -> unit
val add_theory_p : t -> 'a theory_p -> 'a
val add_theory_l : t -> theory list -> unit
val mk_lit_t : t -> ?sign:bool -> term -> lit
val add_clause : t -> lit Sidekick_util.IArray.t -> proof_step -> unit
val add_clause_l : t -> lit list -> proof_step -> unit
val assert_terms : t -> term list -> unit
val assert_term : t -> term -> unit
type res = Sidekick_smt_solver.Make(Solver_arg).res = 
| Sat of Model.t
| Unsat of {
unsat_core : unit -> lit Iter.t;
unsat_proof_step : unit -> proof_step option;
}
| Unknown of Unknown.t
val solve : ?on_exit:(unit -> unit) list -> ?check:bool -> ?on_progress:(t -> unit) ->
 assumptions:lit list -> t -> res
val pp_stats : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/module-type-THEORY/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/module-type-THEORY/index.html
index a164b7c7..ee0ed50e 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/module-type-THEORY/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/S/module-type-THEORY/index.html
@@ -1,2 +1,2 @@
 
-THEORY (sidekick-base.Sidekick_base_solver.Th_bool.A.S.THEORY)
Module type S.THEORY
type t
val name : string
val create_and_setup : Solver_internal.t -> t
val push_level : t -> unit
val pop_levels : t -> int -> unit

\ No newline at end of file
+THEORY (sidekick-base.Sidekick_base_solver.Th_bool.A.S.THEORY)
Module type S.THEORY
type t
val name : string
val create_and_setup : Solver_internal.t -> t
val push_level : t -> unit
val pop_levels : t -> int -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/index.html
index 3c5b258d..da6e33f7 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/A/index.html
@@ -1,2 +1,2 @@
 
-A (sidekick-base.Sidekick_base_solver.Th_bool.A)
Module Th_bool.A
module S : sig ... end
type term = S.T.Term.t
val view_as_bool : term -> (term, term Iter.t) Sidekick_th_bool_static.bool_view
val check_congruence_classes : bool
val lemma_bool_tauto : S.Lit.t Iter.t -> S.P.t -> S.P.proof_step
val lemma_bool_c : string -> S.T.Term.t list -> S.P.t -> S.P.proof_step
val lemma_bool_equiv : S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
val lemma_ite_true : ite:S.T.Term.t -> S.P.t -> S.P.proof_step
val lemma_ite_false : ite:S.T.Term.t -> S.P.t -> S.P.proof_step
module Gensym : sig ... end

\ No newline at end of file
+A (sidekick-base.Sidekick_base_solver.Th_bool.A)
Module Th_bool.A
module S : sig ... end
type term = S.T.Term.t
val view_as_bool : term -> (term, term Iter.t) Sidekick_th_bool_static.bool_view
val check_congruence_classes : bool
val lemma_bool_tauto : S.Lit.t Iter.t -> S.P.t -> S.P.proof_step
val lemma_bool_c : string -> S.T.Term.t list -> S.P.t -> S.P.proof_step
val lemma_bool_equiv : S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
val lemma_ite_true : ite:S.T.Term.t -> S.P.t -> S.P.proof_step
val lemma_ite_false : ite:S.T.Term.t -> S.P.t -> S.P.proof_step
module Gensym : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_bool/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_bool/index.html
index b0dbc564..d816310c 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_bool/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_bool/index.html
@@ -1,2 +1,2 @@
 
-Th_bool (sidekick-base.Sidekick_base_solver.Th_bool)
Module Sidekick_base_solver.Th_bool
Reducing boolean formulas to clauses
module A : sig ... end
type state
val theory : A.S.theory

\ No newline at end of file
+Th_bool (sidekick-base.Sidekick_base_solver.Th_bool)
Module Sidekick_base_solver.Th_bool
Reducing boolean formulas to clauses
module A : sig ... end
type state
val theory : A.S.theory

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/Cstor/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/Cstor/index.html
index 14f53bdf..f8ecd852 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/Cstor/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/Cstor/index.html
@@ -1,2 +1,2 @@
 
-Cstor (sidekick-base.Sidekick_base_solver.Th_data.A.Cstor)
Module A.Cstor
type t
val ty_args : t -> S.T.Ty.t Iter.t
val pp : t Sidekick_util.Fmt.printer
val equal : t -> t -> bool

\ No newline at end of file
+Cstor (sidekick-base.Sidekick_base_solver.Th_data.A.Cstor)
Module A.Cstor
type t
val ty_args : t -> S.T.Ty.t Iter.t
val pp : t Sidekick_util.Fmt.printer
val equal : t -> t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/T/Fun/index.html
index 799860ee..46d957ec 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_data.A.S.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_data.A.S.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/T/Term/Tbl/index.html
index d09873dc..4693a0c8 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_data.A.S.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_data.A.S.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/T/Term/index.html
index 97f0f30f..0ac549d1 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_data.A.S.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_data.A.S.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/T/Ty/index.html
index 54275814..72341aae 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_data.A.S.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_data.A.S.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/T/index.html
index a0c9599a..1517ec41 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_data.A.S.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_data.A.S.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/index.html
index 078fa8bd..0fd04ea6 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick-base.Sidekick_base_solver.Th_data.A.S.Lit)
Module S.Lit
module T : sig ... end
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick-base.Sidekick_base_solver.Th_data.A.S.Lit)
Module S.Lit
module T : sig ... end
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Model/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Model/index.html
index 4be91035..f5bf6e4f 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Model/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Model/index.html
@@ -1,2 +1,2 @@
 
-Model (sidekick-base.Sidekick_base_solver.Th_data.A.S.Model)
Module S.Model
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Model (sidekick-base.Sidekick_base_solver.Th_data.A.S.Model)
Module S.Model
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/P/Step_vec/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/P/Step_vec/index.html
index 4348d62b..18c1a79e 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/P/Step_vec/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick-base.Sidekick_base_solver.Th_data.A.S.P.Step_vec)
Module P.Step_vec
type elt = proof_step
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick-base.Sidekick_base_solver.Th_data.A.S.P.Step_vec)
Module P.Step_vec
type elt = proof_step
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/P/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/P/index.html
index c1746718..35ab8e16 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/P/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick-base.Sidekick_base_solver.Th_data.A.S.P)
Module S.P
type t = proof
type proof_step = proof_step
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
module Step_vec : sig ... end
val enabled : t -> bool
val emit_input_clause : lit Iter.t -> proof_rule
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
val emit_unsat_core : lit Iter.t -> proof_rule
val emit_unsat : proof_step -> t -> unit
val del_clause : proof_step -> lit Iter.t -> t -> unit
val define_term : term -> term -> proof_rule
val proof_p1 : proof_step -> proof_step -> proof_rule
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
val lemma_true : term -> proof_rule
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule

\ No newline at end of file
+P (sidekick-base.Sidekick_base_solver.Th_data.A.S.P)
Module S.P
type t = proof
type proof_step = proof_step
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
module Step_vec : sig ... end
val enabled : t -> bool
val emit_input_clause : lit Iter.t -> proof_rule
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
val emit_unsat_core : lit Iter.t -> proof_rule
val emit_unsat : proof_step -> t -> unit
val del_clause : proof_step -> lit Iter.t -> t -> unit
val define_term : term -> term -> proof_rule
val proof_p1 : proof_step -> proof_step -> proof_rule
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
val lemma_true : term -> proof_rule
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/T/Fun/index.html
index 41f7453c..125bf823 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/T/Term/Tbl/index.html
index 94bf5f8b..75e5b032 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/T/Term/index.html
index 76b889a1..15082331 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/T/Ty/index.html
index c18fdd45..47159918 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/T/index.html
index b40c2784..45959169 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/index.html
index 5f14339f..6b8aaa31 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.Lit)
Module Actions.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.Lit)
Module Actions.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/P/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/P/index.html
index ced271a6..c84c34ae 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/P/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step

\ No newline at end of file
+P (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/T/Fun/index.html
index d4f7a0b3..afc863ed 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/T/Term/Tbl/index.html
index 1383d0cb..6d331f27 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/T/Term/index.html
index 63349c5a..35b9c587 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/T/Ty/index.html
index ef87e3f4..775b3ee0 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/T/index.html
index 5461d878..7b92d777 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.T)
Module Actions.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions.T)
Module Actions.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/index.html
index 79862804..447569aa 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions)
Module CC.Actions
module T : sig ... end
module Lit : sig ... end
type proof = proof
type proof_step = proof_step
module P : sig ... end
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit

\ No newline at end of file
+Actions (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Actions)
Module CC.Actions
module T : sig ... end
module Lit : sig ... end
type proof = proof
type proof_step = proof_step
module P : sig ... end
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Debug_/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Debug_/index.html
index 88cabb29..43198348 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Debug_/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Debug_/index.html
@@ -1,2 +1,2 @@
 
-Debug_ (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Debug_)
Module CC.Debug_
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Debug_ (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Debug_)
Module CC.Debug_
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Expl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Expl/index.html
index f1af4f07..575eca86 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Expl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Expl)
Module CC.Expl
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Expl)
Module CC.Expl
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/T/Fun/index.html
index 2af79e5b..034b7ede 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/T/Term/Tbl/index.html
index c3f2eef6..dc57e327 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/T/Term/index.html
index 90104a61..336f7e9e 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/T/Ty/index.html
index 55551028..8c637817 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/T/index.html
index a4bc0c17..09748db0 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/index.html
index 006e64b8..339afc60 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Lit)
Module CC.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.Lit)
Module CC.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/N/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/N/index.html
index a383b5a1..a27d09d1 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/N/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.N)
Module CC.N
val term : t -> term
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val is_root : t -> bool
val iter_class : t -> t Iter.t
val iter_parents : t -> t Iter.t

\ No newline at end of file
+N (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.N)
Module CC.N
val term : t -> term
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val is_root : t -> bool
val iter_class : t -> t Iter.t
val iter_parents : t -> t Iter.t

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/P/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/P/index.html
index 16d52347..51c5da69 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/P/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step

\ No newline at end of file
+P (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/T/Fun/index.html
index 919514f9..003dd9bc 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/T/Term/Tbl/index.html
index 2b5bb184..e1e50cf0 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/T/Term/index.html
index 321bea8e..41f67652 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/T/Ty/index.html
index fcae5344..fa6fe6b6 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/T/index.html
index 79af0fe9..42641828 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.T)
Module CC.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC.T)
Module CC.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/index.html
index 7bab601c..aafba962 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/CC/index.html
@@ -1,4 +1,4 @@
 
-CC (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC)
Module Solver_internal.CC
module T : sig ... end
module Lit : sig ... end
type proof = proof
type proof_step = proof_step
module P : sig ... end
module Actions : sig ... end
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
module N : sig ... end
module Expl : sig ... end
type node = N.t
type repr = N.t
type explanation = Expl.t
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
val add_term : t -> term -> node
val mem_term : t -> term -> bool
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
type ev_on_new_term = t -> N.t -> term -> unit
type ev_on_conflict = t -> th:bool -> lit list -> unit
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
type ev_on_is_subterm = N.t -> term -> unit
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+CC (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.CC)
Module Solver_internal.CC
module T : sig ... end
module Lit : sig ... end
type proof = proof
type proof_step = proof_step
module P : sig ... end
module Actions : sig ... end
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
module N : sig ... end
module Expl : sig ... end
type node = N.t
type repr = N.t
type explanation = Expl.t
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
val add_term : t -> term -> node
val mem_term : t -> term -> bool
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
type ev_on_new_term = t -> N.t -> term -> unit
type ev_on_conflict = t -> th:bool -> lit list -> unit
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
type ev_on_is_subterm = N.t -> term -> unit
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Big | `Small ] -> term_store -> proof -> t
val allocate_bitfield : descr:string -> t -> N.bitfield
val get_bitfield : t -> N.bitfield -> N.t -> bool
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
val on_pre_merge : t -> ev_on_pre_merge -> unit
val on_post_merge : t -> ev_on_post_merge -> unit
val on_new_term : t -> ev_on_new_term -> unit
val on_conflict : t -> ev_on_conflict -> unit
val on_propagate : t -> ev_on_propagate -> unit
val on_is_subterm : t -> ev_on_is_subterm -> unit
val set_as_lit : t -> N.t -> lit -> unit
val find_t : t -> term -> repr
val add_seq : t -> term Iter.t -> unit
val all_classes : t -> repr Iter.t
val assert_lit : t -> lit -> unit
val assert_lits : t -> lit Iter.t -> unit
val explain_eq : t -> N.t -> N.t -> lit list
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
val n_true : t -> N.t
val n_false : t -> N.t
val n_bool : t -> bool -> N.t
val merge : t -> N.t -> N.t -> Expl.t -> unit
val merge_t : t -> term -> term -> Expl.t -> unit
val check : t -> actions -> unit
val new_merges : t -> bool
val push_level : t -> unit
val pop_levels : t -> int -> unit
val get_model : t -> N.t Iter.t Iter.t
module Debug_ : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/T/Fun/index.html
index 4e9ec7d8..788e193f 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/T/Term/Tbl/index.html
index c0b46b1b..61291e09 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/T/Term/index.html
index 451d976c..fc2f6647 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/T/Ty/index.html
index 83a67569..431fa494 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/T/index.html
index cb926778..f74bb27d 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/index.html
index 01b7471a..301ee08e 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.Lit)
Module Solver_internal.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.Lit)
Module Solver_internal.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/P/Step_vec/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/P/Step_vec/index.html
index 23021802..7639c680 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/P/Step_vec/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.P.Step_vec)
Module P.Step_vec
type elt = proof_step
type t = P.Step_vec.t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.P.Step_vec)
Module P.Step_vec
type elt = proof_step
type t = P.Step_vec.t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/P/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/P/index.html
index 321919ff..a49aa677 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/P/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.P)
Module Solver_internal.P
type t = proof
type proof_step = proof_step
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
module Step_vec : sig ... end
val enabled : t -> bool
val emit_input_clause : lit Iter.t -> proof_rule
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
val emit_unsat_core : lit Iter.t -> proof_rule
val emit_unsat : proof_step -> t -> unit
val del_clause : proof_step -> lit Iter.t -> t -> unit
val define_term : term -> term -> proof_rule
val proof_p1 : proof_step -> proof_step -> proof_rule
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
val lemma_true : term -> proof_rule
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule

\ No newline at end of file
+P (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.P)
Module Solver_internal.P
type t = proof
type proof_step = proof_step
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
module Step_vec : sig ... end
val enabled : t -> bool
val emit_input_clause : lit Iter.t -> proof_rule
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
val emit_unsat_core : lit Iter.t -> proof_rule
val emit_unsat : proof_step -> t -> unit
val del_clause : proof_step -> lit Iter.t -> t -> unit
val define_term : term -> term -> proof_rule
val proof_p1 : proof_step -> proof_step -> proof_rule
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
val lemma_true : term -> proof_rule
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Simplify/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Simplify/index.html
index 9492f8d0..90efd7b0 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Simplify/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/Simplify/index.html
@@ -1,2 +1,2 @@
 
-Simplify (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
val proof : t -> proof
type hook = t -> term -> (term * proof_step Iter.t) option
val normalize : t -> term -> (term * proof_step) option
val normalize_t : t -> term -> term * proof_step option

\ No newline at end of file
+Simplify (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
val proof : t -> proof
type hook = t -> term -> (term * proof_step Iter.t) option
val normalize : t -> term -> (term * proof_step) option
val normalize_t : t -> term -> term * proof_step option

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/T/Fun/index.html
index 6252e833..520fb6dc 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/T/Term/Tbl/index.html
index 08e3a4fc..3439e995 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/T/Term/index.html
index 7330c4b8..939de19e 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/T/Ty/index.html
index 996fe817..a71ed7b5 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/T/index.html
index 9aff29fc..3d56e356 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.T)
Module Solver_internal.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.T)
Module Solver_internal.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/index.html
index 1836b249..aca21691 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/index.html
@@ -1,2 +1,2 @@
 
-Solver_internal (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal)
Module S.Solver_internal
module T : sig ... end
module Lit : sig ... end
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type proof = proof
type proof_step = proof_step
module P : sig ... end
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
type lit = Lit.t
module CC : sig ... end
val cc : t -> CC.t
module Simplify : sig ... end
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
val simplify_t : t -> term -> (term * proof_step) option
val simp_t : t -> term -> term * proof_step option
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
val on_preprocess : t -> preprocess_hook -> unit
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
val push_decision : t -> theory_actions -> lit -> unit
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
val cc_find : t -> CC.N.t -> CC.N.t
val cc_are_equal : t -> term -> term -> bool
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
val cc_add_term : t -> term -> CC.N.t
val cc_mem_term : t -> term -> bool
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
val on_model_gen : t -> model_hook -> unit

\ No newline at end of file
+Solver_internal (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal)
Module S.Solver_internal
module T : sig ... end
module Lit : sig ... end
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type proof = proof
type proof_step = proof_step
module P : sig ... end
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
type lit = Lit.t
module CC : sig ... end
val cc : t -> CC.t
module Simplify : sig ... end
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
val simplify_t : t -> term -> (term * proof_step) option
val simp_t : t -> term -> term * proof_step option
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
val on_preprocess : t -> preprocess_hook -> unit
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
val push_decision : t -> theory_actions -> lit -> unit
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
val cc_find : t -> CC.N.t -> CC.N.t
val cc_are_equal : t -> term -> term -> bool
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
val cc_add_term : t -> term -> CC.N.t
val cc_mem_term : t -> term -> bool
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
val on_model_gen : t -> model_hook -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
index efc81217..a566a14b 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
@@ -1,2 +1,2 @@
 
-PREPROCESS_ACTS (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
val mk_lit : ?sign:bool -> term -> lit * proof_step option
val add_clause : lit list -> proof_step -> unit
val add_lit : ?default_pol:bool -> lit -> unit

\ No newline at end of file
+PREPROCESS_ACTS (sidekick-base.Sidekick_base_solver.Th_data.A.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
val mk_lit : ?sign:bool -> term -> lit * proof_step option
val add_clause : lit list -> proof_step -> unit
val add_lit : ?default_pol:bool -> lit -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/T/Fun/index.html
index 7befabdf..5171a4ae 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_data.A.S.T.Fun)
Module T.Fun
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_data.A.S.T.Fun)
Module T.Fun
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/T/Term/Tbl/index.html
index ab7322b3..df054ff2 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_data.A.S.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a Solver_arg.T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_data.A.S.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a Solver_arg.T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/T/Term/index.html
index cdbf274c..f6c2da23 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_data.A.S.T.Term)
Module T.Term
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_data.A.S.T.Term)
Module T.Term
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/T/Ty/index.html
index be3a54f3..5e1e0b51 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_data.A.S.T.Ty)
Module T.Ty
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_data.A.S.T.Ty)
Module T.Ty
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/T/index.html
index 6a18c3a0..6af1c4ee 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_data.A.S.T)
Module S.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_data.A.S.T)
Module S.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Unknown/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Unknown/index.html
index 61022e4b..7f15379e 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Unknown/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/Unknown/index.html
@@ -1,2 +1,2 @@
 
-Unknown (sidekick-base.Sidekick_base_solver.Th_data.A.S.Unknown)
Module S.Unknown
val pp : t CCFormat.printer

\ No newline at end of file
+Unknown (sidekick-base.Sidekick_base_solver.Th_data.A.S.Unknown)
Module S.Unknown
val pp : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/index.html
index 85ca3a03..4287e604 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/index.html
@@ -1,5 +1,5 @@
 
-S (sidekick-base.Sidekick_base_solver.Th_data.A.S)
Module A.S
module T : sig ... end
module Lit : sig ... end
type proof = Solver_arg.proof
type proof_step = Solver_arg.proof_step
module P : sig ... end
module Solver_internal : sig ... end
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
type !'a theory_p = (module THEORY with type t = 'a)
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
+S (sidekick-base.Sidekick_base_solver.Th_data.A.S)
Module A.S
module T : sig ... end
module Lit : sig ... end
type proof = Solver_arg.proof
type proof_step = Solver_arg.proof_step
module P : sig ... end
module Solver_internal : sig ... end
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
type !'a theory_p = (module THEORY with type t = 'a)
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
 ?push_level:('th -> unit) -> ?pop_levels:('th -> int -> unit) -> unit -> theory
module Model : sig ... end
module Unknown : sig ... end
val stats : t -> Sidekick_util.Stat.t
val tst : t -> T.Term.store
val ty_st : t -> T.Ty.store
val proof : t -> proof
val create : ?stat:Sidekick_util.Stat.t -> ?size:[ `Big | `Small | `Tiny ] -> proof:proof -> theories:theory list ->
 T.Term.store -> T.Ty.store -> unit -> t
val add_theory : t -> theory -> unit
val add_theory_p : t -> 'a theory_p -> 'a
val add_theory_l : t -> theory list -> unit
val mk_lit_t : t -> ?sign:bool -> term -> lit
val add_clause : t -> lit Sidekick_util.IArray.t -> proof_step -> unit
val add_clause_l : t -> lit list -> proof_step -> unit
val assert_terms : t -> term list -> unit
val assert_term : t -> term -> unit
type res = Sidekick_smt_solver.Make(Solver_arg).res = 
| Sat of Model.t
| Unsat of {
unsat_core : unit -> lit Iter.t;
unsat_proof_step : unit -> proof_step option;
}
| Unknown of Unknown.t
val solve : ?on_exit:(unit -> unit) list -> ?check:bool -> ?on_progress:(t -> unit) ->
 assumptions:lit list -> t -> res
val pp_stats : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/module-type-THEORY/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/module-type-THEORY/index.html
index fa40d614..31a2f60c 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/module-type-THEORY/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/S/module-type-THEORY/index.html
@@ -1,2 +1,2 @@
 
-THEORY (sidekick-base.Sidekick_base_solver.Th_data.A.S.THEORY)
Module type S.THEORY
type t
val name : string
val create_and_setup : Solver_internal.t -> t
val push_level : t -> unit
val pop_levels : t -> int -> unit

\ No newline at end of file
+THEORY (sidekick-base.Sidekick_base_solver.Th_data.A.S.THEORY)
Module type S.THEORY
type t
val name : string
val create_and_setup : Solver_internal.t -> t
val push_level : t -> unit
val pop_levels : t -> int -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/index.html
index 108bab28..105f9164 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/A/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/A/index.html
@@ -1,2 +1,2 @@
 
-A (sidekick-base.Sidekick_base_solver.Th_data.A)
Module Th_data.A
module S : sig ... end
module Cstor : sig ... end
val as_datatype : S.T.Ty.t -> (Cstor.t Iter.t, S.T.Ty.t) Sidekick_th_data.data_ty_view
val mk_sel : S.T.Term.store -> Cstor.t -> int -> S.T.Term.t -> S.T.Term.t
val ty_is_finite : S.T.Ty.t -> bool
val ty_set_is_finite : S.T.Ty.t -> bool -> unit
val lemma_isa_cstor : cstor_t:S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
val lemma_select_cstor : cstor_t:S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
val lemma_isa_split : S.T.Term.t -> S.Lit.t Iter.t -> S.P.t -> S.P.proof_step
val lemma_isa_sel : S.T.Term.t -> S.P.t -> S.P.proof_step
val lemma_isa_disj : S.Lit.t -> S.Lit.t -> S.P.t -> S.P.proof_step
val lemma_cstor_inj : S.T.Term.t -> S.T.Term.t -> int -> S.P.t -> S.P.proof_step
val lemma_cstor_distinct : S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
val lemma_acyclicity : (S.T.Term.t * S.T.Term.t) Iter.t -> S.P.t -> S.P.proof_step

\ No newline at end of file
+A (sidekick-base.Sidekick_base_solver.Th_data.A)
Module Th_data.A
module S : sig ... end
module Cstor : sig ... end
val as_datatype : S.T.Ty.t -> (Cstor.t Iter.t, S.T.Ty.t) Sidekick_th_data.data_ty_view
val mk_sel : S.T.Term.store -> Cstor.t -> int -> S.T.Term.t -> S.T.Term.t
val ty_is_finite : S.T.Ty.t -> bool
val ty_set_is_finite : S.T.Ty.t -> bool -> unit
val lemma_isa_cstor : cstor_t:S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
val lemma_select_cstor : cstor_t:S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
val lemma_isa_split : S.T.Term.t -> S.Lit.t Iter.t -> S.P.t -> S.P.proof_step
val lemma_isa_sel : S.T.Term.t -> S.P.t -> S.P.proof_step
val lemma_isa_disj : S.Lit.t -> S.Lit.t -> S.P.t -> S.P.proof_step
val lemma_cstor_inj : S.T.Term.t -> S.T.Term.t -> int -> S.P.t -> S.P.proof_step
val lemma_cstor_distinct : S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
val lemma_acyclicity : (S.T.Term.t * S.T.Term.t) Iter.t -> S.P.t -> S.P.proof_step

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_data/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_data/index.html
index cad682f6..39846a19 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_data/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_data/index.html
@@ -1,2 +1,2 @@
 
-Th_data (sidekick-base.Sidekick_base_solver.Th_data)
Module Sidekick_base_solver.Th_data
Theory of datatypes
module A : sig ... end
val theory : A.S.theory

\ No newline at end of file
+Th_data (sidekick-base.Sidekick_base_solver.Th_data)
Module Sidekick_base_solver.Th_data
Theory of datatypes
module A : sig ... end
val theory : A.S.theory

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/Gensym/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/Gensym/index.html
index 467a26bf..04b3d14d 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/Gensym/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/Gensym/index.html
@@ -1,2 +1,2 @@
 
-Gensym (sidekick-base.Sidekick_base_solver.Th_lra.A.Gensym)
Module A.Gensym
type t
val create : S.T.Term.store -> t
val tst : t -> S.T.Term.store
val copy : t -> t
val fresh_term : t -> pre:string -> S.T.Ty.t -> term

\ No newline at end of file
+Gensym (sidekick-base.Sidekick_base_solver.Th_lra.A.Gensym)
Module A.Gensym
type t
val create : S.T.Term.store -> t
val tst : t -> S.T.Term.store
val copy : t -> t
val fresh_term : t -> pre:string -> S.T.Ty.t -> term

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/Q/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/Q/index.html
index 1aefa301..6a8ac36b 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/Q/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/Q/index.html
@@ -1,2 +1,2 @@
 
-Q (sidekick-base.Sidekick_base_solver.Th_lra.A.Q)
Module A.Q
type t = Q.t
val zero : t
val one : t
val minus_one : t
val sign : t -> int
val of_int : int -> t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t CCFormat.printer
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
val (~-) : t -> t
val neg : t -> t
val min : t -> t -> t
val max : t -> t -> t
val (=) : t -> t -> bool
val (<>) : t -> t -> bool
val (>) : t -> t -> bool
val (>=) : t -> t -> bool
val (<) : t -> t -> bool
val (<=) : t -> t -> bool
type bigint = Z.t
val (/) : t -> t -> t
val num : t -> bigint
val denum : t -> bigint
val pp_approx : int -> Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
+Q (sidekick-base.Sidekick_base_solver.Th_lra.A.Q)
Module A.Q
type t = Q.t
val zero : t
val one : t
val minus_one : t
val sign : t -> int
val of_int : int -> t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t CCFormat.printer
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
val (~-) : t -> t
val neg : t -> t
val min : t -> t -> t
val max : t -> t -> t
val (=) : t -> t -> bool
val (<>) : t -> t -> bool
val (>) : t -> t -> bool
val (>=) : t -> t -> bool
val (<) : t -> t -> bool
val (<=) : t -> t -> bool
type bigint = Z.t
val (/) : t -> t -> t
val num : t -> bigint
val denum : t -> bigint
val pp_approx : int -> Stdlib.Format.formatter -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/T/Fun/index.html
index 0e36d876..e28e2c2e 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/T/Term/Tbl/index.html
index ba2fbef3..9b087d9f 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/T/Term/index.html
index 73d89788..c5abfee8 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/T/Ty/index.html
index 23119005..1c845481 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/T/index.html
index 62f9a0ba..19f2c74c 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/index.html
index 4597af0f..906fb1c0 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Lit)
Module S.Lit
module T : sig ... end
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Lit)
Module S.Lit
module T : sig ... end
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Model/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Model/index.html
index cc2a4d5b..1d664bc9 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Model/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Model/index.html
@@ -1,2 +1,2 @@
 
-Model (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Model)
Module S.Model
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Model (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Model)
Module S.Model
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/P/Step_vec/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/P/Step_vec/index.html
index 3391d62a..647508a6 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/P/Step_vec/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick-base.Sidekick_base_solver.Th_lra.A.S.P.Step_vec)
Module P.Step_vec
type elt = proof_step
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick-base.Sidekick_base_solver.Th_lra.A.S.P.Step_vec)
Module P.Step_vec
type elt = proof_step
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/P/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/P/index.html
index 026d9158..4c9a2cf8 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/P/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick-base.Sidekick_base_solver.Th_lra.A.S.P)
Module S.P
type t = proof
type proof_step = proof_step
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
module Step_vec : sig ... end
val enabled : t -> bool
val emit_input_clause : lit Iter.t -> proof_rule
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
val emit_unsat_core : lit Iter.t -> proof_rule
val emit_unsat : proof_step -> t -> unit
val del_clause : proof_step -> lit Iter.t -> t -> unit
val define_term : term -> term -> proof_rule
val proof_p1 : proof_step -> proof_step -> proof_rule
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
val lemma_true : term -> proof_rule
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule

\ No newline at end of file
+P (sidekick-base.Sidekick_base_solver.Th_lra.A.S.P)
Module S.P
type t = proof
type proof_step = proof_step
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
module Step_vec : sig ... end
val enabled : t -> bool
val emit_input_clause : lit Iter.t -> proof_rule
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
val emit_unsat_core : lit Iter.t -> proof_rule
val emit_unsat : proof_step -> t -> unit
val del_clause : proof_step -> lit Iter.t -> t -> unit
val define_term : term -> term -> proof_rule
val proof_p1 : proof_step -> proof_step -> proof_rule
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
val lemma_true : term -> proof_rule
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/Fun/index.html
index 651a899a..3189723d 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/Term/Tbl/index.html
index 7c60a61b..9299a20f 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/Term/index.html
index b4a45af2..8eaaeea1 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/Ty/index.html
index fb0b1778..f21bae07 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/index.html
index 1da7789c..705e9c0d 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/index.html
index 6997c931..517e4179 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.Lit)
Module Actions.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.Lit)
Module Actions.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/P/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/P/index.html
index 31c13c46..fca2092b 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/P/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step

\ No newline at end of file
+P (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/T/Fun/index.html
index ad3aa72f..dfa9af77 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/T/Term/Tbl/index.html
index ac87ac39..c142da88 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/T/Term/index.html
index 4c876fe8..60b2d915 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/T/Ty/index.html
index e575d17e..26ef7ff4 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/T/index.html
index 8cf44686..182dac8c 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.T)
Module Actions.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions.T)
Module Actions.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/index.html
index 71b20440..648cc121 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions)
Module CC.Actions
module T : sig ... end
module Lit : sig ... end
type proof = proof
type proof_step = proof_step
module P : sig ... end
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit

\ No newline at end of file
+Actions (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Actions)
Module CC.Actions
module T : sig ... end
module Lit : sig ... end
type proof = proof
type proof_step = proof_step
module P : sig ... end
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Debug_/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Debug_/index.html
index 1693aafa..d9f96226 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Debug_/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Debug_/index.html
@@ -1,2 +1,2 @@
 
-Debug_ (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Debug_)
Module CC.Debug_
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Debug_ (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Debug_)
Module CC.Debug_
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Expl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Expl/index.html
index f1f05b84..66eea4d3 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Expl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Expl)
Module CC.Expl
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Expl)
Module CC.Expl
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/T/Fun/index.html
index fd00eadf..13a26362 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/T/Term/Tbl/index.html
index 4ed81d5a..e3d6caf3 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/T/Term/index.html
index 36bc1b45..9e1bacd4 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/T/Ty/index.html
index f855ffcf..a8edf5d5 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/T/index.html
index 10fa8960..4a5445e4 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/index.html
index 21434f64..f1a606c0 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Lit)
Module CC.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.Lit)
Module CC.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/N/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/N/index.html
index de27c085..c99eb31e 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/N/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.N)
Module CC.N
val term : t -> term
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val is_root : t -> bool
val iter_class : t -> t Iter.t
val iter_parents : t -> t Iter.t

\ No newline at end of file
+N (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.N)
Module CC.N
val term : t -> term
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val is_root : t -> bool
val iter_class : t -> t Iter.t
val iter_parents : t -> t Iter.t

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/P/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/P/index.html
index 299f0380..63bdff32 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/P/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step

\ No newline at end of file
+P (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/T/Fun/index.html
index 3147bbc8..824db12c 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/T/Term/Tbl/index.html
index cabacf63..775786ce 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/T/Term/index.html
index c0ff2fb0..7b28775c 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/T/Ty/index.html
index b053f79d..a0e8e785 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/T/index.html
index 18c7d6bc..28ec2367 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.T)
Module CC.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC.T)
Module CC.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/index.html
index c5c1ddb4..13778819 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/CC/index.html
@@ -1,4 +1,4 @@
 
-CC (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC)
Module Solver_internal.CC
module T : sig ... end
module Lit : sig ... end
type proof = proof
type proof_step = proof_step
module P : sig ... end
module Actions : sig ... end
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
module N : sig ... end
module Expl : sig ... end
type node = N.t
type repr = N.t
type explanation = Expl.t
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
val add_term : t -> term -> node
val mem_term : t -> term -> bool
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
type ev_on_new_term = t -> N.t -> term -> unit
type ev_on_conflict = t -> th:bool -> lit list -> unit
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
type ev_on_is_subterm = N.t -> term -> unit
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+CC (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.CC)
Module Solver_internal.CC
module T : sig ... end
module Lit : sig ... end
type proof = proof
type proof_step = proof_step
module P : sig ... end
module Actions : sig ... end
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
module N : sig ... end
module Expl : sig ... end
type node = N.t
type repr = N.t
type explanation = Expl.t
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
val add_term : t -> term -> node
val mem_term : t -> term -> bool
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
type ev_on_new_term = t -> N.t -> term -> unit
type ev_on_conflict = t -> th:bool -> lit list -> unit
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
type ev_on_is_subterm = N.t -> term -> unit
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Big | `Small ] -> term_store -> proof -> t
val allocate_bitfield : descr:string -> t -> N.bitfield
val get_bitfield : t -> N.bitfield -> N.t -> bool
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
val on_pre_merge : t -> ev_on_pre_merge -> unit
val on_post_merge : t -> ev_on_post_merge -> unit
val on_new_term : t -> ev_on_new_term -> unit
val on_conflict : t -> ev_on_conflict -> unit
val on_propagate : t -> ev_on_propagate -> unit
val on_is_subterm : t -> ev_on_is_subterm -> unit
val set_as_lit : t -> N.t -> lit -> unit
val find_t : t -> term -> repr
val add_seq : t -> term Iter.t -> unit
val all_classes : t -> repr Iter.t
val assert_lit : t -> lit -> unit
val assert_lits : t -> lit Iter.t -> unit
val explain_eq : t -> N.t -> N.t -> lit list
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
val n_true : t -> N.t
val n_false : t -> N.t
val n_bool : t -> bool -> N.t
val merge : t -> N.t -> N.t -> Expl.t -> unit
val merge_t : t -> term -> term -> Expl.t -> unit
val check : t -> actions -> unit
val new_merges : t -> bool
val push_level : t -> unit
val pop_levels : t -> int -> unit
val get_model : t -> N.t Iter.t Iter.t
module Debug_ : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/T/Fun/index.html
index 85cf0d40..9b768384 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.Lit.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/T/Term/Tbl/index.html
index 3615aad3..ea8c65c4 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.Lit.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/T/Term/index.html
index ef804702..8b65322d 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.Lit.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/T/Ty/index.html
index a76e3d76..66b70b6a 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.Lit.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/T/index.html
index 9affd9de..be4bb026 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.Lit.T)
Module Lit.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/index.html
index 0086515f..f7fe68f5 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.Lit)
Module Solver_internal.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.Lit)
Module Solver_internal.Lit
module T : sig ... end
type t = Lit.t
val term : t -> T.Term.t
val sign : t -> bool
val neg : t -> t
val abs : t -> t
val signed_term : t -> T.Term.t * bool
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
val norm_sign : t -> t * bool
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/P/Step_vec/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/P/Step_vec/index.html
index 409d6608..d09b38c8 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/P/Step_vec/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.P.Step_vec)
Module P.Step_vec
type elt = proof_step
type t = P.Step_vec.t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.P.Step_vec)
Module P.Step_vec
type elt = proof_step
type t = P.Step_vec.t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/P/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/P/index.html
index 5a32235d..dd6bd31f 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/P/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.P)
Module Solver_internal.P
type t = proof
type proof_step = proof_step
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
module Step_vec : sig ... end
val enabled : t -> bool
val emit_input_clause : lit Iter.t -> proof_rule
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
val emit_unsat_core : lit Iter.t -> proof_rule
val emit_unsat : proof_step -> t -> unit
val del_clause : proof_step -> lit Iter.t -> t -> unit
val define_term : term -> term -> proof_rule
val proof_p1 : proof_step -> proof_step -> proof_rule
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
val lemma_true : term -> proof_rule
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule

\ No newline at end of file
+P (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.P)
Module Solver_internal.P
type t = proof
type proof_step = proof_step
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
module Step_vec : sig ... end
val enabled : t -> bool
val emit_input_clause : lit Iter.t -> proof_rule
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
val emit_unsat_core : lit Iter.t -> proof_rule
val emit_unsat : proof_step -> t -> unit
val del_clause : proof_step -> lit Iter.t -> t -> unit
val define_term : term -> term -> proof_rule
val proof_p1 : proof_step -> proof_step -> proof_rule
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
val lemma_true : term -> proof_rule
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Simplify/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Simplify/index.html
index 99a8c13a..d9401f91 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Simplify/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/Simplify/index.html
@@ -1,2 +1,2 @@
 
-Simplify (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
val proof : t -> proof
type hook = t -> term -> (term * proof_step Iter.t) option
val normalize : t -> term -> (term * proof_step) option
val normalize_t : t -> term -> term * proof_step option

\ No newline at end of file
+Simplify (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
val proof : t -> proof
type hook = t -> term -> (term * proof_step Iter.t) option
val normalize : t -> term -> (term * proof_step) option
val normalize_t : t -> term -> term * proof_step option

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/T/Fun/index.html
index f712f19c..509886ee 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.T.Fun)
Module T.Fun
type t = T.Fun.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/T/Term/Tbl/index.html
index 51e1e7f4..37eb71e8 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/T/Term/index.html
index 86619d41..178056b7 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.T.Term)
Module T.Term
type t = T.Term.t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Term.store
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/T/Ty/index.html
index 5c4096a3..0ae3599c 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.T.Ty)
Module T.Ty
type t = T.Ty.t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store = T.Ty.store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/T/index.html
index 3ad98cf2..4d4c59a7 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.T)
Module Solver_internal.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.T)
Module Solver_internal.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/index.html
index 7bd42ce9..da59d99f 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/index.html
@@ -1,2 +1,2 @@
 
-Solver_internal (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal)
Module S.Solver_internal
module T : sig ... end
module Lit : sig ... end
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type proof = proof
type proof_step = proof_step
module P : sig ... end
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
type lit = Lit.t
module CC : sig ... end
val cc : t -> CC.t
module Simplify : sig ... end
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
val simplify_t : t -> term -> (term * proof_step) option
val simp_t : t -> term -> term * proof_step option
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
val on_preprocess : t -> preprocess_hook -> unit
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
val push_decision : t -> theory_actions -> lit -> unit
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
val cc_find : t -> CC.N.t -> CC.N.t
val cc_are_equal : t -> term -> term -> bool
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
val cc_add_term : t -> term -> CC.N.t
val cc_mem_term : t -> term -> bool
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
val on_model_gen : t -> model_hook -> unit

\ No newline at end of file
+Solver_internal (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal)
Module S.Solver_internal
module T : sig ... end
module Lit : sig ... end
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type proof = proof
type proof_step = proof_step
module P : sig ... end
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
type lit = Lit.t
module CC : sig ... end
val cc : t -> CC.t
module Simplify : sig ... end
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
val simplify_t : t -> term -> (term * proof_step) option
val simp_t : t -> term -> term * proof_step option
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
val on_preprocess : t -> preprocess_hook -> unit
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
val push_decision : t -> theory_actions -> lit -> unit
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
val cc_find : t -> CC.N.t -> CC.N.t
val cc_are_equal : t -> term -> term -> bool
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
val cc_add_term : t -> term -> CC.N.t
val cc_mem_term : t -> term -> bool
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
val on_model_gen : t -> model_hook -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
index 83b323d1..c17bd50a 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
@@ -1,2 +1,2 @@
 
-PREPROCESS_ACTS (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
val mk_lit : ?sign:bool -> term -> lit * proof_step option
val add_clause : lit list -> proof_step -> unit
val add_lit : ?default_pol:bool -> lit -> unit

\ No newline at end of file
+PREPROCESS_ACTS (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
val mk_lit : ?sign:bool -> term -> lit * proof_step option
val add_clause : lit list -> proof_step -> unit
val add_lit : ?default_pol:bool -> lit -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/T/Fun/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/T/Fun/index.html
index ffa425ea..09ae2e92 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/T/Fun/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-base.Sidekick_base_solver.Th_lra.A.S.T.Fun)
Module T.Fun
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-base.Sidekick_base_solver.Th_lra.A.S.T.Fun)
Module T.Fun
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/T/Term/Tbl/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/T/Term/Tbl/index.html
index 1b3eefbc..71482a0c 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/T/Term/Tbl/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/T/Term/Tbl/index.html
@@ -1,4 +1,4 @@
 
-Tbl (sidekick-base.Sidekick_base_solver.Th_lra.A.S.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a Solver_arg.T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
+Tbl (sidekick-base.Sidekick_base_solver.Th_lra.A.S.T.Term.Tbl)
Module Term.Tbl
type key = t
type !'a t = 'a Solver_arg.T.Term.Tbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_opt : 'a t -> key -> 'a option
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Stdlib.Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
val to_seq_keys : 'a t -> key Stdlib.Seq.t
val to_seq_values : 'a t -> 'a Stdlib.Seq.t
val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val get : 'a t -> key -> 'a option
val get_or : 'a t -> key -> default:'a -> 'a
val add_list : 'a list t -> key -> 'a -> unit
val incr : ?by:int -> int t -> key -> unit
val decr : ?by:int -> int t -> key -> unit
val keys : 'a t -> key CCHashtbl.iter
val values : 'a t -> 'a CCHashtbl.iter
val keys_list : 'a t -> key list
val values_list : 'a t -> 'a list
val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list
val to_iter : 'a t -> (key * 'a) CCHashtbl.iter
val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit
val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Stdlib.Seq.t -> unit
val of_iter : (key * 'a) CCHashtbl.iter -> 'a t
val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Stdlib.Seq.t -> 'a t
val add_iter_count : int t -> key CCHashtbl.iter -> unit
val add_seq_count : int t -> key Stdlib.Seq.t -> unit
val of_iter_count : key CCHashtbl.iter -> int t
val of_seq_count : key Stdlib.Seq.t -> int t
val to_list : 'a t -> (key * 'a) list
val of_list : (key * 'a) list -> 'a t
val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t
val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit
val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a
val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer ->
 ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer ->
 key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/T/Term/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/T/Term/index.html
index d8ac86e8..fe998d07 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/T/Term/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/T/Term/index.html
@@ -1,2 +1,2 @@
 
-Term (sidekick-base.Sidekick_base_solver.Th_lra.A.S.T.Term)
Module T.Term
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
+Term (sidekick-base.Sidekick_base_solver.Th_lra.A.S.T.Term)
Module T.Term
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val ty : t -> Ty.t
val bool : store -> bool -> t
val as_bool : t -> bool option
val abs : store -> t -> t * bool
val map_shallow : store -> (t -> t) -> t -> t
val iter_dag : t -> (t -> unit) -> unit
module Tbl : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/T/Ty/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/T/Ty/index.html
index c9c57721..c91b2f40 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/T/Ty/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-base.Sidekick_base_solver.Th_lra.A.S.T.Ty)
Module T.Ty
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-base.Sidekick_base_solver.Th_lra.A.S.T.Ty)
Module T.Ty
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/T/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/T/index.html
index 067caab2..ae1da364 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/T/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-base.Sidekick_base_solver.Th_lra.A.S.T)
Module S.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
+T (sidekick-base.Sidekick_base_solver.Th_lra.A.S.T)
Module S.T
module Fun : sig ... end
module Ty : sig ... end
module Term : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Unknown/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Unknown/index.html
index 453317db..a12756f7 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Unknown/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/Unknown/index.html
@@ -1,2 +1,2 @@
 
-Unknown (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Unknown)
Module S.Unknown
val pp : t CCFormat.printer

\ No newline at end of file
+Unknown (sidekick-base.Sidekick_base_solver.Th_lra.A.S.Unknown)
Module S.Unknown
val pp : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/index.html
index 7625c6c5..611e7c17 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/index.html
@@ -1,5 +1,5 @@
 
-S (sidekick-base.Sidekick_base_solver.Th_lra.A.S)
Module A.S
module T : sig ... end
module Lit : sig ... end
type proof = Solver_arg.proof
type proof_step = Solver_arg.proof_step
module P : sig ... end
module Solver_internal : sig ... end
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
type !'a theory_p = (module THEORY with type t = 'a)
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
+S (sidekick-base.Sidekick_base_solver.Th_lra.A.S)
Module A.S
module T : sig ... end
module Lit : sig ... end
type proof = Solver_arg.proof
type proof_step = Solver_arg.proof_step
module P : sig ... end
module Solver_internal : sig ... end
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
type !'a theory_p = (module THEORY with type t = 'a)
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
 ?push_level:('th -> unit) -> ?pop_levels:('th -> int -> unit) -> unit -> theory
module Model : sig ... end
module Unknown : sig ... end
val stats : t -> Sidekick_util.Stat.t
val tst : t -> T.Term.store
val ty_st : t -> T.Ty.store
val proof : t -> proof
val create : ?stat:Sidekick_util.Stat.t -> ?size:[ `Big | `Small | `Tiny ] -> proof:proof -> theories:theory list ->
 T.Term.store -> T.Ty.store -> unit -> t
val add_theory : t -> theory -> unit
val add_theory_p : t -> 'a theory_p -> 'a
val add_theory_l : t -> theory list -> unit
val mk_lit_t : t -> ?sign:bool -> term -> lit
val add_clause : t -> lit Sidekick_util.IArray.t -> proof_step -> unit
val add_clause_l : t -> lit list -> proof_step -> unit
val assert_terms : t -> term list -> unit
val assert_term : t -> term -> unit
type res = Sidekick_smt_solver.Make(Solver_arg).res = 
| Sat of Model.t
| Unsat of {
unsat_core : unit -> lit Iter.t;
unsat_proof_step : unit -> proof_step option;
}
| Unknown of Unknown.t
val solve : ?on_exit:(unit -> unit) list -> ?check:bool -> ?on_progress:(t -> unit) ->
 assumptions:lit list -> t -> res
val pp_stats : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/module-type-THEORY/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/module-type-THEORY/index.html
index 3a4dfdb6..ff1e3f0e 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/module-type-THEORY/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/S/module-type-THEORY/index.html
@@ -1,2 +1,2 @@
 
-THEORY (sidekick-base.Sidekick_base_solver.Th_lra.A.S.THEORY)
Module type S.THEORY
type t
val name : string
val create_and_setup : Solver_internal.t -> t
val push_level : t -> unit
val pop_levels : t -> int -> unit

\ No newline at end of file
+THEORY (sidekick-base.Sidekick_base_solver.Th_lra.A.S.THEORY)
Module type S.THEORY
type t
val name : string
val create_and_setup : Solver_internal.t -> t
val push_level : t -> unit
val pop_levels : t -> int -> unit

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/index.html
index 8f8e71ba..1005957c 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/A/index.html
@@ -1,2 +1,2 @@
 
-A (sidekick-base.Sidekick_base_solver.Th_lra.A)
Module Th_lra.A
module S : sig ... end
module Q : sig ... end
type term = S.T.Term.t
type ty = S.T.Ty.t
val view_as_lra : term -> (Q.t, term) Sidekick_arith_lra.lra_view
val mk_bool : S.T.Term.store -> bool -> term
val ty_lra : S.T.Term.store -> ty
val mk_eq : S.T.Term.store -> term -> term -> term
val has_ty_real : term -> bool
val lemma_lra : S.Lit.t Iter.t -> S.P.proof_rule
module Gensym : sig ... end

\ No newline at end of file
+A (sidekick-base.Sidekick_base_solver.Th_lra.A)
Module Th_lra.A
module S : sig ... end
module Q : sig ... end
type term = S.T.Term.t
type ty = S.T.Ty.t
val view_as_lra : term -> (Q.t, term) Sidekick_arith_lra.lra_view
val mk_bool : S.T.Term.store -> bool -> term
val ty_lra : S.T.Term.store -> ty
val mk_eq : S.T.Term.store -> term -> term -> term
val has_ty_real : term -> bool
val lemma_lra : S.Lit.t Iter.t -> S.P.proof_rule
module Gensym : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/Th_lra/index.html b/dev/sidekick-base/Sidekick_base_solver/Th_lra/index.html
index d0def515..e9074b80 100644
--- a/dev/sidekick-base/Sidekick_base_solver/Th_lra/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/Th_lra/index.html
@@ -1,2 +1,2 @@
 
-Th_lra (sidekick-base.Sidekick_base_solver.Th_lra)
Module Sidekick_base_solver.Th_lra
Theory of Linear Rational Arithmetic
module A : sig ... end
type state
val theory : A.S.theory

\ No newline at end of file
+Th_lra (sidekick-base.Sidekick_base_solver.Th_lra)
Module Sidekick_base_solver.Th_lra
Theory of Linear Rational Arithmetic
module A : sig ... end
type state
val theory : A.S.theory

\ No newline at end of file
diff --git a/dev/sidekick-base/Sidekick_base_solver/index.html b/dev/sidekick-base/Sidekick_base_solver/index.html
index 6928654c..0c0f9e05 100644
--- a/dev/sidekick-base/Sidekick_base_solver/index.html
+++ b/dev/sidekick-base/Sidekick_base_solver/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_base_solver (sidekick-base.Sidekick_base_solver)
Module Sidekick_base_solver
SMT Solver and Theories for Sidekick_base.
This contains instances of the SMT solver, and theories, from Sidekick_core, using data structures from Sidekick_base.
module Solver_arg : sig ... end
Argument to the SMT solver
module Solver : sig ... end
SMT solver, obtained from Sidekick_smt_solver
module Th_data : sig ... end
Theory of datatypes
module Th_bool : sig ... end
Reducing boolean formulas to clauses
module Th_lra : sig ... end
Theory of Linear Rational Arithmetic
val th_bool : Solver.theory
val th_data : Solver.theory
val th_lra : Solver.theory

\ No newline at end of file
+Sidekick_base_solver (sidekick-base.Sidekick_base_solver)
Module Sidekick_base_solver
SMT Solver and Theories for Sidekick_base.
This contains instances of the SMT solver, and theories, from Sidekick_core, using data structures from Sidekick_base.
module Solver_arg : sig ... end
Argument to the SMT solver
module Solver : sig ... end
SMT solver, obtained from Sidekick_smt_solver
module Th_data : sig ... end
Theory of datatypes
module Th_bool : sig ... end
Reducing boolean formulas to clauses
module Th_lra : sig ... end
Theory of Linear Rational Arithmetic
val th_bool : Solver.theory
val th_data : Solver.theory
val th_lra : Solver.theory

\ No newline at end of file
diff --git a/dev/sidekick-base/index.html b/dev/sidekick-base/index.html
index 379090d8..3c23e835 100644
--- a/dev/sidekick-base/index.html
+++ b/dev/sidekick-base/index.html
@@ -1,2 +1,2 @@
 
-index (sidekick-base.index)
sidekick-base index
Library sidekick-base
The entry point of this library is the module: Sidekick_base.
Library sidekick-base.proof-trace
The entry point of this library is the module: Sidekick_base_proof_trace.
Library sidekick-base.solver
The entry point of this library is the module: Sidekick_base_solver.

\ No newline at end of file
+index (sidekick-base.index)
sidekick-base index
Library sidekick-base
The entry point of this library is the module: Sidekick_base.
Library sidekick-base.proof-trace
The entry point of this library is the module: Sidekick_base_proof_trace.
Library sidekick-base.solver
The entry point of this library is the module: Sidekick_base_solver.

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_bin_lib/Dimacs_lexer/index.html b/dev/sidekick-bin/Sidekick_bin_lib/Dimacs_lexer/index.html
index 1d4dbe45..d5706ea6 100644
--- a/dev/sidekick-bin/Sidekick_bin_lib/Dimacs_lexer/index.html
+++ b/dev/sidekick-bin/Sidekick_bin_lib/Dimacs_lexer/index.html
@@ -1,2 +1,2 @@
 
-Dimacs_lexer (sidekick-bin.Sidekick_bin_lib.Dimacs_lexer)
Module Sidekick_bin_lib.Dimacs_lexer
type token = 
| EOF
| P
| CNF
| ZERO
| LIT of int
val __ocaml_lex_tables : Stdlib.Lexing.lex_tables
val token : Stdlib.Lexing.lexbuf -> token
val __ocaml_lex_token_rec : Stdlib.Lexing.lexbuf -> int -> token
val comment : Stdlib.Lexing.lexbuf -> token
val __ocaml_lex_comment_rec : Stdlib.Lexing.lexbuf -> int -> token

\ No newline at end of file
+Dimacs_lexer (sidekick-bin.Sidekick_bin_lib.Dimacs_lexer)
Module Sidekick_bin_lib.Dimacs_lexer
type token = 
| EOF
| P
| CNF
| ZERO
| LIT of int
val __ocaml_lex_tables : Stdlib.Lexing.lex_tables
val token : Stdlib.Lexing.lexbuf -> token
val __ocaml_lex_token_rec : Stdlib.Lexing.lexbuf -> int -> token
val comment : Stdlib.Lexing.lexbuf -> token
val __ocaml_lex_comment_rec : Stdlib.Lexing.lexbuf -> int -> token

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_bin_lib/Dimacs_parser/index.html b/dev/sidekick-bin/Sidekick_bin_lib/Dimacs_parser/index.html
index 3aa070b1..a4858e2c 100644
--- a/dev/sidekick-bin/Sidekick_bin_lib/Dimacs_parser/index.html
+++ b/dev/sidekick-bin/Sidekick_bin_lib/Dimacs_parser/index.html
@@ -1,2 +1,2 @@
 
-Dimacs_parser (sidekick-bin.Sidekick_bin_lib.Dimacs_parser)
Module Sidekick_bin_lib.Dimacs_parser
DIMACS parser
type t
val create : Stdlib.in_channel -> t
val parse_header : t -> int * int
val next_clause : t -> int list option
val iter : t -> int list Iter.t

\ No newline at end of file
+Dimacs_parser (sidekick-bin.Sidekick_bin_lib.Dimacs_parser)
Module Sidekick_bin_lib.Dimacs_parser
DIMACS parser
type t
val create : Stdlib.in_channel -> t
val parse_header : t -> int * int
val next_clause : t -> int list option
val iter : t -> int list Iter.t

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_bin_lib/Drup_lexer/index.html b/dev/sidekick-bin/Sidekick_bin_lib/Drup_lexer/index.html
index f7a29071..3e56bf73 100644
--- a/dev/sidekick-bin/Sidekick_bin_lib/Drup_lexer/index.html
+++ b/dev/sidekick-bin/Sidekick_bin_lib/Drup_lexer/index.html
@@ -1,2 +1,2 @@
 
-Drup_lexer (sidekick-bin.Sidekick_bin_lib.Drup_lexer)
Module Sidekick_bin_lib.Drup_lexer
type token = 
| EOF
| ZERO
| LIT of int
| D
| R
| I
val __ocaml_lex_tables : Stdlib.Lexing.lex_tables
val token : Stdlib.Lexing.lexbuf -> token
val __ocaml_lex_token_rec : Stdlib.Lexing.lexbuf -> int -> token
val comment : Stdlib.Lexing.lexbuf -> token
val __ocaml_lex_comment_rec : Stdlib.Lexing.lexbuf -> int -> token

\ No newline at end of file
+Drup_lexer (sidekick-bin.Sidekick_bin_lib.Drup_lexer)
Module Sidekick_bin_lib.Drup_lexer
type token = 
| EOF
| ZERO
| LIT of int
| D
| R
| I
val __ocaml_lex_tables : Stdlib.Lexing.lex_tables
val token : Stdlib.Lexing.lexbuf -> token
val __ocaml_lex_token_rec : Stdlib.Lexing.lexbuf -> int -> token
val comment : Stdlib.Lexing.lexbuf -> token
val __ocaml_lex_comment_rec : Stdlib.Lexing.lexbuf -> int -> token

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_bin_lib/Drup_parser/index.html b/dev/sidekick-bin/Sidekick_bin_lib/Drup_parser/index.html
index faf1f674..fd2099a9 100644
--- a/dev/sidekick-bin/Sidekick_bin_lib/Drup_parser/index.html
+++ b/dev/sidekick-bin/Sidekick_bin_lib/Drup_parser/index.html
@@ -1,2 +1,2 @@
 
-Drup_parser (sidekick-bin.Sidekick_bin_lib.Drup_parser)
Module Sidekick_bin_lib.Drup_parser
DRUP parser
type t
type event = 
| Input of int list
| Add of int list
| Delete of int list
val create_chan : Stdlib.in_channel -> t
val create_string : string -> t
val next : t -> event option
val iter : t -> event Iter.t

\ No newline at end of file
+Drup_parser (sidekick-bin.Sidekick_bin_lib.Drup_parser)
Module Sidekick_bin_lib.Drup_parser
DRUP parser
type t
type event = 
| Input of int list
| Add of int list
| Delete of int list
val create_chan : Stdlib.in_channel -> t
val create_string : string -> t
val next : t -> event option
val iter : t -> event Iter.t

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_bin_lib/index.html b/dev/sidekick-bin/Sidekick_bin_lib/index.html
index aeec510c..ae0b1a53 100644
--- a/dev/sidekick-bin/Sidekick_bin_lib/index.html
+++ b/dev/sidekick-bin/Sidekick_bin_lib/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_bin_lib (sidekick-bin.Sidekick_bin_lib)
Module Sidekick_bin_lib
Library for the Sidekick executables
module Dimacs_lexer : sig ... end
module Dimacs_parser : sig ... end
module Drup_lexer : sig ... end
module Drup_parser : sig ... end

\ No newline at end of file
+Sidekick_bin_lib (sidekick-bin.Sidekick_bin_lib)
Module Sidekick_bin_lib
Library for the Sidekick executables
module Dimacs_lexer : sig ... end
module Dimacs_parser : sig ... end
module Drup_lexer : sig ... end
module Drup_parser : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_bin_lib__/index.html b/dev/sidekick-bin/Sidekick_bin_lib__/index.html
index c35a0cfb..7cf47d6e 100644
--- a/dev/sidekick-bin/Sidekick_bin_lib__/index.html
+++ b/dev/sidekick-bin/Sidekick_bin_lib__/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_bin_lib__ (sidekick-bin.Sidekick_bin_lib__)
Module Sidekick_bin_lib__

\ No newline at end of file
+Sidekick_bin_lib__ (sidekick-bin.Sidekick_bin_lib__)
Module Sidekick_bin_lib__

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_bin_lib__Dimacs_lexer/index.html b/dev/sidekick-bin/Sidekick_bin_lib__Dimacs_lexer/index.html
index 1d372366..7244f51a 100644
--- a/dev/sidekick-bin/Sidekick_bin_lib__Dimacs_lexer/index.html
+++ b/dev/sidekick-bin/Sidekick_bin_lib__Dimacs_lexer/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_bin_lib__Dimacs_lexer (sidekick-bin.Sidekick_bin_lib__Dimacs_lexer)
Module Sidekick_bin_lib__Dimacs_lexer

\ No newline at end of file
+Sidekick_bin_lib__Dimacs_lexer (sidekick-bin.Sidekick_bin_lib__Dimacs_lexer)
Module Sidekick_bin_lib__Dimacs_lexer

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_bin_lib__Dimacs_parser/index.html b/dev/sidekick-bin/Sidekick_bin_lib__Dimacs_parser/index.html
index 882b2673..6567752c 100644
--- a/dev/sidekick-bin/Sidekick_bin_lib__Dimacs_parser/index.html
+++ b/dev/sidekick-bin/Sidekick_bin_lib__Dimacs_parser/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_bin_lib__Dimacs_parser (sidekick-bin.Sidekick_bin_lib__Dimacs_parser)
Module Sidekick_bin_lib__Dimacs_parser

\ No newline at end of file
+Sidekick_bin_lib__Dimacs_parser (sidekick-bin.Sidekick_bin_lib__Dimacs_parser)
Module Sidekick_bin_lib__Dimacs_parser

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_bin_lib__Drup_lexer/index.html b/dev/sidekick-bin/Sidekick_bin_lib__Drup_lexer/index.html
index f4624b76..20b6eb05 100644
--- a/dev/sidekick-bin/Sidekick_bin_lib__Drup_lexer/index.html
+++ b/dev/sidekick-bin/Sidekick_bin_lib__Drup_lexer/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_bin_lib__Drup_lexer (sidekick-bin.Sidekick_bin_lib__Drup_lexer)
Module Sidekick_bin_lib__Drup_lexer

\ No newline at end of file
+Sidekick_bin_lib__Drup_lexer (sidekick-bin.Sidekick_bin_lib__Drup_lexer)
Module Sidekick_bin_lib__Drup_lexer

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_bin_lib__Drup_parser/index.html b/dev/sidekick-bin/Sidekick_bin_lib__Drup_parser/index.html
index 5fcdf6f0..e70ae0f3 100644
--- a/dev/sidekick-bin/Sidekick_bin_lib__Drup_parser/index.html
+++ b/dev/sidekick-bin/Sidekick_bin_lib__Drup_parser/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_bin_lib__Drup_parser (sidekick-bin.Sidekick_bin_lib__Drup_parser)
Module Sidekick_bin_lib__Drup_parser

\ No newline at end of file
+Sidekick_bin_lib__Drup_parser (sidekick-bin.Sidekick_bin_lib__Drup_parser)
Module Sidekick_bin_lib__Drup_parser

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib/Process/Check_cc/index.html b/dev/sidekick-bin/Sidekick_smtlib/Process/Check_cc/index.html
index 22e7e3fe..8dbe58ef 100644
--- a/dev/sidekick-bin/Sidekick_smtlib/Process/Check_cc/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib/Process/Check_cc/index.html
@@ -1,2 +1,2 @@
 
-Check_cc (sidekick-bin.Sidekick_smtlib.Process.Check_cc)
Module Process.Check_cc
val theory : Solver.theory
theory that check validity of conflicts

\ No newline at end of file
+Check_cc (sidekick-bin.Sidekick_smtlib.Process.Check_cc)
Module Process.Check_cc
val theory : Solver.theory
theory that check validity of conflicts

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Lit/index.html b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Lit/index.html
index 73609c14..01527309 100644
--- a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Lit/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick-bin.Sidekick_smtlib.Process.Solver.Lit)
Module Solver.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick-bin.Sidekick_smtlib.Process.Solver.Lit)
Module Solver.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Model/index.html b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Model/index.html
index 43fc8c01..04094114 100644
--- a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Model/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Model/index.html
@@ -1,2 +1,2 @@
 
-Model (sidekick-bin.Sidekick_smtlib.Process.Solver.Model)
Module Solver.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Model (sidekick-bin.Sidekick_smtlib.Process.Solver.Model)
Module Solver.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/P/Step_vec/index.html b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/P/Step_vec/index.html
index 6d43f5ee..53931fd3 100644
--- a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/P/Step_vec/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick-bin.Sidekick_smtlib.Process.Solver.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick-bin.Sidekick_smtlib.Process.Solver.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/P/index.html b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/P/index.html
index 34839b00..d3e200d6 100644
--- a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/P/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick-bin.Sidekick_smtlib.Process.Solver.P)
Module Solver.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
+P (sidekick-bin.Sidekick_smtlib.Process.Solver.P)
Module Solver.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/Actions/P/index.html b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/Actions/P/index.html
index 95e3ef5a..d4fba7bb 100644
--- a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/Actions/P/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick-bin.Sidekick_smtlib.Process.Solver.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick-bin.Sidekick_smtlib.Process.Solver.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/Actions/index.html b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/Actions/index.html
index d7ca4d7d..4a160e8c 100644
--- a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/Actions/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick-bin.Sidekick_smtlib.Process.Solver.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
+Actions (sidekick-bin.Sidekick_smtlib.Process.Solver.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/Expl/index.html b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/Expl/index.html
index 3274a631..3172431e 100644
--- a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/Expl/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick-bin.Sidekick_smtlib.Process.Solver.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick-bin.Sidekick_smtlib.Process.Solver.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/N/index.html b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/N/index.html
index 3eadbef1..831edae4 100644
--- a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/N/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick-bin.Sidekick_smtlib.Process.Solver.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
+N (sidekick-bin.Sidekick_smtlib.Process.Solver.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/P/index.html b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/P/index.html
index 662e0750..81016244 100644
--- a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/P/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick-bin.Sidekick_smtlib.Process.Solver.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick-bin.Sidekick_smtlib.Process.Solver.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/index.html b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/index.html
index d9aa962c..83afe8c8 100644
--- a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/CC/index.html
@@ -1,4 +1,4 @@
 
-CC (sidekick-bin.Sidekick_smtlib.Process.Solver.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+CC (sidekick-bin.Sidekick_smtlib.Process.Solver.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Small | `Big ] -> term_store -> proof -> t
Create a new congruence closure.
  • parameter term_store 
    used to be able to create new terms. All terms interacting with this congruence closure must belong in this term state as well.
val allocate_bitfield : descr:string -> t -> N.bitfield
Allocate a new node field (see N.bitfield).
This field descriptor is henceforth reserved for all nodes in this congruence closure, and can be set using set_bitfield for each node individually. This can be used to efficiently store some metadata on nodes (e.g. "is there a numeric value in the class" or "is there a constructor term in the class").
There may be restrictions on how many distinct fields are allocated for a given congruence closure (e.g. at most Sys.int_size fields).
val get_bitfield : t -> N.bitfield -> N.t -> bool
Access the bit field of the given node
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
Set the bitfield for the node. This will be backtracked. See N.bitfield.
val on_pre_merge : t -> ev_on_pre_merge -> unit
Add a function to be called when two classes are merged
val on_post_merge : t -> ev_on_post_merge -> unit
Add a function to be called when two classes are merged
val on_new_term : t -> ev_on_new_term -> unit
Add a function to be called when a new node is created
val on_conflict : t -> ev_on_conflict -> unit
Called when the congruence closure finds a conflict
val on_propagate : t -> ev_on_propagate -> unit
Called when the congruence closure propagates a literal
val on_is_subterm : t -> ev_on_is_subterm -> unit
Called on terms that are subterms of function symbols
val set_as_lit : t -> N.t -> lit -> unit
map the given node to a literal.
val find_t : t -> term -> repr
Current representative of the term.
  • raises Not_found 
    if the term is not already add-ed.
val add_seq : t -> term Iter.t -> unit
Add a sequence of terms to the congruence closure
val all_classes : t -> repr Iter.t
All current classes. This is costly, only use if there is no other solution
val assert_lit : t -> lit -> unit
Given a literal, assume it in the congruence closure and propagate its consequences. Will be backtracked.
Useful for the theory combination or the SAT solver's functor
val assert_lits : t -> lit Iter.t -> unit
Addition of many literals
val explain_eq : t -> N.t -> N.t -> lit list
Explain why the two nodes are equal. Fails if they are not, in an unspecified way
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
Raise a conflict with the given explanation it must be a theory tautology that expl ==> absurd. To be used in theories.
val n_true : t -> N.t
Node for true
val n_false : t -> N.t
Node for false
val n_bool : t -> bool -> N.t
Node for either true or false
val merge : t -> N.t -> N.t -> Expl.t -> unit
Merge these two nodes given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val merge_t : t -> term -> term -> Expl.t -> unit
Shortcut for adding + merging
val check : t -> actions -> unit
Perform all pending operations done via assert_eq, assert_lit, etc. Will use the actions to propagate literals, declare conflicts, etc.
val new_merges : t -> bool
Called after check, returns true if some pairs of classes were merged.
val push_level : t -> unit
Push backtracking level
val pop_levels : t -> int -> unit
Restore to state n calls to push_level earlier. Used during backtracking.
val get_model : t -> N.t Iter.t Iter.t
get all the equivalence classes so they can be merged in the model

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/Simplify/index.html b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/Simplify/index.html
index d86722ef..126136d7 100644
--- a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/Simplify/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/Simplify/index.html
@@ -1,2 +1,2 @@
 
-Simplify (sidekick-bin.Sidekick_smtlib.Process.Solver.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
+Simplify (sidekick-bin.Sidekick_smtlib.Process.Solver.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/index.html b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/index.html
index 0dddeaaf..038fbaef 100644
--- a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/index.html
@@ -1,3 +1,3 @@
 
-Solver_internal (sidekick-bin.Sidekick_smtlib.Process.Solver.Solver_internal)
Module Solver.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
+Solver_internal (sidekick-bin.Sidekick_smtlib.Process.Solver.Solver_internal)
Module Solver.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
 P.t = proof and type P.lit = lit and type Actions.t = theory_actions
Congruence closure instance
val cc : t -> CC.t
Congruence closure for this solver
Simplifiers
module Simplify : sig ... end
Simplify terms
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
Add a simplifier hook for preprocessing.
val simplify_t : t -> term -> (term * proof_step) option
Simplify input term, returns Some u if some simplification occurred.
val simp_t : t -> term -> term * proof_step option
simp_t si t returns u even if no simplification occurred (in which case t == u syntactically). It emits |- t=u. (see simplifier)
Preprocessors
These preprocessors turn mixed, raw literals (possibly simplified) into literals suitable for reasoning. Typically some clauses are also added to the solver.
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
Actions available to the preprocessor
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
Given a term, try to preprocess it. Return None if it didn't change, or Some (u) if t=u. Can also add clauses to define new terms.
Preprocessing might transform terms to make them more amenable to reasoning, e.g. by removing boolean formulas via Tseitin encoding, adding clauses that encode their meaning in the same move.
  • parameter preprocess_actions 
    actions available during preprocessing.
val on_preprocess : t -> preprocess_hook -> unit
Add a hook that will be called when terms are preprocessed
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
Obtain preprocessor actions, from theory actions
hooks for the theory
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
Give a conflict clause to the solver
val push_decision : t -> theory_actions -> lit -> unit
Ask the SAT solver to decide the given literal in an extension of the current trail. This is useful for theory combination. If the SAT solver backtracks, this (potential) decision is removed and forgotten.
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
Add local clause to the SAT solver. This clause will be removed when the solver backtracks.
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
Add toplevel clause to the SAT solver. This clause will not be backtracked.
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
Create a literal. This automatically preprocesses the term.
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
Preprocess a term.
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
Add the given literal to the SAT solver, so it gets assigned a boolean value.
  • parameter default_pol 
    default polarity for the corresponding atom
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
Add the given (signed) bool term to the SAT solver, so it gets assigned a boolean value
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
Raise a conflict with the given congruence closure explanation. it must be a theory tautology that expl ==> absurd. To be used in theories.
val cc_find : t -> CC.N.t -> CC.N.t
Find representative of the node
val cc_are_equal : t -> term -> term -> bool
Are these two terms equal in the congruence closure?
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
Merge these two nodes in the congruence closure, given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
Merge these two terms in the congruence closure, given this explanation. See cc_merge
val cc_add_term : t -> term -> CC.N.t
Add/retrieve congruence closure node for this term. To be used in theories
val cc_mem_term : t -> term -> bool
Return true if the term is explicitly in the congruence closure. To be used in theories
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called before)
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called after)
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
Callback to add data on terms when they are added to the congruence closure
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
Callback for when a term is a subterm of another term in the congruence closure
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
Callback called on every CC conflict
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
Callback called on every CC propagation
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callbacked to be called with the slice of literals newly added on the trail.
This is called very often and should be efficient. It doesn't have to be complete, only correct. It's given only the slice of the trail consisting in new literals.
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callback to be called during the final check.
Must be complete (i.e. must raise a conflict if the set of literals is not satisfiable) and can be expensive. The function is given the whole trail.
Model production
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
A model-production hook. It takes the solver, a class, and returns a term for this class. For example, an arithmetic theory might detect that a class contains a numeric constant, and return this constant as a model value.
If no hook assigns a value to a class, a fake value is created for it.
val on_model_gen : t -> model_hook -> unit
Add a hook that will be called when a model is being produced

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/module-type-PREPROCESS_ACTS/index.html b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/module-type-PREPROCESS_ACTS/index.html
index 4fa46e21..53789156 100644
--- a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/module-type-PREPROCESS_ACTS/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Solver_internal/module-type-PREPROCESS_ACTS/index.html
@@ -1,2 +1,2 @@
 
-PREPROCESS_ACTS (sidekick-bin.Sidekick_smtlib.Process.Solver.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
+PREPROCESS_ACTS (sidekick-bin.Sidekick_smtlib.Process.Solver.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/T/Fun/index.html b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/T/Fun/index.html
index 852be3e3..9cf5b016 100644
--- a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/T/Fun/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick-bin.Sidekick_smtlib.Process.Solver.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick-bin.Sidekick_smtlib.Process.Solver.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/T/Term/index.html b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/T/Term/index.html
index 1f14b042..3a36002f 100644
--- a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/T/Term/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick-bin.Sidekick_smtlib.Process.Solver.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick-bin.Sidekick_smtlib.Process.Solver.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/T/Ty/index.html b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/T/Ty/index.html
index e44894f9..2691ca6d 100644
--- a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/T/Ty/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick-bin.Sidekick_smtlib.Process.Solver.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick-bin.Sidekick_smtlib.Process.Solver.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/T/index.html b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/T/index.html
index 6e8ab61c..b639bac4 100644
--- a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/T/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick-bin.Sidekick_smtlib.Process.Solver.T)
Module Solver.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick-bin.Sidekick_smtlib.Process.Solver.T)
Module Solver.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Unknown/index.html b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Unknown/index.html
index 61e4c55e..6218f7a6 100644
--- a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Unknown/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/Unknown/index.html
@@ -1,2 +1,2 @@
 
-Unknown (sidekick-bin.Sidekick_smtlib.Process.Solver.Unknown)
Module Solver.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
+Unknown (sidekick-bin.Sidekick_smtlib.Process.Solver.Unknown)
Module Solver.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/index.html b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/index.html
index a306a461..80de242b 100644
--- a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/index.html
@@ -1,5 +1,5 @@
 
-Solver (sidekick-bin.Sidekick_smtlib.Process.Solver)
Module Process.Solver
module Lit : Sidekick_core.LIT with module T = T
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
+Solver (sidekick-bin.Sidekick_smtlib.Process.Solver)
Module Process.Solver
module Lit : Sidekick_core.LIT with module T = T
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
 ?push_level:('th -> unit) -> ?pop_levels:('th -> int -> unit) -> unit -> theory
Helper to create a theory.
module Model : sig ... end
Models
module Unknown : sig ... end
Main API
val stats : t -> Sidekick_util.Stat.t
val tst : t -> T.Term.store
val ty_st : t -> T.Ty.store
val proof : t -> proof
val create : ?stat:Sidekick_util.Stat.t -> ?size:[ `Big | `Tiny | `Small ] -> proof:proof -> theories:theory list ->
 T.Term.store -> T.Ty.store -> unit -> t
Create a new solver.
It needs a term state and a type state to manipulate terms and types. All terms and types interacting with this solver will need to come from these exact states.
  • parameter store_proof 
    if true, proofs from the SAT solver and theories are retained and potentially accessible after solve returns UNSAT.
  • parameter size 
    influences the size of initial allocations.
  • parameter theories 
    theories to load from the start. Other theories can be added using add_theory.
val add_theory : t -> theory -> unit
Add a theory to the solver. This should be called before any call to solve or to add_clause and the likes (otherwise the theory will have a partial view of the problem).
val add_theory_p : t -> 'a theory_p -> 'a
Add the given theory and obtain its state
val add_theory_l : t -> theory list -> unit
val mk_lit_t : t -> ?sign:bool -> term -> lit
mk_lit_t _ ~sign t returns lit', where lit' is preprocess(lit) and lit is an internal representation of ± t.
The proof of |- lit = lit' is directly added to the solver's proof.
val add_clause : t -> lit Sidekick_util.IArray.t -> proof_step -> unit
add_clause solver cs adds a boolean clause to the solver. Subsequent calls to solve will need to satisfy this clause.
val add_clause_l : t -> lit list -> proof_step -> unit
Add a clause to the solver, given as a list.
val assert_terms : t -> term list -> unit
Helper that turns each term into an atom, before adding the result to the solver as an assertion
val assert_term : t -> term -> unit
Helper that turns the term into an atom, before adding the result to the solver as a unit clause assertion
type res = 
| Sat of Model.t(*
Satisfiable
*)
| Unsat of {
unsat_core : unit -> lit Iter.t;(*
Unsat core (subset of assumptions), or empty
*)
unsat_proof_step : unit -> proof_step option;(*
Proof step for the empty clause
*)
}		(*
Unsatisfiable
*)
| Unknown of Unknown.t(*
Unknown, obtained after a timeout, memory limit, etc.
*)
Result of solving for the current set of clauses
val solve : ?on_exit:(unit -> unit) list -> ?check:bool -> ?on_progress:(t -> unit) ->
 assumptions:lit list -> t -> res
solve s checks the satisfiability of the clauses added so far to s.
  • parameter check 
    if true, the model is checked before returning.
  • parameter on_progress 
    called regularly during solving.
  • parameter assumptions 
    a set of atoms held to be true. The unsat core, if any, will be a subset of assumptions.
  • parameter on_exit 
    functions to be run before this returns
val pp_stats : t CCFormat.printer
Print some statistics. What it prints exactly is unspecified.

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/module-type-THEORY/index.html b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/module-type-THEORY/index.html
index d1932746..6c1a054a 100644
--- a/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/module-type-THEORY/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib/Process/Solver/module-type-THEORY/index.html
@@ -1,2 +1,2 @@
 
-THEORY (sidekick-bin.Sidekick_smtlib.Process.Solver.THEORY)
Module type Solver.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
+THEORY (sidekick-bin.Sidekick_smtlib.Process.Solver.THEORY)
Module type Solver.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib/Process/index.html b/dev/sidekick-bin/Sidekick_smtlib/Process/index.html
index 7b178e15..08d9b030 100644
--- a/dev/sidekick-bin/Sidekick_smtlib/Process/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib/Process/index.html
@@ -1,4 +1,4 @@
 
-Process (sidekick-bin.Sidekick_smtlib.Process)
Module Sidekick_smtlib.Process
Process Statements
val th_bool : Solver.theory
val th_data : Solver.theory
val th_lra : Solver.theory
type 'a or_error = ('a, string) CCResult.t
module Check_cc : sig ... end
val process_stmt : ?gc:bool -> ?restarts:bool -> ?pp_cnf:bool -> ?proof_file:string
+Process (sidekick-bin.Sidekick_smtlib.Process)
Module Sidekick_smtlib.Process
Process Statements
val th_bool : Solver.theory
val th_data : Solver.theory
val th_lra : Solver.theory
type 'a or_error = ('a, string) CCResult.t
module Check_cc : sig ... end
val process_stmt : ?gc:bool -> ?restarts:bool -> ?pp_cnf:bool -> ?proof_file:string
 -> ?pp_model:bool -> ?check:bool -> ?time:float -> ?memory:float -> ?progress:bool ->
 Solver.t -> Sidekick_base.Statement.t -> unit or_error

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib/index.html b/dev/sidekick-bin/Sidekick_smtlib/index.html
index 406aa921..9076989f 100644
--- a/dev/sidekick-bin/Sidekick_smtlib/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_smtlib (sidekick-bin.Sidekick_smtlib)
Module Sidekick_smtlib
SMTLib-2 Interface
This library provides a parser, a type-checker, and a solver interface for processing SMTLib-2 problems.
type 'a or_error = ('a, string) CCResult.t
module Term = Sidekick_base.Term
module Process : sig ... end
module Solver = Process.Solver
module Proof = Sidekick_base.Proof
val parse : Term.store -> string -> Stmt.t list or_error
val parse_stdin : Term.store -> Stmt.t list or_error

\ No newline at end of file
+Sidekick_smtlib (sidekick-bin.Sidekick_smtlib)
Module Sidekick_smtlib
SMTLib-2 Interface
This library provides a parser, a type-checker, and a solver interface for processing SMTLib-2 problems.
type 'a or_error = ('a, string) CCResult.t
module Term = Sidekick_base.Term
module Process : sig ... end
module Solver = Process.Solver
module Proof = Sidekick_base.Proof
val parse : Term.store -> string -> Stmt.t list or_error
val parse_stdin : Term.store -> Stmt.t list or_error

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib__/index.html b/dev/sidekick-bin/Sidekick_smtlib__/index.html
index c693bdfe..5641a387 100644
--- a/dev/sidekick-bin/Sidekick_smtlib__/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib__/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_smtlib__ (sidekick-bin.Sidekick_smtlib__)
Module Sidekick_smtlib__

\ No newline at end of file
+Sidekick_smtlib__ (sidekick-bin.Sidekick_smtlib__)
Module Sidekick_smtlib__

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib__Process/index.html b/dev/sidekick-bin/Sidekick_smtlib__Process/index.html
index fe162291..103ccf20 100644
--- a/dev/sidekick-bin/Sidekick_smtlib__Process/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib__Process/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_smtlib__Process (sidekick-bin.Sidekick_smtlib__Process)
Module Sidekick_smtlib__Process

\ No newline at end of file
+Sidekick_smtlib__Process (sidekick-bin.Sidekick_smtlib__Process)
Module Sidekick_smtlib__Process

\ No newline at end of file
diff --git a/dev/sidekick-bin/Sidekick_smtlib__Typecheck/index.html b/dev/sidekick-bin/Sidekick_smtlib__Typecheck/index.html
index a69310ef..5b4e3ca2 100644
--- a/dev/sidekick-bin/Sidekick_smtlib__Typecheck/index.html
+++ b/dev/sidekick-bin/Sidekick_smtlib__Typecheck/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_smtlib__Typecheck (sidekick-bin.Sidekick_smtlib__Typecheck)
Module Sidekick_smtlib__Typecheck

\ No newline at end of file
+Sidekick_smtlib__Typecheck (sidekick-bin.Sidekick_smtlib__Typecheck)
Module Sidekick_smtlib__Typecheck

\ No newline at end of file
diff --git a/dev/sidekick-bin/index.html b/dev/sidekick-bin/index.html
index 23ada045..881208f5 100644
--- a/dev/sidekick-bin/index.html
+++ b/dev/sidekick-bin/index.html
@@ -1,2 +1,2 @@
 
-index (sidekick-bin.index)
sidekick-bin index
Library sidekick-bin.lib
The entry point of this library is the module: Sidekick_bin_lib.
Library sidekick-bin.smtlib
The entry point of this library is the module: Sidekick_smtlib.

\ No newline at end of file
+index (sidekick-bin.index)
sidekick-bin index
Library sidekick-bin.lib
The entry point of this library is the module: Sidekick_bin_lib.
Library sidekick-bin.smtlib
The entry point of this library is the module: Sidekick_smtlib.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith/index.html b/dev/sidekick/Sidekick_arith/index.html
index 8636ff64..9cffc59b 100644
--- a/dev/sidekick/Sidekick_arith/index.html
+++ b/dev/sidekick/Sidekick_arith/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_arith (sidekick.Sidekick_arith)
Module Sidekick_arith
module type NUM = sig ... end
module type INT = sig ... end
module type RATIONAL = sig ... end

\ No newline at end of file
+Sidekick_arith (sidekick.Sidekick_arith)
Module Sidekick_arith
module type NUM = sig ... end
module type INT = sig ... end
module type RATIONAL = sig ... end

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith/module-type-INT/index.html b/dev/sidekick/Sidekick_arith/module-type-INT/index.html
index d3728056..ca453636 100644
--- a/dev/sidekick/Sidekick_arith/module-type-INT/index.html
+++ b/dev/sidekick/Sidekick_arith/module-type-INT/index.html
@@ -1,2 +1,2 @@
 
-INT (sidekick.Sidekick_arith.INT)
Module type Sidekick_arith.INT
include NUM
type t
val zero : t
val one : t
val minus_one : t
val sign : t -> int
val of_int : int -> t
include Sidekick_sigs.EQ with type t := t
val equal : t -> t -> bool
include Sidekick_sigs.ORD with type t := t
val compare : t -> t -> int
include Sidekick_sigs.HASH with type t := t
val hash : t -> int
include Sidekick_sigs.PRINT with type t := t
val pp : t CCFormat.printer
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
val (~-) : t -> t
val neg : t -> t
val min : t -> t -> t
val max : t -> t -> t
val (=) : t -> t -> bool
val (<>) : t -> t -> bool
val (>) : t -> t -> bool
val (>=) : t -> t -> bool
val (<) : t -> t -> bool
val (<=) : t -> t -> bool
val succ : t -> t

\ No newline at end of file
+INT (sidekick.Sidekick_arith.INT)
Module type Sidekick_arith.INT
include NUM
type t
val zero : t
val one : t
val minus_one : t
val sign : t -> int
val of_int : int -> t
include Sidekick_sigs.EQ with type t := t
val equal : t -> t -> bool
include Sidekick_sigs.ORD with type t := t
val compare : t -> t -> int
include Sidekick_sigs.HASH with type t := t
val hash : t -> int
include Sidekick_sigs.PRINT with type t := t
val pp : t CCFormat.printer
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
val (~-) : t -> t
val neg : t -> t
val min : t -> t -> t
val max : t -> t -> t
val (=) : t -> t -> bool
val (<>) : t -> t -> bool
val (>) : t -> t -> bool
val (>=) : t -> t -> bool
val (<) : t -> t -> bool
val (<=) : t -> t -> bool
val succ : t -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith/module-type-NUM/index.html b/dev/sidekick/Sidekick_arith/module-type-NUM/index.html
index 321dbe0c..2c9d6d49 100644
--- a/dev/sidekick/Sidekick_arith/module-type-NUM/index.html
+++ b/dev/sidekick/Sidekick_arith/module-type-NUM/index.html
@@ -1,2 +1,2 @@
 
-NUM (sidekick.Sidekick_arith.NUM)
Module type Sidekick_arith.NUM
type t
val zero : t
val one : t
val minus_one : t
val sign : t -> int
val of_int : int -> t
include Sidekick_sigs.EQ with type t := t
val equal : t -> t -> bool
include Sidekick_sigs.ORD with type t := t
val compare : t -> t -> int
include Sidekick_sigs.HASH with type t := t
val hash : t -> int
include Sidekick_sigs.PRINT with type t := t
val pp : t CCFormat.printer
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
val (~-) : t -> t
val neg : t -> t
val min : t -> t -> t
val max : t -> t -> t
val (=) : t -> t -> bool
val (<>) : t -> t -> bool
val (>) : t -> t -> bool
val (>=) : t -> t -> bool
val (<) : t -> t -> bool
val (<=) : t -> t -> bool

\ No newline at end of file
+NUM (sidekick.Sidekick_arith.NUM)
Module type Sidekick_arith.NUM
type t
val zero : t
val one : t
val minus_one : t
val sign : t -> int
val of_int : int -> t
include Sidekick_sigs.EQ with type t := t
val equal : t -> t -> bool
include Sidekick_sigs.ORD with type t := t
val compare : t -> t -> int
include Sidekick_sigs.HASH with type t := t
val hash : t -> int
include Sidekick_sigs.PRINT with type t := t
val pp : t CCFormat.printer
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
val (~-) : t -> t
val neg : t -> t
val min : t -> t -> t
val max : t -> t -> t
val (=) : t -> t -> bool
val (<>) : t -> t -> bool
val (>) : t -> t -> bool
val (>=) : t -> t -> bool
val (<) : t -> t -> bool
val (<=) : t -> t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith/module-type-RATIONAL/index.html b/dev/sidekick/Sidekick_arith/module-type-RATIONAL/index.html
index 473875f0..4c4e3946 100644
--- a/dev/sidekick/Sidekick_arith/module-type-RATIONAL/index.html
+++ b/dev/sidekick/Sidekick_arith/module-type-RATIONAL/index.html
@@ -1,2 +1,2 @@
 
-RATIONAL (sidekick.Sidekick_arith.RATIONAL)
Module type Sidekick_arith.RATIONAL
include NUM
type t
val zero : t
val one : t
val minus_one : t
val sign : t -> int
val of_int : int -> t
include Sidekick_sigs.EQ with type t := t
val equal : t -> t -> bool
include Sidekick_sigs.ORD with type t := t
val compare : t -> t -> int
include Sidekick_sigs.HASH with type t := t
val hash : t -> int
include Sidekick_sigs.PRINT with type t := t
val pp : t CCFormat.printer
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
val (~-) : t -> t
val neg : t -> t
val min : t -> t -> t
val max : t -> t -> t
val (=) : t -> t -> bool
val (<>) : t -> t -> bool
val (>) : t -> t -> bool
val (>=) : t -> t -> bool
val (<) : t -> t -> bool
val (<=) : t -> t -> bool
type bigint
val (/) : t -> t -> t
val num : t -> bigint
val denum : t -> bigint
val pp_approx : int -> Stdlib.Format.formatter -> t -> unit
Pretty print rational with given amount of precision (for example as a floating point number)

\ No newline at end of file
+RATIONAL (sidekick.Sidekick_arith.RATIONAL)
Module type Sidekick_arith.RATIONAL
include NUM
type t
val zero : t
val one : t
val minus_one : t
val sign : t -> int
val of_int : int -> t
include Sidekick_sigs.EQ with type t := t
val equal : t -> t -> bool
include Sidekick_sigs.ORD with type t := t
val compare : t -> t -> int
include Sidekick_sigs.HASH with type t := t
val hash : t -> int
include Sidekick_sigs.PRINT with type t := t
val pp : t CCFormat.printer
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
val (~-) : t -> t
val neg : t -> t
val min : t -> t -> t
val max : t -> t -> t
val (=) : t -> t -> bool
val (<>) : t -> t -> bool
val (>) : t -> t -> bool
val (>=) : t -> t -> bool
val (<) : t -> t -> bool
val (<=) : t -> t -> bool
type bigint
val (/) : t -> t -> t
val num : t -> bigint
val denum : t -> bigint
val pp_approx : int -> Stdlib.Format.formatter -> t -> unit
Pretty print rational with given amount of precision (for example as a floating point number)

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/Comb/Infix/index.html b/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/Comb/Infix/index.html
index 5414942c..2398666c 100644
--- a/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/Comb/Infix/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/Comb/Infix/index.html
@@ -1,2 +1,2 @@
 
-Infix (sidekick.Sidekick_arith_lra.Linear_expr.Make.Comb.Infix)
Module Comb.Infix
Infix operations on combinations
This module defines usual operations on linear combinations, as infix operators to ease reading of complex computations.
val (+) : t -> t -> t
Addition between combinations.
val (-) : t -> t -> t
Substraction between combinations.
val (*) : C.t -> t -> t
Multiplication by a constant.

\ No newline at end of file
+Infix (sidekick.Sidekick_arith_lra.Linear_expr.Make.Comb.Infix)
Module Comb.Infix
Infix operations on combinations
This module defines usual operations on linear combinations, as infix operators to ease reading of complex computations.
val (+) : t -> t -> t
Addition between combinations.
val (-) : t -> t -> t
Substraction between combinations.
val (*) : C.t -> t -> t
Multiplication by a constant.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/Comb/index.html b/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/Comb/index.html
index 0068dbd7..da32f5dd 100644
--- a/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/Comb/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/Comb/index.html
@@ -1,2 +1,2 @@
 
-Comb (sidekick.Sidekick_arith_lra.Linear_expr.Make.Comb)
Module Make.Comb
Combinations.
This module defines linear combnations as mapping from variables to coefficients. This allows for very fast computations.
type t
The type of linear combinations.
val compare : t -> t -> int
Comparisons on linear combinations.
val pp : t Sidekick_util.Fmt.printer
Printer for linear combinations.
val is_empty : t -> bool
Is the given expression empty ?
Creation
val empty : t
The empty linear combination.
val monomial : C.t -> var -> t
monome n v creates the linear combination n * v
val monomial1 : var -> t
monome1 v creates the linear combination 1 * v
val as_singleton : t -> (C.t * var) option
as_singleton l returns Some (c,x) if l = c * x, None otherwise
val add : C.t -> var -> t -> t
add n v t adds the monome n * v to the combination t.
module Infix : sig ... end
Infix operations on combinations
Include the previous module.
include module type of Infix
Infix operations on combinations
This module defines usual operations on linear combinations, as infix operators to ease reading of complex computations.
val (+) : t -> t -> t
Addition between combinations.
val (-) : t -> t -> t
Substraction between combinations.
val (*) : C.t -> t -> t
Multiplication by a constant.
val iter : (var -> C.t -> unit) -> t -> unit
val of_list : (C.t * var) list -> t
val to_list : t -> (C.t * var) list
Converters to and from lists of monomes.
val of_map : C.t Var_map.t -> t
val to_map : t -> C.t Var_map.t
Semantics
val eval : subst -> t -> C.t
Evaluate a linear combination given a substitution for its variables. TODO: document potential exceptions raised ?

\ No newline at end of file
+Comb (sidekick.Sidekick_arith_lra.Linear_expr.Make.Comb)
Module Make.Comb
Combinations.
This module defines linear combnations as mapping from variables to coefficients. This allows for very fast computations.
type t
The type of linear combinations.
val compare : t -> t -> int
Comparisons on linear combinations.
val pp : t Sidekick_util.Fmt.printer
Printer for linear combinations.
val is_empty : t -> bool
Is the given expression empty ?
Creation
val empty : t
The empty linear combination.
val monomial : C.t -> var -> t
monome n v creates the linear combination n * v
val monomial1 : var -> t
monome1 v creates the linear combination 1 * v
val as_singleton : t -> (C.t * var) option
as_singleton l returns Some (c,x) if l = c * x, None otherwise
val add : C.t -> var -> t -> t
add n v t adds the monome n * v to the combination t.
module Infix : sig ... end
Infix operations on combinations
Include the previous module.
include module type of Infix
Infix operations on combinations
This module defines usual operations on linear combinations, as infix operators to ease reading of complex computations.
val (+) : t -> t -> t
Addition between combinations.
val (-) : t -> t -> t
Substraction between combinations.
val (*) : C.t -> t -> t
Multiplication by a constant.
val iter : (var -> C.t -> unit) -> t -> unit
val of_list : (C.t * var) list -> t
val to_list : t -> (C.t * var) list
Converters to and from lists of monomes.
val of_map : C.t Var_map.t -> t
val to_map : t -> C.t Var_map.t
Semantics
val eval : subst -> t -> C.t
Evaluate a linear combination given a substitution for its variables. TODO: document potential exceptions raised ?

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/Constr/index.html b/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/Constr/index.html
index 04969249..c128c606 100644
--- a/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/Constr/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/Constr/index.html
@@ -1,2 +1,2 @@
 
-Constr (sidekick.Sidekick_arith_lra.Linear_expr.Make.Constr)
Module Make.Constr
Linear constraints.
Represents constraints on linear expressions.
type op = Predicate.t
Arithmetic comparison operators.
type t = {
expr : Expr.t;
op : op;
}
Linear constraints. Expressions are implicitly compared to zero.
val compare : t -> t -> int
Standard comparison function.
val pp : t Sidekick_util.Fmt.printer
Standard printing function.
val of_expr : Expr.t -> Predicate.t -> t
val make : Comb.t -> Predicate.t -> C.t -> t
Create a constraint from a linear expression/combination and a constant.
val geq : Comb.t -> C.t -> t
val leq : Comb.t -> C.t -> t
val gt : Comb.t -> C.t -> t
val lt : Comb.t -> C.t -> t
val eq : Comb.t -> C.t -> t
val neq : Comb.t -> C.t -> t
val geq0 : Expr.t -> t
val leq0 : Expr.t -> t
val gt0 : Expr.t -> t
val lt0 : Expr.t -> t
val eq0 : Expr.t -> t
val neq0 : Expr.t -> t
val op : t -> Predicate.t
val expr : t -> Expr.t
Extract the given part from a constraint.
val split : t -> Comb.t * Predicate.t * C.t
Split the linear combinations from the constant
val eval : subst -> t -> bool
Evaluate the given constraint under a substitution.

\ No newline at end of file
+Constr (sidekick.Sidekick_arith_lra.Linear_expr.Make.Constr)
Module Make.Constr
Linear constraints.
Represents constraints on linear expressions.
type op = Predicate.t
Arithmetic comparison operators.
type t = {
expr : Expr.t;
op : op;
}
Linear constraints. Expressions are implicitly compared to zero.
val compare : t -> t -> int
Standard comparison function.
val pp : t Sidekick_util.Fmt.printer
Standard printing function.
val of_expr : Expr.t -> Predicate.t -> t
val make : Comb.t -> Predicate.t -> C.t -> t
Create a constraint from a linear expression/combination and a constant.
val geq : Comb.t -> C.t -> t
val leq : Comb.t -> C.t -> t
val gt : Comb.t -> C.t -> t
val lt : Comb.t -> C.t -> t
val eq : Comb.t -> C.t -> t
val neq : Comb.t -> C.t -> t
val geq0 : Expr.t -> t
val leq0 : Expr.t -> t
val gt0 : Expr.t -> t
val lt0 : Expr.t -> t
val eq0 : Expr.t -> t
val neq0 : Expr.t -> t
val op : t -> Predicate.t
val expr : t -> Expr.t
Extract the given part from a constraint.
val split : t -> Comb.t * Predicate.t * C.t
Split the linear combinations from the constant
val eval : subst -> t -> bool
Evaluate the given constraint under a substitution.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/Expr/Infix/index.html b/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/Expr/Infix/index.html
index 8b6a02e5..57751629 100644
--- a/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/Expr/Infix/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/Expr/Infix/index.html
@@ -1,2 +1,2 @@
 
-Infix (sidekick.Sidekick_arith_lra.Linear_expr.Make.Expr.Infix)
Module Expr.Infix
Infix operations on expressions
This module defines usual operations on linear expressions, as infix operators to ease reading of complex computations.
val (+) : t -> t -> t
Addition between expressions.
val (-) : t -> t -> t
Substraction between expressions.
val (*) : C.t -> t -> t
Multiplication by a constant.

\ No newline at end of file
+Infix (sidekick.Sidekick_arith_lra.Linear_expr.Make.Expr.Infix)
Module Expr.Infix
Infix operations on expressions
This module defines usual operations on linear expressions, as infix operators to ease reading of complex computations.
val (+) : t -> t -> t
Addition between expressions.
val (-) : t -> t -> t
Substraction between expressions.
val (*) : C.t -> t -> t
Multiplication by a constant.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/Expr/index.html b/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/Expr/index.html
index a9e02aa4..1a13b566 100644
--- a/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/Expr/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/Expr/index.html
@@ -1,2 +1,2 @@
 
-Expr (sidekick.Sidekick_arith_lra.Linear_expr.Make.Expr)
Module Make.Expr
Linear expressions represent linear arithmetic expressions as a linear combination and a constant.
type t
The type of linear expressions.
val comb : t -> Comb.t
val const : t -> C.t
val is_zero : t -> bool
val is_const : t -> bool
val compare : t -> t -> int
Standard comparison function on expressions.
val pp : t Sidekick_util.Fmt.printer
Standard printing function on expressions.
val zero : t
The expression 2.
val of_const : C.t -> t
The constant expression.
val of_comb : Comb.t -> t
Combination without constant
val of_list : C.t -> (C.t * Var.t) list -> t
val make : Comb.t -> C.t -> t
make c n makes the linear expression c + n.
val monomial : C.t -> var -> t
val monomial1 : var -> t
module Infix : sig ... end
Infix operations on expressions
Include the previous module.
include module type of Infix
Infix operations on expressions
This module defines usual operations on linear expressions, as infix operators to ease reading of complex computations.
val (+) : t -> t -> t
Addition between expressions.
val (-) : t -> t -> t
Substraction between expressions.
val (*) : C.t -> t -> t
Multiplication by a constant.
Semantics
val eval : subst -> t -> C.t
Evaluate a linear expression given a substitution for its variables. TODO: document potential exceptions raised ?

\ No newline at end of file
+Expr (sidekick.Sidekick_arith_lra.Linear_expr.Make.Expr)
Module Make.Expr
Linear expressions represent linear arithmetic expressions as a linear combination and a constant.
type t
The type of linear expressions.
val comb : t -> Comb.t
val const : t -> C.t
val is_zero : t -> bool
val is_const : t -> bool
val compare : t -> t -> int
Standard comparison function on expressions.
val pp : t Sidekick_util.Fmt.printer
Standard printing function on expressions.
val zero : t
The expression 2.
val of_const : C.t -> t
The constant expression.
val of_comb : Comb.t -> t
Combination without constant
val of_list : C.t -> (C.t * Var.t) list -> t
val make : Comb.t -> C.t -> t
make c n makes the linear expression c + n.
val monomial : C.t -> var -> t
val monomial1 : var -> t
module Infix : sig ... end
Infix operations on expressions
Include the previous module.
include module type of Infix
Infix operations on expressions
This module defines usual operations on linear expressions, as infix operators to ease reading of complex computations.
val (+) : t -> t -> t
Addition between expressions.
val (-) : t -> t -> t
Substraction between expressions.
val (*) : C.t -> t -> t
Multiplication by a constant.
Semantics
val eval : subst -> t -> C.t
Evaluate a linear expression given a substitution for its variables. TODO: document potential exceptions raised ?

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/argument-1-C/index.html b/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/argument-1-C/index.html
index dfa777fc..54b9d6e9 100644
--- a/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/argument-1-C/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/argument-1-C/index.html
@@ -1,2 +1,2 @@
 
-C (sidekick.Sidekick_arith_lra.Linear_expr.Make.1-C)
Parameter Make.1-C
type t
val equal : t -> t -> bool
Equality on coefficients.
val compare : t -> t -> int
Comparison on coefficients.
val pp : t Sidekick_util.Fmt.printer
Printer for coefficients.
val zero : t
The zero coefficient.
val one : t
The one coefficient (to rule them all, :p).
val neg : t -> t
Unary negation
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
Standard operations on coefficients.

\ No newline at end of file
+C (sidekick.Sidekick_arith_lra.Linear_expr.Make.1-C)
Parameter Make.1-C
type t
val equal : t -> t -> bool
Equality on coefficients.
val compare : t -> t -> int
Comparison on coefficients.
val pp : t Sidekick_util.Fmt.printer
Printer for coefficients.
val zero : t
The zero coefficient.
val one : t
The one coefficient (to rule them all, :p).
val neg : t -> t
Unary negation
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
Standard operations on coefficients.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/argument-2-Var/index.html b/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/argument-2-Var/index.html
index 7e44fff2..3b5c9f31 100644
--- a/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/argument-2-Var/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/argument-2-Var/index.html
@@ -1,2 +1,2 @@
 
-Var (sidekick.Sidekick_arith_lra.Linear_expr.Make.2-Var)
Parameter Make.2-Var
type t
Variable type.
val compare : t -> t -> int
Standard comparison function on variables.
val pp : t Sidekick_util.Fmt.printer
Printer for variables.
type lit
val pp_lit : lit Sidekick_util.Fmt.printer
val not_lit : lit -> lit option

\ No newline at end of file
+Var (sidekick.Sidekick_arith_lra.Linear_expr.Make.2-Var)
Parameter Make.2-Var
type t
Variable type.
val compare : t -> t -> int
Standard comparison function on variables.
val pp : t Sidekick_util.Fmt.printer
Printer for variables.
type lit
val pp_lit : lit Sidekick_util.Fmt.printer
val not_lit : lit -> lit option

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/index.html b/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/index.html
index 0d674092..3ff154ad 100644
--- a/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Linear_expr/Make/index.html
@@ -1,2 +1,2 @@
 
-Make (sidekick.Sidekick_arith_lra.Linear_expr.Make)
Module Linear_expr.Make
Parameters
module C : COEFF
module Var : VAR
Signature
module C = C
Coeficients used. Can be integers as well as rationals.
module Var = Var
Variables used in expressions.
type var = Var.t
The type of variables appearing in expressions.
module Var_map = CCMap.Make(Var)
Maps from variables, used for expressions as well as substitutions.
type subst = C.t Var_map.t
Type for substitutions.
module Comb : sig ... end
Combinations.
Linear expressions.
module Expr : sig ... end
Linear expressions represent linear arithmetic expressions as a linear combination and a constant.
module Constr : sig ... end

\ No newline at end of file
+Make (sidekick.Sidekick_arith_lra.Linear_expr.Make)
Module Linear_expr.Make
Parameters
module C : COEFF
module Var : VAR
Signature
module C = C
Coeficients used. Can be integers as well as rationals.
module Var = Var
Variables used in expressions.
type var = Var.t
The type of variables appearing in expressions.
module Var_map = CCMap.Make(Var)
Maps from variables, used for expressions as well as substitutions.
type subst = C.t Var_map.t
Type for substitutions.
module Comb : sig ... end
Combinations.
Linear expressions.
module Expr : sig ... end
Linear expressions represent linear arithmetic expressions as a linear combination and a constant.
module Constr : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Linear_expr/index.html b/dev/sidekick/Sidekick_arith_lra/Linear_expr/index.html
index a02c4a75..fbe23639 100644
--- a/dev/sidekick/Sidekick_arith_lra/Linear_expr/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Linear_expr/index.html
@@ -1,2 +1,2 @@
 
-Linear_expr (sidekick.Sidekick_arith_lra.Linear_expr)
Module Sidekick_arith_lra.Linear_expr
Arithmetic expressions
module type COEFF = sig ... end
module type VAR = sig ... end
module type S = sig ... end
type nonrec bool_op = Predicate.t = 
| Leq
| Geq
| Lt
| Gt
| Eq
| Neq
module Make (C : COEFF) (Var : VAR) : S with module C = C and module Var = Var and module Var_map = CCMap.Make(Var)

\ No newline at end of file
+Linear_expr (sidekick.Sidekick_arith_lra.Linear_expr)
Module Sidekick_arith_lra.Linear_expr
Arithmetic expressions
module type COEFF = sig ... end
module type VAR = sig ... end
module type S = sig ... end
type nonrec bool_op = Predicate.t = 
| Leq
| Geq
| Lt
| Gt
| Eq
| Neq
module Make (C : COEFF) (Var : VAR) : S with module C = C and module Var = Var and module Var_map = CCMap.Make(Var)

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-COEFF/index.html b/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-COEFF/index.html
index 09cf2512..f49ca3d9 100644
--- a/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-COEFF/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-COEFF/index.html
@@ -1,2 +1,2 @@
 
-COEFF (sidekick.Sidekick_arith_lra.Linear_expr.COEFF)
Module type Linear_expr.COEFF
type t
val equal : t -> t -> bool
Equality on coefficients.
val compare : t -> t -> int
Comparison on coefficients.
val pp : t Sidekick_util.Fmt.printer
Printer for coefficients.
val zero : t
The zero coefficient.
val one : t
The one coefficient (to rule them all, :p).
val neg : t -> t
Unary negation
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
Standard operations on coefficients.

\ No newline at end of file
+COEFF (sidekick.Sidekick_arith_lra.Linear_expr.COEFF)
Module type Linear_expr.COEFF
type t
val equal : t -> t -> bool
Equality on coefficients.
val compare : t -> t -> int
Comparison on coefficients.
val pp : t Sidekick_util.Fmt.printer
Printer for coefficients.
val zero : t
The zero coefficient.
val one : t
The one coefficient (to rule them all, :p).
val neg : t -> t
Unary negation
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
Standard operations on coefficients.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/C/index.html b/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/C/index.html
index 5279c5f4..d54f6d4b 100644
--- a/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/C/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/C/index.html
@@ -1,2 +1,2 @@
 
-C (sidekick.Sidekick_arith_lra.Linear_expr.S.C)
Module S.C
Coeficients used. Can be integers as well as rationals.
type t
val equal : t -> t -> bool
Equality on coefficients.
val compare : t -> t -> int
Comparison on coefficients.
val pp : t Sidekick_util.Fmt.printer
Printer for coefficients.
val zero : t
The zero coefficient.
val one : t
The one coefficient (to rule them all, :p).
val neg : t -> t
Unary negation
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
Standard operations on coefficients.

\ No newline at end of file
+C (sidekick.Sidekick_arith_lra.Linear_expr.S.C)
Module S.C
Coeficients used. Can be integers as well as rationals.
type t
val equal : t -> t -> bool
Equality on coefficients.
val compare : t -> t -> int
Comparison on coefficients.
val pp : t Sidekick_util.Fmt.printer
Printer for coefficients.
val zero : t
The zero coefficient.
val one : t
The one coefficient (to rule them all, :p).
val neg : t -> t
Unary negation
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
Standard operations on coefficients.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Comb/Infix/index.html b/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Comb/Infix/index.html
index 4a440f5c..5baf1f6c 100644
--- a/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Comb/Infix/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Comb/Infix/index.html
@@ -1,2 +1,2 @@
 
-Infix (sidekick.Sidekick_arith_lra.Linear_expr.S.Comb.Infix)
Module Comb.Infix
Infix operations on combinations
This module defines usual operations on linear combinations, as infix operators to ease reading of complex computations.
val (+) : t -> t -> t
Addition between combinations.
val (-) : t -> t -> t
Substraction between combinations.
val (*) : C.t -> t -> t
Multiplication by a constant.

\ No newline at end of file
+Infix (sidekick.Sidekick_arith_lra.Linear_expr.S.Comb.Infix)
Module Comb.Infix
Infix operations on combinations
This module defines usual operations on linear combinations, as infix operators to ease reading of complex computations.
val (+) : t -> t -> t
Addition between combinations.
val (-) : t -> t -> t
Substraction between combinations.
val (*) : C.t -> t -> t
Multiplication by a constant.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Comb/index.html b/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Comb/index.html
index a502d051..12ee2f75 100644
--- a/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Comb/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Comb/index.html
@@ -1,2 +1,2 @@
 
-Comb (sidekick.Sidekick_arith_lra.Linear_expr.S.Comb)
Module S.Comb
Combinations.
This module defines linear combnations as mapping from variables to coefficients. This allows for very fast computations.
type t
The type of linear combinations.
val compare : t -> t -> int
Comparisons on linear combinations.
val pp : t Sidekick_util.Fmt.printer
Printer for linear combinations.
val is_empty : t -> bool
Is the given expression empty ?
Creation
val empty : t
The empty linear combination.
val monomial : C.t -> var -> t
monome n v creates the linear combination n * v
val monomial1 : var -> t
monome1 v creates the linear combination 1 * v
val as_singleton : t -> (C.t * var) option
as_singleton l returns Some (c,x) if l = c * x, None otherwise
val add : C.t -> var -> t -> t
add n v t adds the monome n * v to the combination t.
module Infix : sig ... end
Infix operations on combinations
Include the previous module.
include module type of Infix
Infix operations on combinations
This module defines usual operations on linear combinations, as infix operators to ease reading of complex computations.
val (+) : t -> t -> t
Addition between combinations.
val (-) : t -> t -> t
Substraction between combinations.
val (*) : C.t -> t -> t
Multiplication by a constant.
val iter : (var -> C.t -> unit) -> t -> unit
val of_list : (C.t * var) list -> t
val to_list : t -> (C.t * var) list
Converters to and from lists of monomes.
val of_map : C.t Var_map.t -> t
val to_map : t -> C.t Var_map.t
Semantics
val eval : subst -> t -> C.t
Evaluate a linear combination given a substitution for its variables. TODO: document potential exceptions raised ?

\ No newline at end of file
+Comb (sidekick.Sidekick_arith_lra.Linear_expr.S.Comb)
Module S.Comb
Combinations.
This module defines linear combnations as mapping from variables to coefficients. This allows for very fast computations.
type t
The type of linear combinations.
val compare : t -> t -> int
Comparisons on linear combinations.
val pp : t Sidekick_util.Fmt.printer
Printer for linear combinations.
val is_empty : t -> bool
Is the given expression empty ?
Creation
val empty : t
The empty linear combination.
val monomial : C.t -> var -> t
monome n v creates the linear combination n * v
val monomial1 : var -> t
monome1 v creates the linear combination 1 * v
val as_singleton : t -> (C.t * var) option
as_singleton l returns Some (c,x) if l = c * x, None otherwise
val add : C.t -> var -> t -> t
add n v t adds the monome n * v to the combination t.
module Infix : sig ... end
Infix operations on combinations
Include the previous module.
include module type of Infix
Infix operations on combinations
This module defines usual operations on linear combinations, as infix operators to ease reading of complex computations.
val (+) : t -> t -> t
Addition between combinations.
val (-) : t -> t -> t
Substraction between combinations.
val (*) : C.t -> t -> t
Multiplication by a constant.
val iter : (var -> C.t -> unit) -> t -> unit
val of_list : (C.t * var) list -> t
val to_list : t -> (C.t * var) list
Converters to and from lists of monomes.
val of_map : C.t Var_map.t -> t
val to_map : t -> C.t Var_map.t
Semantics
val eval : subst -> t -> C.t
Evaluate a linear combination given a substitution for its variables. TODO: document potential exceptions raised ?

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Constr/index.html b/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Constr/index.html
index bce9a8db..57e765cc 100644
--- a/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Constr/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Constr/index.html
@@ -1,2 +1,2 @@
 
-Constr (sidekick.Sidekick_arith_lra.Linear_expr.S.Constr)
Module S.Constr
Linear constraints.
Represents constraints on linear expressions.
type op = Predicate.t
Arithmetic comparison operators.
type t = {
expr : Expr.t;
op : op;
}
Linear constraints. Expressions are implicitly compared to zero.
val compare : t -> t -> int
Standard comparison function.
val pp : t Sidekick_util.Fmt.printer
Standard printing function.
val of_expr : Expr.t -> Predicate.t -> t
val make : Comb.t -> Predicate.t -> C.t -> t
Create a constraint from a linear expression/combination and a constant.
val geq : Comb.t -> C.t -> t
val leq : Comb.t -> C.t -> t
val gt : Comb.t -> C.t -> t
val lt : Comb.t -> C.t -> t
val eq : Comb.t -> C.t -> t
val neq : Comb.t -> C.t -> t
val geq0 : Expr.t -> t
val leq0 : Expr.t -> t
val gt0 : Expr.t -> t
val lt0 : Expr.t -> t
val eq0 : Expr.t -> t
val neq0 : Expr.t -> t
val op : t -> Predicate.t
val expr : t -> Expr.t
Extract the given part from a constraint.
val split : t -> Comb.t * Predicate.t * C.t
Split the linear combinations from the constant
val eval : subst -> t -> bool
Evaluate the given constraint under a substitution.

\ No newline at end of file
+Constr (sidekick.Sidekick_arith_lra.Linear_expr.S.Constr)
Module S.Constr
Linear constraints.
Represents constraints on linear expressions.
type op = Predicate.t
Arithmetic comparison operators.
type t = {
expr : Expr.t;
op : op;
}
Linear constraints. Expressions are implicitly compared to zero.
val compare : t -> t -> int
Standard comparison function.
val pp : t Sidekick_util.Fmt.printer
Standard printing function.
val of_expr : Expr.t -> Predicate.t -> t
val make : Comb.t -> Predicate.t -> C.t -> t
Create a constraint from a linear expression/combination and a constant.
val geq : Comb.t -> C.t -> t
val leq : Comb.t -> C.t -> t
val gt : Comb.t -> C.t -> t
val lt : Comb.t -> C.t -> t
val eq : Comb.t -> C.t -> t
val neq : Comb.t -> C.t -> t
val geq0 : Expr.t -> t
val leq0 : Expr.t -> t
val gt0 : Expr.t -> t
val lt0 : Expr.t -> t
val eq0 : Expr.t -> t
val neq0 : Expr.t -> t
val op : t -> Predicate.t
val expr : t -> Expr.t
Extract the given part from a constraint.
val split : t -> Comb.t * Predicate.t * C.t
Split the linear combinations from the constant
val eval : subst -> t -> bool
Evaluate the given constraint under a substitution.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Expr/Infix/index.html b/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Expr/Infix/index.html
index b8f03e00..70c0ea2f 100644
--- a/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Expr/Infix/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Expr/Infix/index.html
@@ -1,2 +1,2 @@
 
-Infix (sidekick.Sidekick_arith_lra.Linear_expr.S.Expr.Infix)
Module Expr.Infix
Infix operations on expressions
This module defines usual operations on linear expressions, as infix operators to ease reading of complex computations.
val (+) : t -> t -> t
Addition between expressions.
val (-) : t -> t -> t
Substraction between expressions.
val (*) : C.t -> t -> t
Multiplication by a constant.

\ No newline at end of file
+Infix (sidekick.Sidekick_arith_lra.Linear_expr.S.Expr.Infix)
Module Expr.Infix
Infix operations on expressions
This module defines usual operations on linear expressions, as infix operators to ease reading of complex computations.
val (+) : t -> t -> t
Addition between expressions.
val (-) : t -> t -> t
Substraction between expressions.
val (*) : C.t -> t -> t
Multiplication by a constant.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Expr/index.html b/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Expr/index.html
index 78537273..53e34804 100644
--- a/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Expr/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Expr/index.html
@@ -1,2 +1,2 @@
 
-Expr (sidekick.Sidekick_arith_lra.Linear_expr.S.Expr)
Module S.Expr
Linear expressions represent linear arithmetic expressions as a linear combination and a constant.
type t
The type of linear expressions.
val comb : t -> Comb.t
val const : t -> C.t
val is_zero : t -> bool
val is_const : t -> bool
val compare : t -> t -> int
Standard comparison function on expressions.
val pp : t Sidekick_util.Fmt.printer
Standard printing function on expressions.
val zero : t
The expression 2.
val of_const : C.t -> t
The constant expression.
val of_comb : Comb.t -> t
Combination without constant
val of_list : C.t -> (C.t * Var.t) list -> t
val make : Comb.t -> C.t -> t
make c n makes the linear expression c + n.
val monomial : C.t -> var -> t
val monomial1 : var -> t
module Infix : sig ... end
Infix operations on expressions
Include the previous module.
include module type of Infix
Infix operations on expressions
This module defines usual operations on linear expressions, as infix operators to ease reading of complex computations.
val (+) : t -> t -> t
Addition between expressions.
val (-) : t -> t -> t
Substraction between expressions.
val (*) : C.t -> t -> t
Multiplication by a constant.
Semantics
val eval : subst -> t -> C.t
Evaluate a linear expression given a substitution for its variables. TODO: document potential exceptions raised ?

\ No newline at end of file
+Expr (sidekick.Sidekick_arith_lra.Linear_expr.S.Expr)
Module S.Expr
Linear expressions represent linear arithmetic expressions as a linear combination and a constant.
type t
The type of linear expressions.
val comb : t -> Comb.t
val const : t -> C.t
val is_zero : t -> bool
val is_const : t -> bool
val compare : t -> t -> int
Standard comparison function on expressions.
val pp : t Sidekick_util.Fmt.printer
Standard printing function on expressions.
val zero : t
The expression 2.
val of_const : C.t -> t
The constant expression.
val of_comb : Comb.t -> t
Combination without constant
val of_list : C.t -> (C.t * Var.t) list -> t
val make : Comb.t -> C.t -> t
make c n makes the linear expression c + n.
val monomial : C.t -> var -> t
val monomial1 : var -> t
module Infix : sig ... end
Infix operations on expressions
Include the previous module.
include module type of Infix
Infix operations on expressions
This module defines usual operations on linear expressions, as infix operators to ease reading of complex computations.
val (+) : t -> t -> t
Addition between expressions.
val (-) : t -> t -> t
Substraction between expressions.
val (*) : C.t -> t -> t
Multiplication by a constant.
Semantics
val eval : subst -> t -> C.t
Evaluate a linear expression given a substitution for its variables. TODO: document potential exceptions raised ?

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Var/index.html b/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Var/index.html
index 22444c97..8a296bfc 100644
--- a/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Var/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/Var/index.html
@@ -1,2 +1,2 @@
 
-Var (sidekick.Sidekick_arith_lra.Linear_expr.S.Var)
Module S.Var
Variables used in expressions.
type t
Variable type.
val compare : t -> t -> int
Standard comparison function on variables.
val pp : t Sidekick_util.Fmt.printer
Printer for variables.
type lit
val pp_lit : lit Sidekick_util.Fmt.printer
val not_lit : lit -> lit option

\ No newline at end of file
+Var (sidekick.Sidekick_arith_lra.Linear_expr.S.Var)
Module S.Var
Variables used in expressions.
type t
Variable type.
val compare : t -> t -> int
Standard comparison function on variables.
val pp : t Sidekick_util.Fmt.printer
Printer for variables.
type lit
val pp_lit : lit Sidekick_util.Fmt.printer
val not_lit : lit -> lit option

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/index.html b/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/index.html
index f7902bcb..19140864 100644
--- a/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-S/index.html
@@ -1,2 +1,2 @@
 
-S (sidekick.Sidekick_arith_lra.Linear_expr.S)
Module type Linear_expr.S
module C : sig ... end
Coeficients used. Can be integers as well as rationals.
module Var : sig ... end
Variables used in expressions.
type var = Var.t
The type of variables appearing in expressions.
module Var_map : CCMap.S with type key = var
Maps from variables, used for expressions as well as substitutions.
type subst = C.t Var_map.t
Type for substitutions.
module Comb : sig ... end
Combinations.
Linear expressions.
module Expr : sig ... end
Linear expressions represent linear arithmetic expressions as a linear combination and a constant.
module Constr : sig ... end

\ No newline at end of file
+S (sidekick.Sidekick_arith_lra.Linear_expr.S)
Module type Linear_expr.S
module C : sig ... end
Coeficients used. Can be integers as well as rationals.
module Var : sig ... end
Variables used in expressions.
type var = Var.t
The type of variables appearing in expressions.
module Var_map : CCMap.S with type key = var
Maps from variables, used for expressions as well as substitutions.
type subst = C.t Var_map.t
Type for substitutions.
module Comb : sig ... end
Combinations.
Linear expressions.
module Expr : sig ... end
Linear expressions represent linear arithmetic expressions as a linear combination and a constant.
module Constr : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-VAR/index.html b/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-VAR/index.html
index f6e8f836..bcd77ec2 100644
--- a/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-VAR/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Linear_expr/module-type-VAR/index.html
@@ -1,2 +1,2 @@
 
-VAR (sidekick.Sidekick_arith_lra.Linear_expr.VAR)
Module type Linear_expr.VAR
type t
Variable type.
val compare : t -> t -> int
Standard comparison function on variables.
val pp : t Sidekick_util.Fmt.printer
Printer for variables.
type lit
val pp_lit : lit Sidekick_util.Fmt.printer
val not_lit : lit -> lit option

\ No newline at end of file
+VAR (sidekick.Sidekick_arith_lra.Linear_expr.VAR)
Module type Linear_expr.VAR
type t
Variable type.
val compare : t -> t -> int
Standard comparison function on variables.
val pp : t Sidekick_util.Fmt.printer
Printer for variables.
type lit
val pp_lit : lit Sidekick_util.Fmt.printer
val not_lit : lit -> lit option

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/Gensym/index.html b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/Gensym/index.html
index 3a8b04e4..28992caf 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/Gensym/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/Gensym/index.html
@@ -1,2 +1,2 @@
 
-Gensym (sidekick.Sidekick_arith_lra.Make.1-A.Gensym)
Module 1-A.Gensym
type t
val create : S.T.Term.store -> t
val tst : t -> S.T.Term.store
val copy : t -> t
val fresh_term : t -> pre:string -> S.T.Ty.t -> term
Make a fresh term of the given type

\ No newline at end of file
+Gensym (sidekick.Sidekick_arith_lra.Make.1-A.Gensym)
Module 1-A.Gensym
type t
val create : S.T.Term.store -> t
val tst : t -> S.T.Term.store
val copy : t -> t
val fresh_term : t -> pre:string -> S.T.Ty.t -> term
Make a fresh term of the given type

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/Q/index.html b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/Q/index.html
index 6b6a99a0..d28f554a 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/Q/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/Q/index.html
@@ -1,2 +1,2 @@
 
-Q (sidekick.Sidekick_arith_lra.Make.1-A.Q)
Module 1-A.Q
include Sidekick_arith.NUM
type t
val zero : t
val one : t
val minus_one : t
val sign : t -> int
val of_int : int -> t
include Sidekick_sigs.EQ with type t := t
val equal : t -> t -> bool
include Sidekick_sigs.ORD with type t := t
val compare : t -> t -> int
include Sidekick_sigs.HASH with type t := t
val hash : t -> int
include Sidekick_sigs.PRINT with type t := t
val pp : t CCFormat.printer
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
val (~-) : t -> t
val neg : t -> t
val min : t -> t -> t
val max : t -> t -> t
val (=) : t -> t -> bool
val (<>) : t -> t -> bool
val (>) : t -> t -> bool
val (>=) : t -> t -> bool
val (<) : t -> t -> bool
val (<=) : t -> t -> bool
type bigint
val (/) : t -> t -> t
val num : t -> bigint
val denum : t -> bigint
val pp_approx : int -> Stdlib.Format.formatter -> t -> unit
Pretty print rational with given amount of precision (for example as a floating point number)

\ No newline at end of file
+Q (sidekick.Sidekick_arith_lra.Make.1-A.Q)
Module 1-A.Q
include Sidekick_arith.NUM
type t
val zero : t
val one : t
val minus_one : t
val sign : t -> int
val of_int : int -> t
include Sidekick_sigs.EQ with type t := t
val equal : t -> t -> bool
include Sidekick_sigs.ORD with type t := t
val compare : t -> t -> int
include Sidekick_sigs.HASH with type t := t
val hash : t -> int
include Sidekick_sigs.PRINT with type t := t
val pp : t CCFormat.printer
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
val (~-) : t -> t
val neg : t -> t
val min : t -> t -> t
val max : t -> t -> t
val (=) : t -> t -> bool
val (<>) : t -> t -> bool
val (>) : t -> t -> bool
val (>=) : t -> t -> bool
val (<) : t -> t -> bool
val (<=) : t -> t -> bool
type bigint
val (/) : t -> t -> t
val num : t -> bigint
val denum : t -> bigint
val pp_approx : int -> Stdlib.Format.formatter -> t -> unit
Pretty print rational with given amount of precision (for example as a floating point number)

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Lit/index.html b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Lit/index.html
index 16fb985c..9417317a 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Lit/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_arith_lra.Make.1-A.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick.Sidekick_arith_lra.Make.1-A.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Model/index.html b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Model/index.html
index 512f5544..aa2be0bb 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Model/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Model/index.html
@@ -1,2 +1,2 @@
 
-Model (sidekick.Sidekick_arith_lra.Make.1-A.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Model (sidekick.Sidekick_arith_lra.Make.1-A.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/P/Step_vec/index.html b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/P/Step_vec/index.html
index d69a10d2..1f7ce35c 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/P/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_arith_lra.Make.1-A.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_arith_lra.Make.1-A.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/P/index.html b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/P/index.html
index c013c628..a67214b4 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/P/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_arith_lra.Make.1-A.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
+P (sidekick.Sidekick_arith_lra.Make.1-A.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/Actions/P/index.html b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/Actions/P/index.html
index 2e7af1cc..19cccdf0 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/Actions/P/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_arith_lra.Make.1-A.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_arith_lra.Make.1-A.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/Actions/index.html b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/Actions/index.html
index f876ca3e..96a038ce 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/Actions/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick.Sidekick_arith_lra.Make.1-A.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
+Actions (sidekick.Sidekick_arith_lra.Make.1-A.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/Expl/index.html b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/Expl/index.html
index 109e1a8b..24a56a2f 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/Expl/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick.Sidekick_arith_lra.Make.1-A.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick.Sidekick_arith_lra.Make.1-A.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/N/index.html b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/N/index.html
index 9c476527..d2081437 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/N/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick.Sidekick_arith_lra.Make.1-A.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
+N (sidekick.Sidekick_arith_lra.Make.1-A.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/P/index.html b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/P/index.html
index 8fcbf0a8..7d8bb0bb 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/P/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_arith_lra.Make.1-A.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_arith_lra.Make.1-A.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/index.html b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/index.html
index cb54334e..de68eea4 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/CC/index.html
@@ -1,4 +1,4 @@
 
-CC (sidekick.Sidekick_arith_lra.Make.1-A.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+CC (sidekick.Sidekick_arith_lra.Make.1-A.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Small | `Big ] -> term_store -> proof -> t
Create a new congruence closure.
  • parameter term_store 
    used to be able to create new terms. All terms interacting with this congruence closure must belong in this term state as well.
val allocate_bitfield : descr:string -> t -> N.bitfield
Allocate a new node field (see N.bitfield).
This field descriptor is henceforth reserved for all nodes in this congruence closure, and can be set using set_bitfield for each node individually. This can be used to efficiently store some metadata on nodes (e.g. "is there a numeric value in the class" or "is there a constructor term in the class").
There may be restrictions on how many distinct fields are allocated for a given congruence closure (e.g. at most Sys.int_size fields).
val get_bitfield : t -> N.bitfield -> N.t -> bool
Access the bit field of the given node
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
Set the bitfield for the node. This will be backtracked. See N.bitfield.
val on_pre_merge : t -> ev_on_pre_merge -> unit
Add a function to be called when two classes are merged
val on_post_merge : t -> ev_on_post_merge -> unit
Add a function to be called when two classes are merged
val on_new_term : t -> ev_on_new_term -> unit
Add a function to be called when a new node is created
val on_conflict : t -> ev_on_conflict -> unit
Called when the congruence closure finds a conflict
val on_propagate : t -> ev_on_propagate -> unit
Called when the congruence closure propagates a literal
val on_is_subterm : t -> ev_on_is_subterm -> unit
Called on terms that are subterms of function symbols
val set_as_lit : t -> N.t -> lit -> unit
map the given node to a literal.
val find_t : t -> term -> repr
Current representative of the term.
  • raises Not_found 
    if the term is not already add-ed.
val add_seq : t -> term Iter.t -> unit
Add a sequence of terms to the congruence closure
val all_classes : t -> repr Iter.t
All current classes. This is costly, only use if there is no other solution
val assert_lit : t -> lit -> unit
Given a literal, assume it in the congruence closure and propagate its consequences. Will be backtracked.
Useful for the theory combination or the SAT solver's functor
val assert_lits : t -> lit Iter.t -> unit
Addition of many literals
val explain_eq : t -> N.t -> N.t -> lit list
Explain why the two nodes are equal. Fails if they are not, in an unspecified way
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
Raise a conflict with the given explanation it must be a theory tautology that expl ==> absurd. To be used in theories.
val n_true : t -> N.t
Node for true
val n_false : t -> N.t
Node for false
val n_bool : t -> bool -> N.t
Node for either true or false
val merge : t -> N.t -> N.t -> Expl.t -> unit
Merge these two nodes given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val merge_t : t -> term -> term -> Expl.t -> unit
Shortcut for adding + merging
val check : t -> actions -> unit
Perform all pending operations done via assert_eq, assert_lit, etc. Will use the actions to propagate literals, declare conflicts, etc.
val new_merges : t -> bool
Called after check, returns true if some pairs of classes were merged.
val push_level : t -> unit
Push backtracking level
val pop_levels : t -> int -> unit
Restore to state n calls to push_level earlier. Used during backtracking.
val get_model : t -> N.t Iter.t Iter.t
get all the equivalence classes so they can be merged in the model

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/Simplify/index.html b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/Simplify/index.html
index aaf93cef..157ea91f 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/Simplify/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/Simplify/index.html
@@ -1,2 +1,2 @@
 
-Simplify (sidekick.Sidekick_arith_lra.Make.1-A.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
+Simplify (sidekick.Sidekick_arith_lra.Make.1-A.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/index.html b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/index.html
index f22b33d5..87674ba4 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/index.html
@@ -1,3 +1,3 @@
 
-Solver_internal (sidekick.Sidekick_arith_lra.Make.1-A.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
+Solver_internal (sidekick.Sidekick_arith_lra.Make.1-A.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
 P.t = proof and type P.lit = lit and type Actions.t = theory_actions
Congruence closure instance
val cc : t -> CC.t
Congruence closure for this solver
Simplifiers
module Simplify : sig ... end
Simplify terms
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
Add a simplifier hook for preprocessing.
val simplify_t : t -> term -> (term * proof_step) option
Simplify input term, returns Some u if some simplification occurred.
val simp_t : t -> term -> term * proof_step option
simp_t si t returns u even if no simplification occurred (in which case t == u syntactically). It emits |- t=u. (see simplifier)
Preprocessors
These preprocessors turn mixed, raw literals (possibly simplified) into literals suitable for reasoning. Typically some clauses are also added to the solver.
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
Actions available to the preprocessor
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
Given a term, try to preprocess it. Return None if it didn't change, or Some (u) if t=u. Can also add clauses to define new terms.
Preprocessing might transform terms to make them more amenable to reasoning, e.g. by removing boolean formulas via Tseitin encoding, adding clauses that encode their meaning in the same move.
  • parameter preprocess_actions 
    actions available during preprocessing.
val on_preprocess : t -> preprocess_hook -> unit
Add a hook that will be called when terms are preprocessed
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
Obtain preprocessor actions, from theory actions
hooks for the theory
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
Give a conflict clause to the solver
val push_decision : t -> theory_actions -> lit -> unit
Ask the SAT solver to decide the given literal in an extension of the current trail. This is useful for theory combination. If the SAT solver backtracks, this (potential) decision is removed and forgotten.
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
Add local clause to the SAT solver. This clause will be removed when the solver backtracks.
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
Add toplevel clause to the SAT solver. This clause will not be backtracked.
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
Create a literal. This automatically preprocesses the term.
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
Preprocess a term.
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
Add the given literal to the SAT solver, so it gets assigned a boolean value.
  • parameter default_pol 
    default polarity for the corresponding atom
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
Add the given (signed) bool term to the SAT solver, so it gets assigned a boolean value
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
Raise a conflict with the given congruence closure explanation. it must be a theory tautology that expl ==> absurd. To be used in theories.
val cc_find : t -> CC.N.t -> CC.N.t
Find representative of the node
val cc_are_equal : t -> term -> term -> bool
Are these two terms equal in the congruence closure?
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
Merge these two nodes in the congruence closure, given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
Merge these two terms in the congruence closure, given this explanation. See cc_merge
val cc_add_term : t -> term -> CC.N.t
Add/retrieve congruence closure node for this term. To be used in theories
val cc_mem_term : t -> term -> bool
Return true if the term is explicitly in the congruence closure. To be used in theories
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called before)
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called after)
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
Callback to add data on terms when they are added to the congruence closure
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
Callback for when a term is a subterm of another term in the congruence closure
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
Callback called on every CC conflict
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
Callback called on every CC propagation
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callbacked to be called with the slice of literals newly added on the trail.
This is called very often and should be efficient. It doesn't have to be complete, only correct. It's given only the slice of the trail consisting in new literals.
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callback to be called during the final check.
Must be complete (i.e. must raise a conflict if the set of literals is not satisfiable) and can be expensive. The function is given the whole trail.
Model production
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
A model-production hook. It takes the solver, a class, and returns a term for this class. For example, an arithmetic theory might detect that a class contains a numeric constant, and return this constant as a model value.
If no hook assigns a value to a class, a fake value is created for it.
val on_model_gen : t -> model_hook -> unit
Add a hook that will be called when a model is being produced

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
index c2101389..cf3c9aee 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
@@ -1,2 +1,2 @@
 
-PREPROCESS_ACTS (sidekick.Sidekick_arith_lra.Make.1-A.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
+PREPROCESS_ACTS (sidekick.Sidekick_arith_lra.Make.1-A.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/T/Fun/index.html b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/T/Fun/index.html
index a2109fb2..dd75d288 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_arith_lra.Make.1-A.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_arith_lra.Make.1-A.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/T/Term/index.html b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/T/Term/index.html
index c84b8451..8fe33360 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/T/Term/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_arith_lra.Make.1-A.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_arith_lra.Make.1-A.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/T/Ty/index.html b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/T/Ty/index.html
index d3527fd2..6f19e7e9 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_arith_lra.Make.1-A.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_arith_lra.Make.1-A.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/T/index.html b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/T/index.html
index 069f584c..f3baa0dd 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/T/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_arith_lra.Make.1-A.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_arith_lra.Make.1-A.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Unknown/index.html b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Unknown/index.html
index f6398228..b96ac61a 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Unknown/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/Unknown/index.html
@@ -1,2 +1,2 @@
 
-Unknown (sidekick.Sidekick_arith_lra.Make.1-A.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
+Unknown (sidekick.Sidekick_arith_lra.Make.1-A.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/index.html b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/index.html
index 125c7067..c23d0808 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/index.html
@@ -1,5 +1,5 @@
 
-S (sidekick.Sidekick_arith_lra.Make.1-A.S)
Module 1-A.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
+S (sidekick.Sidekick_arith_lra.Make.1-A.S)
Module 1-A.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
 ?push_level:('th -> unit) -> ?pop_levels:('th -> int -> unit) -> unit -> theory
Helper to create a theory.
module Model : sig ... end
Models
module Unknown : sig ... end
Main API
val stats : t -> Sidekick_util.Stat.t
val tst : t -> T.Term.store
val ty_st : t -> T.Ty.store
val proof : t -> proof
val create : ?stat:Sidekick_util.Stat.t -> ?size:[ `Big | `Tiny | `Small ] -> proof:proof -> theories:theory list ->
 T.Term.store -> T.Ty.store -> unit -> t
Create a new solver.
It needs a term state and a type state to manipulate terms and types. All terms and types interacting with this solver will need to come from these exact states.
  • parameter store_proof 
    if true, proofs from the SAT solver and theories are retained and potentially accessible after solve returns UNSAT.
  • parameter size 
    influences the size of initial allocations.
  • parameter theories 
    theories to load from the start. Other theories can be added using add_theory.
val add_theory : t -> theory -> unit
Add a theory to the solver. This should be called before any call to solve or to add_clause and the likes (otherwise the theory will have a partial view of the problem).
val add_theory_p : t -> 'a theory_p -> 'a
Add the given theory and obtain its state
val add_theory_l : t -> theory list -> unit
val mk_lit_t : t -> ?sign:bool -> term -> lit
mk_lit_t _ ~sign t returns lit', where lit' is preprocess(lit) and lit is an internal representation of ± t.
The proof of |- lit = lit' is directly added to the solver's proof.
val add_clause : t -> lit Sidekick_util.IArray.t -> proof_step -> unit
add_clause solver cs adds a boolean clause to the solver. Subsequent calls to solve will need to satisfy this clause.
val add_clause_l : t -> lit list -> proof_step -> unit
Add a clause to the solver, given as a list.
val assert_terms : t -> term list -> unit
Helper that turns each term into an atom, before adding the result to the solver as an assertion
val assert_term : t -> term -> unit
Helper that turns the term into an atom, before adding the result to the solver as a unit clause assertion
type res = 
| Sat of Model.t(*
Satisfiable
*)
| Unsat of {
unsat_core : unit -> lit Iter.t;(*
Unsat core (subset of assumptions), or empty
*)
unsat_proof_step : unit -> proof_step option;(*
Proof step for the empty clause
*)
}		(*
Unsatisfiable
*)
| Unknown of Unknown.t(*
Unknown, obtained after a timeout, memory limit, etc.
*)
Result of solving for the current set of clauses
val solve : ?on_exit:(unit -> unit) list -> ?check:bool -> ?on_progress:(t -> unit) ->
 assumptions:lit list -> t -> res
solve s checks the satisfiability of the clauses added so far to s.
  • parameter check 
    if true, the model is checked before returning.
  • parameter on_progress 
    called regularly during solving.
  • parameter assumptions 
    a set of atoms held to be true. The unsat core, if any, will be a subset of assumptions.
  • parameter on_exit 
    functions to be run before this returns
val pp_stats : t CCFormat.printer
Print some statistics. What it prints exactly is unspecified.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/module-type-THEORY/index.html b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/module-type-THEORY/index.html
index abbe876b..7d8c3d37 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/module-type-THEORY/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/S/module-type-THEORY/index.html
@@ -1,2 +1,2 @@
 
-THEORY (sidekick.Sidekick_arith_lra.Make.1-A.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
+THEORY (sidekick.Sidekick_arith_lra.Make.1-A.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/index.html b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/index.html
index 86a0fd6a..642626f5 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/argument-1-A/index.html
@@ -1,2 +1,2 @@
 
-A (sidekick.Sidekick_arith_lra.Make.1-A)
Parameter Make.1-A
module Q : RATIONAL
type term = S.T.Term.t
type ty = S.T.Ty.t
val view_as_lra : term -> (Q.t, term) lra_view
Project the term into the theory view
val mk_bool : S.T.Term.store -> bool -> term
val mk_lra : S.T.Term.store -> (Q.t, term) lra_view -> term
Make a term from the given theory view
val ty_lra : S.T.Term.store -> ty
val mk_eq : S.T.Term.store -> term -> term -> term
syntactic equality
val has_ty_real : term -> bool
Does this term have the type Real
val lemma_lra : S.Lit.t Iter.t -> S.P.proof_rule
module Gensym : sig ... end

\ No newline at end of file
+A (sidekick.Sidekick_arith_lra.Make.1-A)
Parameter Make.1-A
module Q : RATIONAL
type term = S.T.Term.t
type ty = S.T.Ty.t
val view_as_lra : term -> (Q.t, term) lra_view
Project the term into the theory view
val mk_bool : S.T.Term.store -> bool -> term
val mk_lra : S.T.Term.store -> (Q.t, term) lra_view -> term
Make a term from the given theory view
val ty_lra : S.T.Term.store -> ty
val mk_eq : S.T.Term.store -> term -> term -> term
syntactic equality
val has_ty_real : term -> bool
Does this term have the type Real
val lemma_lra : S.Lit.t Iter.t -> S.P.proof_rule
module Gensym : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Make/index.html b/dev/sidekick/Sidekick_arith_lra/Make/index.html
index d31ceda9..022d5ec0 100644
--- a/dev/sidekick/Sidekick_arith_lra/Make/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Make/index.html
@@ -1,2 +1,2 @@
 
-Make (sidekick.Sidekick_arith_lra.Make)
Module Sidekick_arith_lra.Make
Parameters
module A : ARG
Signature
module A = A
type state
val theory : A.S.theory

\ No newline at end of file
+Make (sidekick.Sidekick_arith_lra.Make)
Module Sidekick_arith_lra.Make
Parameters
module A : ARG
Signature
module A = A
type state
val theory : A.S.theory

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Predicate/index.html b/dev/sidekick/Sidekick_arith_lra/Predicate/index.html
index 2c6999e1..bfdec209 100644
--- a/dev/sidekick/Sidekick_arith_lra/Predicate/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Predicate/index.html
@@ -1,2 +1,2 @@
 
-Predicate (sidekick.Sidekick_arith_lra.Predicate)
Module Sidekick_arith_lra.Predicate
type t = 
| Leq
| Geq
| Lt
| Gt
| Eq
| Neq
val neg : t -> t
val neg_sign : t -> t
val to_string : t -> string
val pp : Sidekick_util.Fmt.t -> t -> unit

\ No newline at end of file
+Predicate (sidekick.Sidekick_arith_lra.Predicate)
Module Sidekick_arith_lra.Predicate
type t = 
| Leq
| Geq
| Lt
| Gt
| Eq
| Neq
val neg : t -> t
val neg_sign : t -> t
val to_string : t -> string
val pp : Sidekick_util.Fmt.t -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/Constraint/index.html b/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/Constraint/index.html
index dc169699..849e5666 100644
--- a/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/Constraint/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/Constraint/index.html
@@ -1,2 +1,2 @@
 
-Constraint (sidekick.Sidekick_arith_lra.Simplex2.Make.Constraint)
Module Make.Constraint
type op = Op.t
type t = {
op : op;
lhs : V.t;
rhs : num;
}
A constraint is the comparison of a variable to a constant.
val mk : V.t -> op -> num -> t
val leq : V.t -> num -> t
val lt : V.t -> num -> t
val geq : V.t -> num -> t
val gt : V.t -> num -> t
val pp : t Sidekick_util.Fmt.printer

\ No newline at end of file
+Constraint (sidekick.Sidekick_arith_lra.Simplex2.Make.Constraint)
Module Make.Constraint
type op = Op.t
type t = {
op : op;
lhs : V.t;
rhs : num;
}
A constraint is the comparison of a variable to a constant.
val mk : V.t -> op -> num -> t
val leq : V.t -> num -> t
val lt : V.t -> num -> t
val geq : V.t -> num -> t
val gt : V.t -> num -> t
val pp : t Sidekick_util.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/Subst/index.html b/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/Subst/index.html
index 6a55bb7b..f0fa4551 100644
--- a/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/Subst/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/Subst/index.html
@@ -1,2 +1,2 @@
 
-Subst (sidekick.Sidekick_arith_lra.Simplex2.Make.Subst)
Module Make.Subst
type t = num V_map.t
val eval : t -> V.t -> Q.t
val pp : t Sidekick_util.Fmt.printer
val to_string : t -> string

\ No newline at end of file
+Subst (sidekick.Sidekick_arith_lra.Simplex2.Make.Subst)
Module Make.Subst
type t = num V_map.t
val eval : t -> V.t -> Q.t
val pp : t Sidekick_util.Fmt.printer
val to_string : t -> string

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/Unsat_cert/index.html b/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/Unsat_cert/index.html
index 46f308a3..c32d0ea2 100644
--- a/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/Unsat_cert/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/Unsat_cert/index.html
@@ -1,2 +1,2 @@
 
-Unsat_cert (sidekick.Sidekick_arith_lra.Simplex2.Make.Unsat_cert)
Module Make.Unsat_cert
type t = unsat_cert
val lits : t -> V.lit list
val pp : t Sidekick_util.Fmt.printer

\ No newline at end of file
+Unsat_cert (sidekick.Sidekick_arith_lra.Simplex2.Make.Unsat_cert)
Module Make.Unsat_cert
type t = unsat_cert
val lits : t -> V.lit list
val pp : t Sidekick_util.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/argument-1-Q/index.html b/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/argument-1-Q/index.html
index e6113d63..47c15b74 100644
--- a/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/argument-1-Q/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/argument-1-Q/index.html
@@ -1,2 +1,2 @@
 
-Q (sidekick.Sidekick_arith_lra.Simplex2.Make.1-Q)
Parameter Make.1-Q
include Sidekick_arith.NUM
type t
val zero : t
val one : t
val minus_one : t
val sign : t -> int
val of_int : int -> t
include Sidekick_sigs.EQ with type t := t
val equal : t -> t -> bool
include Sidekick_sigs.ORD with type t := t
val compare : t -> t -> int
include Sidekick_sigs.HASH with type t := t
val hash : t -> int
include Sidekick_sigs.PRINT with type t := t
val pp : t CCFormat.printer
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
val (~-) : t -> t
val neg : t -> t
val min : t -> t -> t
val max : t -> t -> t
val (=) : t -> t -> bool
val (<>) : t -> t -> bool
val (>) : t -> t -> bool
val (>=) : t -> t -> bool
val (<) : t -> t -> bool
val (<=) : t -> t -> bool
type bigint
val (/) : t -> t -> t
val num : t -> bigint
val denum : t -> bigint
val pp_approx : int -> Stdlib.Format.formatter -> t -> unit
Pretty print rational with given amount of precision (for example as a floating point number)

\ No newline at end of file
+Q (sidekick.Sidekick_arith_lra.Simplex2.Make.1-Q)
Parameter Make.1-Q
include Sidekick_arith.NUM
type t
val zero : t
val one : t
val minus_one : t
val sign : t -> int
val of_int : int -> t
include Sidekick_sigs.EQ with type t := t
val equal : t -> t -> bool
include Sidekick_sigs.ORD with type t := t
val compare : t -> t -> int
include Sidekick_sigs.HASH with type t := t
val hash : t -> int
include Sidekick_sigs.PRINT with type t := t
val pp : t CCFormat.printer
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
val (~-) : t -> t
val neg : t -> t
val min : t -> t -> t
val max : t -> t -> t
val (=) : t -> t -> bool
val (<>) : t -> t -> bool
val (>) : t -> t -> bool
val (>=) : t -> t -> bool
val (<) : t -> t -> bool
val (<=) : t -> t -> bool
type bigint
val (/) : t -> t -> t
val num : t -> bigint
val denum : t -> bigint
val pp_approx : int -> Stdlib.Format.formatter -> t -> unit
Pretty print rational with given amount of precision (for example as a floating point number)

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/argument-2-Var/index.html b/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/argument-2-Var/index.html
index a29b6951..156f10af 100644
--- a/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/argument-2-Var/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/argument-2-Var/index.html
@@ -1,2 +1,2 @@
 
-Var (sidekick.Sidekick_arith_lra.Simplex2.Make.2-Var)
Parameter Make.2-Var
type t
Variable type.
val compare : t -> t -> int
Standard comparison function on variables.
val pp : t Sidekick_util.Fmt.printer
Printer for variables.
type lit
val pp_lit : lit Sidekick_util.Fmt.printer
val not_lit : lit -> lit option

\ No newline at end of file
+Var (sidekick.Sidekick_arith_lra.Simplex2.Make.2-Var)
Parameter Make.2-Var
type t
Variable type.
val compare : t -> t -> int
Standard comparison function on variables.
val pp : t Sidekick_util.Fmt.printer
Printer for variables.
type lit
val pp_lit : lit Sidekick_util.Fmt.printer
val not_lit : lit -> lit option

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/index.html b/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/index.html
index f26e8e48..243af23d 100644
--- a/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Simplex2/Make/index.html
@@ -1,2 +1,2 @@
 
-Make (sidekick.Sidekick_arith_lra.Simplex2.Make)
Module Simplex2.Make
Parameters
module Q : RATIONAL
module Var : VAR
Signature
module V = Var
module V_map : CCMap.S with type key = V.t
module Q = Q
type num = Q.t
Numbers
module Constraint : sig ... end
module Subst : sig ... end
type t
val create : ?stat:Sidekick_util.Stat.t -> unit -> t
Create a new simplex.
val push_level : t -> unit
val pop_levels : t -> int -> unit
val define : t -> V.t -> (num * V.t) list -> unit
Define a basic variable in terms of other variables. This is useful to "name" a linear expression and get back a variable that can be used in a Constraint.t
type unsat_cert
module Unsat_cert : sig ... end
exception E_unsat of Unsat_cert.t
type ev_on_propagate = V.lit -> reason:V.lit list -> unit
val add_var : t -> V.t -> unit
Make sure the variable exists in the simplex.
val add_constraint : on_propagate:ev_on_propagate -> t -> Constraint.t -> V.lit -> unit
Add a constraint to the simplex.
  • raises Unsat 
    if it's immediately obvious that this is not satisfiable.
val declare_bound : t -> Constraint.t -> V.lit -> unit
Declare that this constraint exists, so we can possibly propagate it. Unlike add_constraint this does NOT assert that the constraint is true
val check_exn : on_propagate:(V.lit -> reason:V.lit list -> unit) -> t -> unit
Check the whole simplex for satisfiability.
  • parameter on_propagate 
    is called with arguments lit, reason whenever reason => lit is found to be true by the simplex.
  • raises Unsat 
    if the constraints are not satisfiable.
type result = 
| Sat of Subst.t
| Unsat of Unsat_cert.t
val check : on_propagate:(V.lit -> reason:V.lit list -> unit) -> t -> result
Call check_exn and return a model or a proof of unsat.

\ No newline at end of file
+Make (sidekick.Sidekick_arith_lra.Simplex2.Make)
Module Simplex2.Make
Parameters
module Q : RATIONAL
module Var : VAR
Signature
module V = Var
module V_map : CCMap.S with type key = V.t
module Q = Q
type num = Q.t
Numbers
module Constraint : sig ... end
module Subst : sig ... end
type t
val create : ?stat:Sidekick_util.Stat.t -> unit -> t
Create a new simplex.
val push_level : t -> unit
val pop_levels : t -> int -> unit
val define : t -> V.t -> (num * V.t) list -> unit
Define a basic variable in terms of other variables. This is useful to "name" a linear expression and get back a variable that can be used in a Constraint.t
type unsat_cert
module Unsat_cert : sig ... end
exception E_unsat of Unsat_cert.t
type ev_on_propagate = V.lit -> reason:V.lit list -> unit
val add_var : t -> V.t -> unit
Make sure the variable exists in the simplex.
val add_constraint : on_propagate:ev_on_propagate -> t -> Constraint.t -> V.lit -> unit
Add a constraint to the simplex.
  • raises Unsat 
    if it's immediately obvious that this is not satisfiable.
val declare_bound : t -> Constraint.t -> V.lit -> unit
Declare that this constraint exists, so we can possibly propagate it. Unlike add_constraint this does NOT assert that the constraint is true
val check_exn : on_propagate:(V.lit -> reason:V.lit list -> unit) -> t -> unit
Check the whole simplex for satisfiability.
  • parameter on_propagate 
    is called with arguments lit, reason whenever reason => lit is found to be true by the simplex.
  • raises Unsat 
    if the constraints are not satisfiable.
type result = 
| Sat of Subst.t
| Unsat of Unsat_cert.t
val check : on_propagate:(V.lit -> reason:V.lit list -> unit) -> t -> result
Call check_exn and return a model or a proof of unsat.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Simplex2/Op/index.html b/dev/sidekick/Sidekick_arith_lra/Simplex2/Op/index.html
index 59269ab3..163d56cb 100644
--- a/dev/sidekick/Sidekick_arith_lra/Simplex2/Op/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Simplex2/Op/index.html
@@ -1,2 +1,2 @@
 
-Op (sidekick.Sidekick_arith_lra.Simplex2.Op)
Module Simplex2.Op
Basic operator
type t = 
| Leq
| Lt
| Geq
| Gt
val neg_sign : t -> t
val not_ : t -> t
val to_string : t -> string
val pp : Sidekick_util.Fmt.t -> t -> unit

\ No newline at end of file
+Op (sidekick.Sidekick_arith_lra.Simplex2.Op)
Module Simplex2.Op
Basic operator
type t = 
| Leq
| Lt
| Geq
| Gt
val neg_sign : t -> t
val not_ : t -> t
val to_string : t -> string
val pp : Sidekick_util.Fmt.t -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Simplex2/index.html b/dev/sidekick/Sidekick_arith_lra/Simplex2/index.html
index 66262a80..84d2a479 100644
--- a/dev/sidekick/Sidekick_arith_lra/Simplex2/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Simplex2/index.html
@@ -1,2 +1,2 @@
 
-Simplex2 (sidekick.Sidekick_arith_lra.Simplex2)
Module Sidekick_arith_lra.Simplex2
Fast Simplex for CDCL(T)
We follow the paper "Integrating Simplex with DPLL(T )" from de Moura and Dutertre.
module type RATIONAL = Sidekick_arith.RATIONAL
module type VAR = sig ... end
module Op : sig ... end
module type S = sig ... end
module Make (Q : RATIONAL) (Var : VAR) : S with module V = Var and module Q = Q

\ No newline at end of file
+Simplex2 (sidekick.Sidekick_arith_lra.Simplex2)
Module Sidekick_arith_lra.Simplex2
Fast Simplex for CDCL(T)
We follow the paper "Integrating Simplex with DPLL(T )" from de Moura and Dutertre.
module type RATIONAL = Sidekick_arith.RATIONAL
module type VAR = sig ... end
module Op : sig ... end
module type S = sig ... end
module Make (Q : RATIONAL) (Var : VAR) : S with module V = Var and module Q = Q

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/Constraint/index.html b/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/Constraint/index.html
index ec039107..bc1242b8 100644
--- a/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/Constraint/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/Constraint/index.html
@@ -1,2 +1,2 @@
 
-Constraint (sidekick.Sidekick_arith_lra.Simplex2.S.Constraint)
Module S.Constraint
type op = Op.t
type t = {
op : op;
lhs : V.t;
rhs : num;
}
A constraint is the comparison of a variable to a constant.
val mk : V.t -> op -> num -> t
val leq : V.t -> num -> t
val lt : V.t -> num -> t
val geq : V.t -> num -> t
val gt : V.t -> num -> t
val pp : t Sidekick_util.Fmt.printer

\ No newline at end of file
+Constraint (sidekick.Sidekick_arith_lra.Simplex2.S.Constraint)
Module S.Constraint
type op = Op.t
type t = {
op : op;
lhs : V.t;
rhs : num;
}
A constraint is the comparison of a variable to a constant.
val mk : V.t -> op -> num -> t
val leq : V.t -> num -> t
val lt : V.t -> num -> t
val geq : V.t -> num -> t
val gt : V.t -> num -> t
val pp : t Sidekick_util.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/Q/index.html b/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/Q/index.html
index 4b71369c..575f2568 100644
--- a/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/Q/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/Q/index.html
@@ -1,2 +1,2 @@
 
-Q (sidekick.Sidekick_arith_lra.Simplex2.S.Q)
Module S.Q
include Sidekick_arith.NUM
type t
val zero : t
val one : t
val minus_one : t
val sign : t -> int
val of_int : int -> t
include Sidekick_sigs.EQ with type t := t
val equal : t -> t -> bool
include Sidekick_sigs.ORD with type t := t
val compare : t -> t -> int
include Sidekick_sigs.HASH with type t := t
val hash : t -> int
include Sidekick_sigs.PRINT with type t := t
val pp : t CCFormat.printer
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
val (~-) : t -> t
val neg : t -> t
val min : t -> t -> t
val max : t -> t -> t
val (=) : t -> t -> bool
val (<>) : t -> t -> bool
val (>) : t -> t -> bool
val (>=) : t -> t -> bool
val (<) : t -> t -> bool
val (<=) : t -> t -> bool
type bigint
val (/) : t -> t -> t
val num : t -> bigint
val denum : t -> bigint
val pp_approx : int -> Stdlib.Format.formatter -> t -> unit
Pretty print rational with given amount of precision (for example as a floating point number)

\ No newline at end of file
+Q (sidekick.Sidekick_arith_lra.Simplex2.S.Q)
Module S.Q
include Sidekick_arith.NUM
type t
val zero : t
val one : t
val minus_one : t
val sign : t -> int
val of_int : int -> t
include Sidekick_sigs.EQ with type t := t
val equal : t -> t -> bool
include Sidekick_sigs.ORD with type t := t
val compare : t -> t -> int
include Sidekick_sigs.HASH with type t := t
val hash : t -> int
include Sidekick_sigs.PRINT with type t := t
val pp : t CCFormat.printer
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
val (~-) : t -> t
val neg : t -> t
val min : t -> t -> t
val max : t -> t -> t
val (=) : t -> t -> bool
val (<>) : t -> t -> bool
val (>) : t -> t -> bool
val (>=) : t -> t -> bool
val (<) : t -> t -> bool
val (<=) : t -> t -> bool
type bigint
val (/) : t -> t -> t
val num : t -> bigint
val denum : t -> bigint
val pp_approx : int -> Stdlib.Format.formatter -> t -> unit
Pretty print rational with given amount of precision (for example as a floating point number)

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/Subst/index.html b/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/Subst/index.html
index 2146794d..7e61d3a9 100644
--- a/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/Subst/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/Subst/index.html
@@ -1,2 +1,2 @@
 
-Subst (sidekick.Sidekick_arith_lra.Simplex2.S.Subst)
Module S.Subst
type t = num V_map.t
val eval : t -> V.t -> Q.t
val pp : t Sidekick_util.Fmt.printer
val to_string : t -> string

\ No newline at end of file
+Subst (sidekick.Sidekick_arith_lra.Simplex2.S.Subst)
Module S.Subst
type t = num V_map.t
val eval : t -> V.t -> Q.t
val pp : t Sidekick_util.Fmt.printer
val to_string : t -> string

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/Unsat_cert/index.html b/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/Unsat_cert/index.html
index 76585426..dc9bb91b 100644
--- a/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/Unsat_cert/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/Unsat_cert/index.html
@@ -1,2 +1,2 @@
 
-Unsat_cert (sidekick.Sidekick_arith_lra.Simplex2.S.Unsat_cert)
Module S.Unsat_cert
type t = unsat_cert
val lits : t -> V.lit list
val pp : t Sidekick_util.Fmt.printer

\ No newline at end of file
+Unsat_cert (sidekick.Sidekick_arith_lra.Simplex2.S.Unsat_cert)
Module S.Unsat_cert
type t = unsat_cert
val lits : t -> V.lit list
val pp : t Sidekick_util.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/V/index.html b/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/V/index.html
index ce18a124..b53427da 100644
--- a/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/V/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/V/index.html
@@ -1,2 +1,2 @@
 
-V (sidekick.Sidekick_arith_lra.Simplex2.S.V)
Module S.V
type t
Variable type.
val compare : t -> t -> int
Standard comparison function on variables.
val pp : t Sidekick_util.Fmt.printer
Printer for variables.
type lit
val pp_lit : lit Sidekick_util.Fmt.printer
val not_lit : lit -> lit option

\ No newline at end of file
+V (sidekick.Sidekick_arith_lra.Simplex2.S.V)
Module S.V
type t
Variable type.
val compare : t -> t -> int
Standard comparison function on variables.
val pp : t Sidekick_util.Fmt.printer
Printer for variables.
type lit
val pp_lit : lit Sidekick_util.Fmt.printer
val not_lit : lit -> lit option

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/index.html b/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/index.html
index 3895bab1..e343c3db 100644
--- a/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-S/index.html
@@ -1,2 +1,2 @@
 
-S (sidekick.Sidekick_arith_lra.Simplex2.S)
Module type Simplex2.S
module V : VAR
module V_map : CCMap.S with type key = V.t
module Q : RATIONAL
type num = Q.t
Numbers
module Constraint : sig ... end
module Subst : sig ... end
type t
val create : ?stat:Sidekick_util.Stat.t -> unit -> t
Create a new simplex.
val push_level : t -> unit
val pop_levels : t -> int -> unit
val define : t -> V.t -> (num * V.t) list -> unit
Define a basic variable in terms of other variables. This is useful to "name" a linear expression and get back a variable that can be used in a Constraint.t
type unsat_cert
module Unsat_cert : sig ... end
exception E_unsat of Unsat_cert.t
type ev_on_propagate = V.lit -> reason:V.lit list -> unit
val add_var : t -> V.t -> unit
Make sure the variable exists in the simplex.
val add_constraint : on_propagate:ev_on_propagate -> t -> Constraint.t -> V.lit -> unit
Add a constraint to the simplex.
  • raises Unsat 
    if it's immediately obvious that this is not satisfiable.
val declare_bound : t -> Constraint.t -> V.lit -> unit
Declare that this constraint exists, so we can possibly propagate it. Unlike add_constraint this does NOT assert that the constraint is true
val check_exn : on_propagate:(V.lit -> reason:V.lit list -> unit) -> t -> unit
Check the whole simplex for satisfiability.
  • parameter on_propagate 
    is called with arguments lit, reason whenever reason => lit is found to be true by the simplex.
  • raises Unsat 
    if the constraints are not satisfiable.
type result = 
| Sat of Subst.t
| Unsat of Unsat_cert.t
val check : on_propagate:(V.lit -> reason:V.lit list -> unit) -> t -> result
Call check_exn and return a model or a proof of unsat.

\ No newline at end of file
+S (sidekick.Sidekick_arith_lra.Simplex2.S)
Module type Simplex2.S
module V : VAR
module V_map : CCMap.S with type key = V.t
module Q : RATIONAL
type num = Q.t
Numbers
module Constraint : sig ... end
module Subst : sig ... end
type t
val create : ?stat:Sidekick_util.Stat.t -> unit -> t
Create a new simplex.
val push_level : t -> unit
val pop_levels : t -> int -> unit
val define : t -> V.t -> (num * V.t) list -> unit
Define a basic variable in terms of other variables. This is useful to "name" a linear expression and get back a variable that can be used in a Constraint.t
type unsat_cert
module Unsat_cert : sig ... end
exception E_unsat of Unsat_cert.t
type ev_on_propagate = V.lit -> reason:V.lit list -> unit
val add_var : t -> V.t -> unit
Make sure the variable exists in the simplex.
val add_constraint : on_propagate:ev_on_propagate -> t -> Constraint.t -> V.lit -> unit
Add a constraint to the simplex.
  • raises Unsat 
    if it's immediately obvious that this is not satisfiable.
val declare_bound : t -> Constraint.t -> V.lit -> unit
Declare that this constraint exists, so we can possibly propagate it. Unlike add_constraint this does NOT assert that the constraint is true
val check_exn : on_propagate:(V.lit -> reason:V.lit list -> unit) -> t -> unit
Check the whole simplex for satisfiability.
  • parameter on_propagate 
    is called with arguments lit, reason whenever reason => lit is found to be true by the simplex.
  • raises Unsat 
    if the constraints are not satisfiable.
type result = 
| Sat of Subst.t
| Unsat of Unsat_cert.t
val check : on_propagate:(V.lit -> reason:V.lit list -> unit) -> t -> result
Call check_exn and return a model or a proof of unsat.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-VAR/index.html b/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-VAR/index.html
index 060cf090..70904f95 100644
--- a/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-VAR/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/Simplex2/module-type-VAR/index.html
@@ -1,2 +1,2 @@
 
-VAR (sidekick.Sidekick_arith_lra.Simplex2.VAR)
Module type Simplex2.VAR
type t
Variable type.
val compare : t -> t -> int
Standard comparison function on variables.
val pp : t Sidekick_util.Fmt.printer
Printer for variables.
type lit
val pp_lit : lit Sidekick_util.Fmt.printer
val not_lit : lit -> lit option

\ No newline at end of file
+VAR (sidekick.Sidekick_arith_lra.Simplex2.VAR)
Module type Simplex2.VAR
type t
Variable type.
val compare : t -> t -> int
Standard comparison function on variables.
val pp : t Sidekick_util.Fmt.printer
Printer for variables.
type lit
val pp_lit : lit Sidekick_util.Fmt.printer
val not_lit : lit -> lit option

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/index.html b/dev/sidekick/Sidekick_arith_lra/index.html
index 19046f3e..cfd9dbb1 100644
--- a/dev/sidekick/Sidekick_arith_lra/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_arith_lra (sidekick.Sidekick_arith_lra)
Module Sidekick_arith_lra
Linear Rational Arithmetic
module Simplex2 : sig ... end
module Predicate : sig ... end
module Linear_expr : sig ... end
Arithmetic expressions
module type RATIONAL = Sidekick_arith.RATIONAL
module S_op = Simplex2.Op
type pred = Predicate.t = 
| Leq
| Geq
| Lt
| Gt
| Eq
| Neq
type op = 
| Plus
| Minus
type ('num, 'a) lra_view = 
| LRA_pred of pred * 'a * 'a
| LRA_op of op * 'a * 'a
| LRA_mult of 'num * 'a
| LRA_const of 'num
| LRA_simplex_var of 'a
| LRA_simplex_pred of 'a * S_op.t * 'num
| LRA_other of 'a
val map_view : ('a -> 'b) -> ('c, 'a) lra_view -> ('c, 'b) lra_view
module type ARG = sig ... end
module type S = sig ... end
module Make (A : ARG) : S with module A = A

\ No newline at end of file
+Sidekick_arith_lra (sidekick.Sidekick_arith_lra)
Module Sidekick_arith_lra
Linear Rational Arithmetic
module Simplex2 : sig ... end
module Predicate : sig ... end
module Linear_expr : sig ... end
Arithmetic expressions
module type RATIONAL = Sidekick_arith.RATIONAL
module S_op = Simplex2.Op
type pred = Predicate.t = 
| Leq
| Geq
| Lt
| Gt
| Eq
| Neq
type op = 
| Plus
| Minus
type ('num, 'a) lra_view = 
| LRA_pred of pred * 'a * 'a
| LRA_op of op * 'a * 'a
| LRA_mult of 'num * 'a
| LRA_const of 'num
| LRA_simplex_var of 'a
| LRA_simplex_pred of 'a * S_op.t * 'num
| LRA_other of 'a
val map_view : ('a -> 'b) -> ('c, 'a) lra_view -> ('c, 'b) lra_view
module type ARG = sig ... end
module type S = sig ... end
module Make (A : ARG) : S with module A = A

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/Gensym/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/Gensym/index.html
index a6128172..b285de26 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/Gensym/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/Gensym/index.html
@@ -1,2 +1,2 @@
 
-Gensym (sidekick.Sidekick_arith_lra.ARG.Gensym)
Module ARG.Gensym
type t
val create : S.T.Term.store -> t
val tst : t -> S.T.Term.store
val copy : t -> t
val fresh_term : t -> pre:string -> S.T.Ty.t -> term
Make a fresh term of the given type

\ No newline at end of file
+Gensym (sidekick.Sidekick_arith_lra.ARG.Gensym)
Module ARG.Gensym
type t
val create : S.T.Term.store -> t
val tst : t -> S.T.Term.store
val copy : t -> t
val fresh_term : t -> pre:string -> S.T.Ty.t -> term
Make a fresh term of the given type

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/Q/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/Q/index.html
index de639ce5..2396c929 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/Q/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/Q/index.html
@@ -1,2 +1,2 @@
 
-Q (sidekick.Sidekick_arith_lra.ARG.Q)
Module ARG.Q
include Sidekick_arith.NUM
type t
val zero : t
val one : t
val minus_one : t
val sign : t -> int
val of_int : int -> t
include Sidekick_sigs.EQ with type t := t
val equal : t -> t -> bool
include Sidekick_sigs.ORD with type t := t
val compare : t -> t -> int
include Sidekick_sigs.HASH with type t := t
val hash : t -> int
include Sidekick_sigs.PRINT with type t := t
val pp : t CCFormat.printer
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
val (~-) : t -> t
val neg : t -> t
val min : t -> t -> t
val max : t -> t -> t
val (=) : t -> t -> bool
val (<>) : t -> t -> bool
val (>) : t -> t -> bool
val (>=) : t -> t -> bool
val (<) : t -> t -> bool
val (<=) : t -> t -> bool
type bigint
val (/) : t -> t -> t
val num : t -> bigint
val denum : t -> bigint
val pp_approx : int -> Stdlib.Format.formatter -> t -> unit
Pretty print rational with given amount of precision (for example as a floating point number)

\ No newline at end of file
+Q (sidekick.Sidekick_arith_lra.ARG.Q)
Module ARG.Q
include Sidekick_arith.NUM
type t
val zero : t
val one : t
val minus_one : t
val sign : t -> int
val of_int : int -> t
include Sidekick_sigs.EQ with type t := t
val equal : t -> t -> bool
include Sidekick_sigs.ORD with type t := t
val compare : t -> t -> int
include Sidekick_sigs.HASH with type t := t
val hash : t -> int
include Sidekick_sigs.PRINT with type t := t
val pp : t CCFormat.printer
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
val (~-) : t -> t
val neg : t -> t
val min : t -> t -> t
val max : t -> t -> t
val (=) : t -> t -> bool
val (<>) : t -> t -> bool
val (>) : t -> t -> bool
val (>=) : t -> t -> bool
val (<) : t -> t -> bool
val (<=) : t -> t -> bool
type bigint
val (/) : t -> t -> t
val num : t -> bigint
val denum : t -> bigint
val pp_approx : int -> Stdlib.Format.formatter -> t -> unit
Pretty print rational with given amount of precision (for example as a floating point number)

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Lit/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Lit/index.html
index a2385f34..27687783 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Lit/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_arith_lra.ARG.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick.Sidekick_arith_lra.ARG.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Model/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Model/index.html
index b5caf8a8..dafa506c 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Model/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Model/index.html
@@ -1,2 +1,2 @@
 
-Model (sidekick.Sidekick_arith_lra.ARG.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Model (sidekick.Sidekick_arith_lra.ARG.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/P/Step_vec/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/P/Step_vec/index.html
index 26c5df25..033a13c9 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/P/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_arith_lra.ARG.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_arith_lra.ARG.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/P/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/P/index.html
index f4b228db..5c911741 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/P/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_arith_lra.ARG.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
+P (sidekick.Sidekick_arith_lra.ARG.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/Actions/P/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/Actions/P/index.html
index 4f4f7bca..979de84c 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/Actions/P/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_arith_lra.ARG.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_arith_lra.ARG.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/Actions/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/Actions/index.html
index 0f251960..0e068fb0 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/Actions/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick.Sidekick_arith_lra.ARG.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
+Actions (sidekick.Sidekick_arith_lra.ARG.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/Expl/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/Expl/index.html
index ca3c22ba..74f40376 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/Expl/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick.Sidekick_arith_lra.ARG.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick.Sidekick_arith_lra.ARG.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/N/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/N/index.html
index 0f911586..6424045d 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/N/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick.Sidekick_arith_lra.ARG.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
+N (sidekick.Sidekick_arith_lra.ARG.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/P/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/P/index.html
index ca645876..25d9c259 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/P/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_arith_lra.ARG.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_arith_lra.ARG.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/index.html
index 0d9ee627..75a2a4d4 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/CC/index.html
@@ -1,4 +1,4 @@
 
-CC (sidekick.Sidekick_arith_lra.ARG.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+CC (sidekick.Sidekick_arith_lra.ARG.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Small | `Big ] -> term_store -> proof -> t
Create a new congruence closure.
  • parameter term_store 
    used to be able to create new terms. All terms interacting with this congruence closure must belong in this term state as well.
val allocate_bitfield : descr:string -> t -> N.bitfield
Allocate a new node field (see N.bitfield).
This field descriptor is henceforth reserved for all nodes in this congruence closure, and can be set using set_bitfield for each node individually. This can be used to efficiently store some metadata on nodes (e.g. "is there a numeric value in the class" or "is there a constructor term in the class").
There may be restrictions on how many distinct fields are allocated for a given congruence closure (e.g. at most Sys.int_size fields).
val get_bitfield : t -> N.bitfield -> N.t -> bool
Access the bit field of the given node
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
Set the bitfield for the node. This will be backtracked. See N.bitfield.
val on_pre_merge : t -> ev_on_pre_merge -> unit
Add a function to be called when two classes are merged
val on_post_merge : t -> ev_on_post_merge -> unit
Add a function to be called when two classes are merged
val on_new_term : t -> ev_on_new_term -> unit
Add a function to be called when a new node is created
val on_conflict : t -> ev_on_conflict -> unit
Called when the congruence closure finds a conflict
val on_propagate : t -> ev_on_propagate -> unit
Called when the congruence closure propagates a literal
val on_is_subterm : t -> ev_on_is_subterm -> unit
Called on terms that are subterms of function symbols
val set_as_lit : t -> N.t -> lit -> unit
map the given node to a literal.
val find_t : t -> term -> repr
Current representative of the term.
  • raises Not_found 
    if the term is not already add-ed.
val add_seq : t -> term Iter.t -> unit
Add a sequence of terms to the congruence closure
val all_classes : t -> repr Iter.t
All current classes. This is costly, only use if there is no other solution
val assert_lit : t -> lit -> unit
Given a literal, assume it in the congruence closure and propagate its consequences. Will be backtracked.
Useful for the theory combination or the SAT solver's functor
val assert_lits : t -> lit Iter.t -> unit
Addition of many literals
val explain_eq : t -> N.t -> N.t -> lit list
Explain why the two nodes are equal. Fails if they are not, in an unspecified way
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
Raise a conflict with the given explanation it must be a theory tautology that expl ==> absurd. To be used in theories.
val n_true : t -> N.t
Node for true
val n_false : t -> N.t
Node for false
val n_bool : t -> bool -> N.t
Node for either true or false
val merge : t -> N.t -> N.t -> Expl.t -> unit
Merge these two nodes given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val merge_t : t -> term -> term -> Expl.t -> unit
Shortcut for adding + merging
val check : t -> actions -> unit
Perform all pending operations done via assert_eq, assert_lit, etc. Will use the actions to propagate literals, declare conflicts, etc.
val new_merges : t -> bool
Called after check, returns true if some pairs of classes were merged.
val push_level : t -> unit
Push backtracking level
val pop_levels : t -> int -> unit
Restore to state n calls to push_level earlier. Used during backtracking.
val get_model : t -> N.t Iter.t Iter.t
get all the equivalence classes so they can be merged in the model

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/Simplify/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/Simplify/index.html
index 0fbebecf..17fa5863 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/Simplify/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/Simplify/index.html
@@ -1,2 +1,2 @@
 
-Simplify (sidekick.Sidekick_arith_lra.ARG.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
+Simplify (sidekick.Sidekick_arith_lra.ARG.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/index.html
index 219dbda5..cd9d15c0 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/index.html
@@ -1,3 +1,3 @@
 
-Solver_internal (sidekick.Sidekick_arith_lra.ARG.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
+Solver_internal (sidekick.Sidekick_arith_lra.ARG.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
 P.t = proof and type P.lit = lit and type Actions.t = theory_actions
Congruence closure instance
val cc : t -> CC.t
Congruence closure for this solver
Simplifiers
module Simplify : sig ... end
Simplify terms
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
Add a simplifier hook for preprocessing.
val simplify_t : t -> term -> (term * proof_step) option
Simplify input term, returns Some u if some simplification occurred.
val simp_t : t -> term -> term * proof_step option
simp_t si t returns u even if no simplification occurred (in which case t == u syntactically). It emits |- t=u. (see simplifier)
Preprocessors
These preprocessors turn mixed, raw literals (possibly simplified) into literals suitable for reasoning. Typically some clauses are also added to the solver.
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
Actions available to the preprocessor
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
Given a term, try to preprocess it. Return None if it didn't change, or Some (u) if t=u. Can also add clauses to define new terms.
Preprocessing might transform terms to make them more amenable to reasoning, e.g. by removing boolean formulas via Tseitin encoding, adding clauses that encode their meaning in the same move.
  • parameter preprocess_actions 
    actions available during preprocessing.
val on_preprocess : t -> preprocess_hook -> unit
Add a hook that will be called when terms are preprocessed
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
Obtain preprocessor actions, from theory actions
hooks for the theory
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
Give a conflict clause to the solver
val push_decision : t -> theory_actions -> lit -> unit
Ask the SAT solver to decide the given literal in an extension of the current trail. This is useful for theory combination. If the SAT solver backtracks, this (potential) decision is removed and forgotten.
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
Add local clause to the SAT solver. This clause will be removed when the solver backtracks.
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
Add toplevel clause to the SAT solver. This clause will not be backtracked.
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
Create a literal. This automatically preprocesses the term.
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
Preprocess a term.
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
Add the given literal to the SAT solver, so it gets assigned a boolean value.
  • parameter default_pol 
    default polarity for the corresponding atom
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
Add the given (signed) bool term to the SAT solver, so it gets assigned a boolean value
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
Raise a conflict with the given congruence closure explanation. it must be a theory tautology that expl ==> absurd. To be used in theories.
val cc_find : t -> CC.N.t -> CC.N.t
Find representative of the node
val cc_are_equal : t -> term -> term -> bool
Are these two terms equal in the congruence closure?
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
Merge these two nodes in the congruence closure, given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
Merge these two terms in the congruence closure, given this explanation. See cc_merge
val cc_add_term : t -> term -> CC.N.t
Add/retrieve congruence closure node for this term. To be used in theories
val cc_mem_term : t -> term -> bool
Return true if the term is explicitly in the congruence closure. To be used in theories
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called before)
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called after)
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
Callback to add data on terms when they are added to the congruence closure
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
Callback for when a term is a subterm of another term in the congruence closure
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
Callback called on every CC conflict
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
Callback called on every CC propagation
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callbacked to be called with the slice of literals newly added on the trail.
This is called very often and should be efficient. It doesn't have to be complete, only correct. It's given only the slice of the trail consisting in new literals.
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callback to be called during the final check.
Must be complete (i.e. must raise a conflict if the set of literals is not satisfiable) and can be expensive. The function is given the whole trail.
Model production
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
A model-production hook. It takes the solver, a class, and returns a term for this class. For example, an arithmetic theory might detect that a class contains a numeric constant, and return this constant as a model value.
If no hook assigns a value to a class, a fake value is created for it.
val on_model_gen : t -> model_hook -> unit
Add a hook that will be called when a model is being produced

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
index 8b6aebfc..c7aa8f84 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
@@ -1,2 +1,2 @@
 
-PREPROCESS_ACTS (sidekick.Sidekick_arith_lra.ARG.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
+PREPROCESS_ACTS (sidekick.Sidekick_arith_lra.ARG.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/T/Fun/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/T/Fun/index.html
index a72ea718..18e9d5b5 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_arith_lra.ARG.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_arith_lra.ARG.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/T/Term/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/T/Term/index.html
index 1479f8fa..65094329 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/T/Term/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_arith_lra.ARG.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_arith_lra.ARG.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/T/Ty/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/T/Ty/index.html
index 31423f34..77e46923 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_arith_lra.ARG.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_arith_lra.ARG.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/T/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/T/index.html
index 41f36659..f5787bf9 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/T/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_arith_lra.ARG.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_arith_lra.ARG.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Unknown/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Unknown/index.html
index 80183bb6..30bcdd2c 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Unknown/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/Unknown/index.html
@@ -1,2 +1,2 @@
 
-Unknown (sidekick.Sidekick_arith_lra.ARG.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
+Unknown (sidekick.Sidekick_arith_lra.ARG.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/index.html
index 5fb4822c..3a3a3336 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/index.html
@@ -1,5 +1,5 @@
 
-S (sidekick.Sidekick_arith_lra.ARG.S)
Module ARG.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
+S (sidekick.Sidekick_arith_lra.ARG.S)
Module ARG.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
 ?push_level:('th -> unit) -> ?pop_levels:('th -> int -> unit) -> unit -> theory
Helper to create a theory.
module Model : sig ... end
Models
module Unknown : sig ... end
Main API
val stats : t -> Sidekick_util.Stat.t
val tst : t -> T.Term.store
val ty_st : t -> T.Ty.store
val proof : t -> proof
val create : ?stat:Sidekick_util.Stat.t -> ?size:[ `Big | `Tiny | `Small ] -> proof:proof -> theories:theory list ->
 T.Term.store -> T.Ty.store -> unit -> t
Create a new solver.
It needs a term state and a type state to manipulate terms and types. All terms and types interacting with this solver will need to come from these exact states.
  • parameter store_proof 
    if true, proofs from the SAT solver and theories are retained and potentially accessible after solve returns UNSAT.
  • parameter size 
    influences the size of initial allocations.
  • parameter theories 
    theories to load from the start. Other theories can be added using add_theory.
val add_theory : t -> theory -> unit
Add a theory to the solver. This should be called before any call to solve or to add_clause and the likes (otherwise the theory will have a partial view of the problem).
val add_theory_p : t -> 'a theory_p -> 'a
Add the given theory and obtain its state
val add_theory_l : t -> theory list -> unit
val mk_lit_t : t -> ?sign:bool -> term -> lit
mk_lit_t _ ~sign t returns lit', where lit' is preprocess(lit) and lit is an internal representation of ± t.
The proof of |- lit = lit' is directly added to the solver's proof.
val add_clause : t -> lit Sidekick_util.IArray.t -> proof_step -> unit
add_clause solver cs adds a boolean clause to the solver. Subsequent calls to solve will need to satisfy this clause.
val add_clause_l : t -> lit list -> proof_step -> unit
Add a clause to the solver, given as a list.
val assert_terms : t -> term list -> unit
Helper that turns each term into an atom, before adding the result to the solver as an assertion
val assert_term : t -> term -> unit
Helper that turns the term into an atom, before adding the result to the solver as a unit clause assertion
type res = 
| Sat of Model.t(*
Satisfiable
*)
| Unsat of {
unsat_core : unit -> lit Iter.t;(*
Unsat core (subset of assumptions), or empty
*)
unsat_proof_step : unit -> proof_step option;(*
Proof step for the empty clause
*)
}		(*
Unsatisfiable
*)
| Unknown of Unknown.t(*
Unknown, obtained after a timeout, memory limit, etc.
*)
Result of solving for the current set of clauses
val solve : ?on_exit:(unit -> unit) list -> ?check:bool -> ?on_progress:(t -> unit) ->
 assumptions:lit list -> t -> res
solve s checks the satisfiability of the clauses added so far to s.
  • parameter check 
    if true, the model is checked before returning.
  • parameter on_progress 
    called regularly during solving.
  • parameter assumptions 
    a set of atoms held to be true. The unsat core, if any, will be a subset of assumptions.
  • parameter on_exit 
    functions to be run before this returns
val pp_stats : t CCFormat.printer
Print some statistics. What it prints exactly is unspecified.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/module-type-THEORY/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/module-type-THEORY/index.html
index 32784f89..58c91cd5 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/module-type-THEORY/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/S/module-type-THEORY/index.html
@@ -1,2 +1,2 @@
 
-THEORY (sidekick.Sidekick_arith_lra.ARG.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
+THEORY (sidekick.Sidekick_arith_lra.ARG.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/index.html
index 8c267bc1..b300d7a3 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-ARG/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-ARG/index.html
@@ -1,2 +1,2 @@
 
-ARG (sidekick.Sidekick_arith_lra.ARG)
Module type Sidekick_arith_lra.ARG
module Q : RATIONAL
type term = S.T.Term.t
type ty = S.T.Ty.t
val view_as_lra : term -> (Q.t, term) lra_view
Project the term into the theory view
val mk_bool : S.T.Term.store -> bool -> term
val mk_lra : S.T.Term.store -> (Q.t, term) lra_view -> term
Make a term from the given theory view
val ty_lra : S.T.Term.store -> ty
val mk_eq : S.T.Term.store -> term -> term -> term
syntactic equality
val has_ty_real : term -> bool
Does this term have the type Real
val lemma_lra : S.Lit.t Iter.t -> S.P.proof_rule
module Gensym : sig ... end

\ No newline at end of file
+ARG (sidekick.Sidekick_arith_lra.ARG)
Module type Sidekick_arith_lra.ARG
module Q : RATIONAL
type term = S.T.Term.t
type ty = S.T.Ty.t
val view_as_lra : term -> (Q.t, term) lra_view
Project the term into the theory view
val mk_bool : S.T.Term.store -> bool -> term
val mk_lra : S.T.Term.store -> (Q.t, term) lra_view -> term
Make a term from the given theory view
val ty_lra : S.T.Term.store -> ty
val mk_eq : S.T.Term.store -> term -> term -> term
syntactic equality
val has_ty_real : term -> bool
Does this term have the type Real
val lemma_lra : S.Lit.t Iter.t -> S.P.proof_rule
module Gensym : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/Gensym/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/Gensym/index.html
index d94291a0..9a9bb5c1 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/Gensym/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/Gensym/index.html
@@ -1,2 +1,2 @@
 
-Gensym (sidekick.Sidekick_arith_lra.S.A.Gensym)
Module A.Gensym
type t
val create : S.T.Term.store -> t
val tst : t -> S.T.Term.store
val copy : t -> t
val fresh_term : t -> pre:string -> S.T.Ty.t -> term
Make a fresh term of the given type

\ No newline at end of file
+Gensym (sidekick.Sidekick_arith_lra.S.A.Gensym)
Module A.Gensym
type t
val create : S.T.Term.store -> t
val tst : t -> S.T.Term.store
val copy : t -> t
val fresh_term : t -> pre:string -> S.T.Ty.t -> term
Make a fresh term of the given type

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/Q/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/Q/index.html
index 6e7741fa..752c0425 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/Q/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/Q/index.html
@@ -1,2 +1,2 @@
 
-Q (sidekick.Sidekick_arith_lra.S.A.Q)
Module A.Q
include Sidekick_arith.NUM
type t
val zero : t
val one : t
val minus_one : t
val sign : t -> int
val of_int : int -> t
include Sidekick_sigs.EQ with type t := t
val equal : t -> t -> bool
include Sidekick_sigs.ORD with type t := t
val compare : t -> t -> int
include Sidekick_sigs.HASH with type t := t
val hash : t -> int
include Sidekick_sigs.PRINT with type t := t
val pp : t CCFormat.printer
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
val (~-) : t -> t
val neg : t -> t
val min : t -> t -> t
val max : t -> t -> t
val (=) : t -> t -> bool
val (<>) : t -> t -> bool
val (>) : t -> t -> bool
val (>=) : t -> t -> bool
val (<) : t -> t -> bool
val (<=) : t -> t -> bool
type bigint
val (/) : t -> t -> t
val num : t -> bigint
val denum : t -> bigint
val pp_approx : int -> Stdlib.Format.formatter -> t -> unit
Pretty print rational with given amount of precision (for example as a floating point number)

\ No newline at end of file
+Q (sidekick.Sidekick_arith_lra.S.A.Q)
Module A.Q
include Sidekick_arith.NUM
type t
val zero : t
val one : t
val minus_one : t
val sign : t -> int
val of_int : int -> t
include Sidekick_sigs.EQ with type t := t
val equal : t -> t -> bool
include Sidekick_sigs.ORD with type t := t
val compare : t -> t -> int
include Sidekick_sigs.HASH with type t := t
val hash : t -> int
include Sidekick_sigs.PRINT with type t := t
val pp : t CCFormat.printer
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
val (~-) : t -> t
val neg : t -> t
val min : t -> t -> t
val max : t -> t -> t
val (=) : t -> t -> bool
val (<>) : t -> t -> bool
val (>) : t -> t -> bool
val (>=) : t -> t -> bool
val (<) : t -> t -> bool
val (<=) : t -> t -> bool
type bigint
val (/) : t -> t -> t
val num : t -> bigint
val denum : t -> bigint
val pp_approx : int -> Stdlib.Format.formatter -> t -> unit
Pretty print rational with given amount of precision (for example as a floating point number)

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Lit/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Lit/index.html
index 518b25a1..4881c442 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Lit/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_arith_lra.S.A.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick.Sidekick_arith_lra.S.A.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Model/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Model/index.html
index 275f4ae8..86c349b9 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Model/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Model/index.html
@@ -1,2 +1,2 @@
 
-Model (sidekick.Sidekick_arith_lra.S.A.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Model (sidekick.Sidekick_arith_lra.S.A.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/P/Step_vec/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/P/Step_vec/index.html
index fab1bc1c..91404c5a 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/P/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_arith_lra.S.A.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_arith_lra.S.A.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/P/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/P/index.html
index 816d9732..32242917 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/P/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_arith_lra.S.A.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
+P (sidekick.Sidekick_arith_lra.S.A.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/Actions/P/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/Actions/P/index.html
index a916d337..160b0d80 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/Actions/P/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_arith_lra.S.A.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_arith_lra.S.A.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/Actions/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/Actions/index.html
index de1044b5..eff06a7c 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/Actions/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick.Sidekick_arith_lra.S.A.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
+Actions (sidekick.Sidekick_arith_lra.S.A.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/Expl/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/Expl/index.html
index 11aed5c8..23947cd1 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/Expl/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick.Sidekick_arith_lra.S.A.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick.Sidekick_arith_lra.S.A.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/N/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/N/index.html
index 5db53b97..c5d30b5c 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/N/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick.Sidekick_arith_lra.S.A.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
+N (sidekick.Sidekick_arith_lra.S.A.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/P/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/P/index.html
index 86f01294..b10170b2 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/P/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_arith_lra.S.A.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_arith_lra.S.A.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/index.html
index d989786a..b88d64c8 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/CC/index.html
@@ -1,4 +1,4 @@
 
-CC (sidekick.Sidekick_arith_lra.S.A.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+CC (sidekick.Sidekick_arith_lra.S.A.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Small | `Big ] -> term_store -> proof -> t
Create a new congruence closure.
  • parameter term_store 
    used to be able to create new terms. All terms interacting with this congruence closure must belong in this term state as well.
val allocate_bitfield : descr:string -> t -> N.bitfield
Allocate a new node field (see N.bitfield).
This field descriptor is henceforth reserved for all nodes in this congruence closure, and can be set using set_bitfield for each node individually. This can be used to efficiently store some metadata on nodes (e.g. "is there a numeric value in the class" or "is there a constructor term in the class").
There may be restrictions on how many distinct fields are allocated for a given congruence closure (e.g. at most Sys.int_size fields).
val get_bitfield : t -> N.bitfield -> N.t -> bool
Access the bit field of the given node
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
Set the bitfield for the node. This will be backtracked. See N.bitfield.
val on_pre_merge : t -> ev_on_pre_merge -> unit
Add a function to be called when two classes are merged
val on_post_merge : t -> ev_on_post_merge -> unit
Add a function to be called when two classes are merged
val on_new_term : t -> ev_on_new_term -> unit
Add a function to be called when a new node is created
val on_conflict : t -> ev_on_conflict -> unit
Called when the congruence closure finds a conflict
val on_propagate : t -> ev_on_propagate -> unit
Called when the congruence closure propagates a literal
val on_is_subterm : t -> ev_on_is_subterm -> unit
Called on terms that are subterms of function symbols
val set_as_lit : t -> N.t -> lit -> unit
map the given node to a literal.
val find_t : t -> term -> repr
Current representative of the term.
  • raises Not_found 
    if the term is not already add-ed.
val add_seq : t -> term Iter.t -> unit
Add a sequence of terms to the congruence closure
val all_classes : t -> repr Iter.t
All current classes. This is costly, only use if there is no other solution
val assert_lit : t -> lit -> unit
Given a literal, assume it in the congruence closure and propagate its consequences. Will be backtracked.
Useful for the theory combination or the SAT solver's functor
val assert_lits : t -> lit Iter.t -> unit
Addition of many literals
val explain_eq : t -> N.t -> N.t -> lit list
Explain why the two nodes are equal. Fails if they are not, in an unspecified way
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
Raise a conflict with the given explanation it must be a theory tautology that expl ==> absurd. To be used in theories.
val n_true : t -> N.t
Node for true
val n_false : t -> N.t
Node for false
val n_bool : t -> bool -> N.t
Node for either true or false
val merge : t -> N.t -> N.t -> Expl.t -> unit
Merge these two nodes given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val merge_t : t -> term -> term -> Expl.t -> unit
Shortcut for adding + merging
val check : t -> actions -> unit
Perform all pending operations done via assert_eq, assert_lit, etc. Will use the actions to propagate literals, declare conflicts, etc.
val new_merges : t -> bool
Called after check, returns true if some pairs of classes were merged.
val push_level : t -> unit
Push backtracking level
val pop_levels : t -> int -> unit
Restore to state n calls to push_level earlier. Used during backtracking.
val get_model : t -> N.t Iter.t Iter.t
get all the equivalence classes so they can be merged in the model

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/Simplify/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/Simplify/index.html
index f51b8fa2..3939a4e7 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/Simplify/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/Simplify/index.html
@@ -1,2 +1,2 @@
 
-Simplify (sidekick.Sidekick_arith_lra.S.A.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
+Simplify (sidekick.Sidekick_arith_lra.S.A.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/index.html
index 39b31062..30d54c07 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/index.html
@@ -1,3 +1,3 @@
 
-Solver_internal (sidekick.Sidekick_arith_lra.S.A.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
+Solver_internal (sidekick.Sidekick_arith_lra.S.A.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
 P.t = proof and type P.lit = lit and type Actions.t = theory_actions
Congruence closure instance
val cc : t -> CC.t
Congruence closure for this solver
Simplifiers
module Simplify : sig ... end
Simplify terms
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
Add a simplifier hook for preprocessing.
val simplify_t : t -> term -> (term * proof_step) option
Simplify input term, returns Some u if some simplification occurred.
val simp_t : t -> term -> term * proof_step option
simp_t si t returns u even if no simplification occurred (in which case t == u syntactically). It emits |- t=u. (see simplifier)
Preprocessors
These preprocessors turn mixed, raw literals (possibly simplified) into literals suitable for reasoning. Typically some clauses are also added to the solver.
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
Actions available to the preprocessor
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
Given a term, try to preprocess it. Return None if it didn't change, or Some (u) if t=u. Can also add clauses to define new terms.
Preprocessing might transform terms to make them more amenable to reasoning, e.g. by removing boolean formulas via Tseitin encoding, adding clauses that encode their meaning in the same move.
  • parameter preprocess_actions 
    actions available during preprocessing.
val on_preprocess : t -> preprocess_hook -> unit
Add a hook that will be called when terms are preprocessed
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
Obtain preprocessor actions, from theory actions
hooks for the theory
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
Give a conflict clause to the solver
val push_decision : t -> theory_actions -> lit -> unit
Ask the SAT solver to decide the given literal in an extension of the current trail. This is useful for theory combination. If the SAT solver backtracks, this (potential) decision is removed and forgotten.
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
Add local clause to the SAT solver. This clause will be removed when the solver backtracks.
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
Add toplevel clause to the SAT solver. This clause will not be backtracked.
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
Create a literal. This automatically preprocesses the term.
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
Preprocess a term.
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
Add the given literal to the SAT solver, so it gets assigned a boolean value.
  • parameter default_pol 
    default polarity for the corresponding atom
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
Add the given (signed) bool term to the SAT solver, so it gets assigned a boolean value
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
Raise a conflict with the given congruence closure explanation. it must be a theory tautology that expl ==> absurd. To be used in theories.
val cc_find : t -> CC.N.t -> CC.N.t
Find representative of the node
val cc_are_equal : t -> term -> term -> bool
Are these two terms equal in the congruence closure?
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
Merge these two nodes in the congruence closure, given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
Merge these two terms in the congruence closure, given this explanation. See cc_merge
val cc_add_term : t -> term -> CC.N.t
Add/retrieve congruence closure node for this term. To be used in theories
val cc_mem_term : t -> term -> bool
Return true if the term is explicitly in the congruence closure. To be used in theories
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called before)
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called after)
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
Callback to add data on terms when they are added to the congruence closure
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
Callback for when a term is a subterm of another term in the congruence closure
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
Callback called on every CC conflict
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
Callback called on every CC propagation
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callbacked to be called with the slice of literals newly added on the trail.
This is called very often and should be efficient. It doesn't have to be complete, only correct. It's given only the slice of the trail consisting in new literals.
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callback to be called during the final check.
Must be complete (i.e. must raise a conflict if the set of literals is not satisfiable) and can be expensive. The function is given the whole trail.
Model production
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
A model-production hook. It takes the solver, a class, and returns a term for this class. For example, an arithmetic theory might detect that a class contains a numeric constant, and return this constant as a model value.
If no hook assigns a value to a class, a fake value is created for it.
val on_model_gen : t -> model_hook -> unit
Add a hook that will be called when a model is being produced

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
index f44fc77d..df8eea8e 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
@@ -1,2 +1,2 @@
 
-PREPROCESS_ACTS (sidekick.Sidekick_arith_lra.S.A.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
+PREPROCESS_ACTS (sidekick.Sidekick_arith_lra.S.A.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/T/Fun/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/T/Fun/index.html
index d81da65f..7523cacd 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_arith_lra.S.A.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_arith_lra.S.A.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/T/Term/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/T/Term/index.html
index 1604fea2..561bfa9f 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/T/Term/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_arith_lra.S.A.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_arith_lra.S.A.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/T/Ty/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/T/Ty/index.html
index d8b2adab..6e2ba824 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_arith_lra.S.A.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_arith_lra.S.A.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/T/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/T/index.html
index 9cad8758..7dbd2c1a 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/T/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_arith_lra.S.A.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_arith_lra.S.A.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Unknown/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Unknown/index.html
index 3c544d79..00c5581a 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Unknown/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/Unknown/index.html
@@ -1,2 +1,2 @@
 
-Unknown (sidekick.Sidekick_arith_lra.S.A.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
+Unknown (sidekick.Sidekick_arith_lra.S.A.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/index.html
index 70ae44b0..72739a74 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/index.html
@@ -1,5 +1,5 @@
 
-S (sidekick.Sidekick_arith_lra.S.A.S)
Module A.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
+S (sidekick.Sidekick_arith_lra.S.A.S)
Module A.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
 ?push_level:('th -> unit) -> ?pop_levels:('th -> int -> unit) -> unit -> theory
Helper to create a theory.
module Model : sig ... end
Models
module Unknown : sig ... end
Main API
val stats : t -> Sidekick_util.Stat.t
val tst : t -> T.Term.store
val ty_st : t -> T.Ty.store
val proof : t -> proof
val create : ?stat:Sidekick_util.Stat.t -> ?size:[ `Big | `Tiny | `Small ] -> proof:proof -> theories:theory list ->
 T.Term.store -> T.Ty.store -> unit -> t
Create a new solver.
It needs a term state and a type state to manipulate terms and types. All terms and types interacting with this solver will need to come from these exact states.
  • parameter store_proof 
    if true, proofs from the SAT solver and theories are retained and potentially accessible after solve returns UNSAT.
  • parameter size 
    influences the size of initial allocations.
  • parameter theories 
    theories to load from the start. Other theories can be added using add_theory.
val add_theory : t -> theory -> unit
Add a theory to the solver. This should be called before any call to solve or to add_clause and the likes (otherwise the theory will have a partial view of the problem).
val add_theory_p : t -> 'a theory_p -> 'a
Add the given theory and obtain its state
val add_theory_l : t -> theory list -> unit
val mk_lit_t : t -> ?sign:bool -> term -> lit
mk_lit_t _ ~sign t returns lit', where lit' is preprocess(lit) and lit is an internal representation of ± t.
The proof of |- lit = lit' is directly added to the solver's proof.
val add_clause : t -> lit Sidekick_util.IArray.t -> proof_step -> unit
add_clause solver cs adds a boolean clause to the solver. Subsequent calls to solve will need to satisfy this clause.
val add_clause_l : t -> lit list -> proof_step -> unit
Add a clause to the solver, given as a list.
val assert_terms : t -> term list -> unit
Helper that turns each term into an atom, before adding the result to the solver as an assertion
val assert_term : t -> term -> unit
Helper that turns the term into an atom, before adding the result to the solver as a unit clause assertion
type res = 
| Sat of Model.t(*
Satisfiable
*)
| Unsat of {
unsat_core : unit -> lit Iter.t;(*
Unsat core (subset of assumptions), or empty
*)
unsat_proof_step : unit -> proof_step option;(*
Proof step for the empty clause
*)
}		(*
Unsatisfiable
*)
| Unknown of Unknown.t(*
Unknown, obtained after a timeout, memory limit, etc.
*)
Result of solving for the current set of clauses
val solve : ?on_exit:(unit -> unit) list -> ?check:bool -> ?on_progress:(t -> unit) ->
 assumptions:lit list -> t -> res
solve s checks the satisfiability of the clauses added so far to s.
  • parameter check 
    if true, the model is checked before returning.
  • parameter on_progress 
    called regularly during solving.
  • parameter assumptions 
    a set of atoms held to be true. The unsat core, if any, will be a subset of assumptions.
  • parameter on_exit 
    functions to be run before this returns
val pp_stats : t CCFormat.printer
Print some statistics. What it prints exactly is unspecified.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/module-type-THEORY/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/module-type-THEORY/index.html
index 753aeb04..ce046857 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/module-type-THEORY/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/S/module-type-THEORY/index.html
@@ -1,2 +1,2 @@
 
-THEORY (sidekick.Sidekick_arith_lra.S.A.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
+THEORY (sidekick.Sidekick_arith_lra.S.A.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/index.html
index 5e6d42c4..807ca8cb 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/A/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/A/index.html
@@ -1,2 +1,2 @@
 
-A (sidekick.Sidekick_arith_lra.S.A)
Module S.A
module Q : RATIONAL
type term = S.T.Term.t
type ty = S.T.Ty.t
val view_as_lra : term -> (Q.t, term) lra_view
Project the term into the theory view
val mk_bool : S.T.Term.store -> bool -> term
val mk_lra : S.T.Term.store -> (Q.t, term) lra_view -> term
Make a term from the given theory view
val ty_lra : S.T.Term.store -> ty
val mk_eq : S.T.Term.store -> term -> term -> term
syntactic equality
val has_ty_real : term -> bool
Does this term have the type Real
val lemma_lra : S.Lit.t Iter.t -> S.P.proof_rule
module Gensym : sig ... end

\ No newline at end of file
+A (sidekick.Sidekick_arith_lra.S.A)
Module S.A
module Q : RATIONAL
type term = S.T.Term.t
type ty = S.T.Ty.t
val view_as_lra : term -> (Q.t, term) lra_view
Project the term into the theory view
val mk_bool : S.T.Term.store -> bool -> term
val mk_lra : S.T.Term.store -> (Q.t, term) lra_view -> term
Make a term from the given theory view
val ty_lra : S.T.Term.store -> ty
val mk_eq : S.T.Term.store -> term -> term -> term
syntactic equality
val has_ty_real : term -> bool
Does this term have the type Real
val lemma_lra : S.Lit.t Iter.t -> S.P.proof_rule
module Gensym : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra/module-type-S/index.html b/dev/sidekick/Sidekick_arith_lra/module-type-S/index.html
index 23e2ad17..e08c8405 100644
--- a/dev/sidekick/Sidekick_arith_lra/module-type-S/index.html
+++ b/dev/sidekick/Sidekick_arith_lra/module-type-S/index.html
@@ -1,2 +1,2 @@
 
-S (sidekick.Sidekick_arith_lra.S)
Module type Sidekick_arith_lra.S
module A : ARG
type state
val theory : A.S.theory

\ No newline at end of file
+S (sidekick.Sidekick_arith_lra.S)
Module type Sidekick_arith_lra.S
module A : ARG
type state
val theory : A.S.theory

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra__/index.html b/dev/sidekick/Sidekick_arith_lra__/index.html
index ced36f1b..a92cf81f 100644
--- a/dev/sidekick/Sidekick_arith_lra__/index.html
+++ b/dev/sidekick/Sidekick_arith_lra__/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_arith_lra__ (sidekick.Sidekick_arith_lra__)
Module Sidekick_arith_lra__

\ No newline at end of file
+Sidekick_arith_lra__ (sidekick.Sidekick_arith_lra__)
Module Sidekick_arith_lra__

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra__Linear_expr/index.html b/dev/sidekick/Sidekick_arith_lra__Linear_expr/index.html
index 7ca59e31..449373af 100644
--- a/dev/sidekick/Sidekick_arith_lra__Linear_expr/index.html
+++ b/dev/sidekick/Sidekick_arith_lra__Linear_expr/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_arith_lra__Linear_expr (sidekick.Sidekick_arith_lra__Linear_expr)
Module Sidekick_arith_lra__Linear_expr

\ No newline at end of file
+Sidekick_arith_lra__Linear_expr (sidekick.Sidekick_arith_lra__Linear_expr)
Module Sidekick_arith_lra__Linear_expr

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra__Linear_expr_intf/index.html b/dev/sidekick/Sidekick_arith_lra__Linear_expr_intf/index.html
index 8b830df4..39d7a4e3 100644
--- a/dev/sidekick/Sidekick_arith_lra__Linear_expr_intf/index.html
+++ b/dev/sidekick/Sidekick_arith_lra__Linear_expr_intf/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_arith_lra__Linear_expr_intf (sidekick.Sidekick_arith_lra__Linear_expr_intf)
Module Sidekick_arith_lra__Linear_expr_intf

\ No newline at end of file
+Sidekick_arith_lra__Linear_expr_intf (sidekick.Sidekick_arith_lra__Linear_expr_intf)
Module Sidekick_arith_lra__Linear_expr_intf

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra__Predicate/index.html b/dev/sidekick/Sidekick_arith_lra__Predicate/index.html
index 973ca2d4..06c78b61 100644
--- a/dev/sidekick/Sidekick_arith_lra__Predicate/index.html
+++ b/dev/sidekick/Sidekick_arith_lra__Predicate/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_arith_lra__Predicate (sidekick.Sidekick_arith_lra__Predicate)
Module Sidekick_arith_lra__Predicate

\ No newline at end of file
+Sidekick_arith_lra__Predicate (sidekick.Sidekick_arith_lra__Predicate)
Module Sidekick_arith_lra__Predicate

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra__Simplex2/index.html b/dev/sidekick/Sidekick_arith_lra__Simplex2/index.html
index 3f31640e..e9c897cb 100644
--- a/dev/sidekick/Sidekick_arith_lra__Simplex2/index.html
+++ b/dev/sidekick/Sidekick_arith_lra__Simplex2/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_arith_lra__Simplex2 (sidekick.Sidekick_arith_lra__Simplex2)
Module Sidekick_arith_lra__Simplex2

\ No newline at end of file
+Sidekick_arith_lra__Simplex2 (sidekick.Sidekick_arith_lra__Simplex2)
Module Sidekick_arith_lra__Simplex2

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_arith_lra__Simplex_intf/index.html b/dev/sidekick/Sidekick_arith_lra__Simplex_intf/index.html
index 6a0d0a70..c67faacc 100644
--- a/dev/sidekick/Sidekick_arith_lra__Simplex_intf/index.html
+++ b/dev/sidekick/Sidekick_arith_lra__Simplex_intf/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_arith_lra__Simplex_intf (sidekick.Sidekick_arith_lra__Simplex_intf)
Module Sidekick_arith_lra__Simplex_intf

\ No newline at end of file
+Sidekick_arith_lra__Simplex_intf (sidekick.Sidekick_arith_lra__Simplex_intf)
Module Sidekick_arith_lra__Simplex_intf

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_cc/Make/Expl/index.html b/dev/sidekick/Sidekick_cc/Make/Expl/index.html
index 99baa1c0..8990414f 100644
--- a/dev/sidekick/Sidekick_cc/Make/Expl/index.html
+++ b/dev/sidekick/Sidekick_cc/Make/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick.Sidekick_cc.Make.Expl)
Module Make.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick.Sidekick_cc.Make.Expl)
Module Make.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_cc/Make/N/index.html b/dev/sidekick/Sidekick_cc/Make/N/index.html
index 83d6de99..197f8fa6 100644
--- a/dev/sidekick/Sidekick_cc/Make/N/index.html
+++ b/dev/sidekick/Sidekick_cc/Make/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick.Sidekick_cc.Make.N)
Module Make.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
+N (sidekick.Sidekick_cc.Make.N)
Module Make.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_cc/Make/P/index.html b/dev/sidekick/Sidekick_cc/Make/P/index.html
index 599735f0..8565281f 100644
--- a/dev/sidekick/Sidekick_cc/Make/P/index.html
+++ b/dev/sidekick/Sidekick_cc/Make/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_cc.Make.P)
Module Make.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_cc.Make.P)
Module Make.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_cc/Make/argument-1-A/Actions/P/index.html b/dev/sidekick/Sidekick_cc/Make/argument-1-A/Actions/P/index.html
index ee427b3a..4ccb7c37 100644
--- a/dev/sidekick/Sidekick_cc/Make/argument-1-A/Actions/P/index.html
+++ b/dev/sidekick/Sidekick_cc/Make/argument-1-A/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_cc.Make.1-A.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_cc.Make.1-A.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_cc/Make/argument-1-A/Actions/index.html b/dev/sidekick/Sidekick_cc/Make/argument-1-A/Actions/index.html
index af0c8c82..ea4bfa65 100644
--- a/dev/sidekick/Sidekick_cc/Make/argument-1-A/Actions/index.html
+++ b/dev/sidekick/Sidekick_cc/Make/argument-1-A/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick.Sidekick_cc.Make.1-A.Actions)
Module 1-A.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
type t
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
+Actions (sidekick.Sidekick_cc.Make.1-A.Actions)
Module 1-A.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
type t
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_cc/Make/argument-1-A/Lit/index.html b/dev/sidekick/Sidekick_cc/Make/argument-1-A/Lit/index.html
index 39007155..84b7ffbf 100644
--- a/dev/sidekick/Sidekick_cc/Make/argument-1-A/Lit/index.html
+++ b/dev/sidekick/Sidekick_cc/Make/argument-1-A/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_cc.Make.1-A.Lit)
Module 1-A.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick.Sidekick_cc.Make.1-A.Lit)
Module 1-A.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_cc/Make/argument-1-A/P/index.html b/dev/sidekick/Sidekick_cc/Make/argument-1-A/P/index.html
index 7be3f002..b448ab58 100644
--- a/dev/sidekick/Sidekick_cc/Make/argument-1-A/P/index.html
+++ b/dev/sidekick/Sidekick_cc/Make/argument-1-A/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_cc.Make.1-A.P)
Module 1-A.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_cc.Make.1-A.P)
Module 1-A.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_cc/Make/argument-1-A/T/Fun/index.html b/dev/sidekick/Sidekick_cc/Make/argument-1-A/T/Fun/index.html
index d32134dd..a2405752 100644
--- a/dev/sidekick/Sidekick_cc/Make/argument-1-A/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_cc/Make/argument-1-A/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_cc.Make.1-A.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_cc.Make.1-A.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_cc/Make/argument-1-A/T/Term/index.html b/dev/sidekick/Sidekick_cc/Make/argument-1-A/T/Term/index.html
index 59dbca09..21086f43 100644
--- a/dev/sidekick/Sidekick_cc/Make/argument-1-A/T/Term/index.html
+++ b/dev/sidekick/Sidekick_cc/Make/argument-1-A/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_cc.Make.1-A.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_cc.Make.1-A.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_cc/Make/argument-1-A/T/Ty/index.html b/dev/sidekick/Sidekick_cc/Make/argument-1-A/T/Ty/index.html
index a0518ee4..090fb8ae 100644
--- a/dev/sidekick/Sidekick_cc/Make/argument-1-A/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_cc/Make/argument-1-A/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_cc.Make.1-A.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_cc.Make.1-A.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_cc/Make/argument-1-A/T/index.html b/dev/sidekick/Sidekick_cc/Make/argument-1-A/T/index.html
index 1acd9dc6..f3889116 100644
--- a/dev/sidekick/Sidekick_cc/Make/argument-1-A/T/index.html
+++ b/dev/sidekick/Sidekick_cc/Make/argument-1-A/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_cc.Make.1-A.T)
Module 1-A.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_cc.Make.1-A.T)
Module 1-A.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_cc/Make/argument-1-A/index.html b/dev/sidekick/Sidekick_cc/Make/argument-1-A/index.html
index 8b69c9a4..e248fcbb 100644
--- a/dev/sidekick/Sidekick_cc/Make/argument-1-A/index.html
+++ b/dev/sidekick/Sidekick_cc/Make/argument-1-A/index.html
@@ -1,2 +1,2 @@
 
-A (sidekick.Sidekick_cc.Make.1-A)
Parameter Make.1-A
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step
View the term through the lens of the congruence closure

\ No newline at end of file
+A (sidekick.Sidekick_cc.Make.1-A)
Parameter Make.1-A
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step
View the term through the lens of the congruence closure

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_cc/Make/index.html b/dev/sidekick/Sidekick_cc/Make/index.html
index 69b83eab..6ffe6573 100644
--- a/dev/sidekick/Sidekick_cc/Make/index.html
+++ b/dev/sidekick/Sidekick_cc/Make/index.html
@@ -1,4 +1,4 @@
 
-Make (sidekick.Sidekick_cc.Make)
Module Sidekick_cc.Make
first, some aliases.
Parameters
Signature
module T = A.T
module Lit = A.Lit
type proof = A.proof
type proof_step = A.proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
module Actions = A.Actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+Make (sidekick.Sidekick_cc.Make)
Module Sidekick_cc.Make
first, some aliases.
Parameters
Signature
module T = A.T
module Lit = A.Lit
type proof = A.proof
type proof_step = A.proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
module Actions = A.Actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Small | `Big ] -> term_store -> proof -> t
Create a new congruence closure.
  • parameter term_store 
    used to be able to create new terms. All terms interacting with this congruence closure must belong in this term state as well.
val allocate_bitfield : descr:string -> t -> N.bitfield
Allocate a new node field (see N.bitfield).
This field descriptor is henceforth reserved for all nodes in this congruence closure, and can be set using set_bitfield for each node individually. This can be used to efficiently store some metadata on nodes (e.g. "is there a numeric value in the class" or "is there a constructor term in the class").
There may be restrictions on how many distinct fields are allocated for a given congruence closure (e.g. at most Sys.int_size fields).
val get_bitfield : t -> N.bitfield -> N.t -> bool
Access the bit field of the given node
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
Set the bitfield for the node. This will be backtracked. See N.bitfield.
val on_pre_merge : t -> ev_on_pre_merge -> unit
Add a function to be called when two classes are merged
val on_post_merge : t -> ev_on_post_merge -> unit
Add a function to be called when two classes are merged
val on_new_term : t -> ev_on_new_term -> unit
Add a function to be called when a new node is created
val on_conflict : t -> ev_on_conflict -> unit
Called when the congruence closure finds a conflict
val on_propagate : t -> ev_on_propagate -> unit
Called when the congruence closure propagates a literal
val on_is_subterm : t -> ev_on_is_subterm -> unit
Called on terms that are subterms of function symbols
val set_as_lit : t -> N.t -> lit -> unit
map the given node to a literal.
val find_t : t -> term -> repr
Current representative of the term.
  • raises Not_found 
    if the term is not already add-ed.
val add_seq : t -> term Iter.t -> unit
Add a sequence of terms to the congruence closure
val all_classes : t -> repr Iter.t
All current classes. This is costly, only use if there is no other solution
val assert_lit : t -> lit -> unit
Given a literal, assume it in the congruence closure and propagate its consequences. Will be backtracked.
Useful for the theory combination or the SAT solver's functor
val assert_lits : t -> lit Iter.t -> unit
Addition of many literals
val explain_eq : t -> N.t -> N.t -> lit list
Explain why the two nodes are equal. Fails if they are not, in an unspecified way
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
Raise a conflict with the given explanation it must be a theory tautology that expl ==> absurd. To be used in theories.
val n_true : t -> N.t
Node for true
val n_false : t -> N.t
Node for false
val n_bool : t -> bool -> N.t
Node for either true or false
val merge : t -> N.t -> N.t -> Expl.t -> unit
Merge these two nodes given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val merge_t : t -> term -> term -> Expl.t -> unit
Shortcut for adding + merging
val check : t -> actions -> unit
Perform all pending operations done via assert_eq, assert_lit, etc. Will use the actions to propagate literals, declare conflicts, etc.
val new_merges : t -> bool
Called after check, returns true if some pairs of classes were merged.
val push_level : t -> unit
Push backtracking level
val pop_levels : t -> int -> unit
Restore to state n calls to push_level earlier. Used during backtracking.
val get_model : t -> N.t Iter.t Iter.t
get all the equivalence classes so they can be merged in the model

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_cc/index.html b/dev/sidekick/Sidekick_cc/index.html
index 7e623b2f..81c32225 100644
--- a/dev/sidekick/Sidekick_cc/index.html
+++ b/dev/sidekick/Sidekick_cc/index.html
@@ -1,3 +1,3 @@
 
-Sidekick_cc (sidekick.Sidekick_cc)
Module Sidekick_cc
Congruence Closure
module type S = Sidekick_core.CC_S
module Make (A : Sidekick_core.CC_ARG) : S with module T = A.T and module Lit = A.Lit and type proof = A.proof and type proof_step = A.proof_step and module
+Sidekick_cc (sidekick.Sidekick_cc)
Module Sidekick_cc
Congruence Closure
module type S = Sidekick_core.CC_S
module Make (A : Sidekick_core.CC_ARG) : S with module T = A.T and module Lit = A.Lit and type proof = A.proof and type proof_step = A.proof_step and module
 Actions = A.Actions
first, some aliases.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/CC_view/index.html b/dev/sidekick/Sidekick_core/CC_view/index.html
index 10895f57..b0ac2b20 100644
--- a/dev/sidekick/Sidekick_core/CC_view/index.html
+++ b/dev/sidekick/Sidekick_core/CC_view/index.html
@@ -1,4 +1,4 @@
 
-CC_view (sidekick.Sidekick_core.CC_view)
Module Sidekick_core.CC_view
View terms through the lens of the Congruence Closure
type ('f, 't, 'ts) t = 
| Bool of bool
| App_fun of 'f * 'ts
| App_ho of 't * 't
| If of 't * 't * 't
| Eq of 't * 't
| Not of 't
| Opaque of 't
A view of a term fron the point of view of the congruence closure.
  • 'f is the type of function symbols
  • 't is the type of terms
  • 'ts is the type of sequences of terms (arguments of function application)
val map_view : f_f:('a -> 'b) -> f_t:('c -> 'd) -> f_ts:('e -> 'f) ->
+CC_view (sidekick.Sidekick_core.CC_view)
Module Sidekick_core.CC_view
View terms through the lens of the Congruence Closure
type ('f, 't, 'ts) t = 
| Bool of bool
| App_fun of 'f * 'ts
| App_ho of 't * 't
| If of 't * 't * 't
| Eq of 't * 't
| Not of 't
| Opaque of 't
A view of a term fron the point of view of the congruence closure.
  • 'f is the type of function symbols
  • 't is the type of terms
  • 'ts is the type of sequences of terms (arguments of function application)
val map_view : f_f:('a -> 'b) -> f_t:('c -> 'd) -> f_ts:('e -> 'f) ->
 ('a, 'c, 'e) t -> ('b, 'd, 'f) t
Map function over a view, one level deep. Each function maps over a different type, e.g. f_t maps over terms
val iter_view : f_f:('a -> unit) -> f_t:('b -> unit) -> f_ts:('c -> unit) ->
 ('a, 'b, 'c) t -> unit
Iterate over a view, one level deep.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/Actions/P/index.html b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/Actions/P/index.html
index 62594d0d..c5daeaa6 100644
--- a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/Actions/P/index.html
+++ b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/Actions/index.html b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/Actions/index.html
index 66959b28..cd39b62e 100644
--- a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/Actions/index.html
+++ b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
+Actions (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/Expl/index.html b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/Expl/index.html
index 4663a3ca..3e1a96f9 100644
--- a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/Expl/index.html
+++ b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/N/index.html b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/N/index.html
index 3ece2f43..b3a58537 100644
--- a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/N/index.html
+++ b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
+N (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/P/index.html b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/P/index.html
index 0ccba474..c35146d7 100644
--- a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/P/index.html
+++ b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/index.html b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/index.html
index 90611400..f694e31a 100644
--- a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/index.html
+++ b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/CC/index.html
@@ -1,4 +1,4 @@
 
-CC (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.CC)
Module SI.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+CC (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.CC)
Module SI.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Small | `Big ] -> term_store -> proof -> t
Create a new congruence closure.
  • parameter term_store 
    used to be able to create new terms. All terms interacting with this congruence closure must belong in this term state as well.
val allocate_bitfield : descr:string -> t -> N.bitfield
Allocate a new node field (see N.bitfield).
This field descriptor is henceforth reserved for all nodes in this congruence closure, and can be set using set_bitfield for each node individually. This can be used to efficiently store some metadata on nodes (e.g. "is there a numeric value in the class" or "is there a constructor term in the class").
There may be restrictions on how many distinct fields are allocated for a given congruence closure (e.g. at most Sys.int_size fields).
val get_bitfield : t -> N.bitfield -> N.t -> bool
Access the bit field of the given node
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
Set the bitfield for the node. This will be backtracked. See N.bitfield.
val on_pre_merge : t -> ev_on_pre_merge -> unit
Add a function to be called when two classes are merged
val on_post_merge : t -> ev_on_post_merge -> unit
Add a function to be called when two classes are merged
val on_new_term : t -> ev_on_new_term -> unit
Add a function to be called when a new node is created
val on_conflict : t -> ev_on_conflict -> unit
Called when the congruence closure finds a conflict
val on_propagate : t -> ev_on_propagate -> unit
Called when the congruence closure propagates a literal
val on_is_subterm : t -> ev_on_is_subterm -> unit
Called on terms that are subterms of function symbols
val set_as_lit : t -> N.t -> lit -> unit
map the given node to a literal.
val find_t : t -> term -> repr
Current representative of the term.
  • raises Not_found 
    if the term is not already add-ed.
val add_seq : t -> term Iter.t -> unit
Add a sequence of terms to the congruence closure
val all_classes : t -> repr Iter.t
All current classes. This is costly, only use if there is no other solution
val assert_lit : t -> lit -> unit
Given a literal, assume it in the congruence closure and propagate its consequences. Will be backtracked.
Useful for the theory combination or the SAT solver's functor
val assert_lits : t -> lit Iter.t -> unit
Addition of many literals
val explain_eq : t -> N.t -> N.t -> lit list
Explain why the two nodes are equal. Fails if they are not, in an unspecified way
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
Raise a conflict with the given explanation it must be a theory tautology that expl ==> absurd. To be used in theories.
val n_true : t -> N.t
Node for true
val n_false : t -> N.t
Node for false
val n_bool : t -> bool -> N.t
Node for either true or false
val merge : t -> N.t -> N.t -> Expl.t -> unit
Merge these two nodes given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val merge_t : t -> term -> term -> Expl.t -> unit
Shortcut for adding + merging
val check : t -> actions -> unit
Perform all pending operations done via assert_eq, assert_lit, etc. Will use the actions to propagate literals, declare conflicts, etc.
val new_merges : t -> bool
Called after check, returns true if some pairs of classes were merged.
val push_level : t -> unit
Push backtracking level
val pop_levels : t -> int -> unit
Restore to state n calls to push_level earlier. Used during backtracking.
val get_model : t -> N.t Iter.t Iter.t
get all the equivalence classes so they can be merged in the model

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/Lit/index.html b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/Lit/index.html
index 0aa623fb..d5d8631b 100644
--- a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/Lit/index.html
+++ b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.Lit)
Module SI.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
+Lit (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.Lit)
Module SI.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/P/Step_vec/index.html b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/P/Step_vec/index.html
index d8b06d28..b5ea404a 100644
--- a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/P/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/P/index.html b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/P/index.html
index 8ad60c7d..60cc1d1c 100644
--- a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/P/index.html
+++ b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.P)
Module SI.P
Proofs
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = term
type lit = Lit.t
type proof_rule = t -> proof_step
include CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
+P (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.P)
Module SI.P
Proofs
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = term
type lit = Lit.t
type proof_rule = t -> proof_step
include CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/Simplify/index.html b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/Simplify/index.html
index 403431f3..6e0b4f1f 100644
--- a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/Simplify/index.html
+++ b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/Simplify/index.html
@@ -1,2 +1,2 @@
 
-Simplify (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.Simplify)
Module SI.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
+Simplify (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.Simplify)
Module SI.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/T/Fun/index.html b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/T/Fun/index.html
index ed746dfd..5c0475fa 100644
--- a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/T/Term/index.html b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/T/Term/index.html
index 1fe7ac59..5a43e326 100644
--- a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/T/Term/index.html
+++ b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/T/Ty/index.html b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/T/Ty/index.html
index d89bbe45..c4e42d5e 100644
--- a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/T/index.html b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/T/index.html
index 36e1ea77..c528a41e 100644
--- a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/T/index.html
+++ b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.T)
Module SI.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.T)
Module SI.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/index.html b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/index.html
index f4559209..9fe15647 100644
--- a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/index.html
+++ b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/index.html
@@ -1,3 +1,3 @@
 
-SI (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI)
Module 1-M.SI
module T : TERM
module Lit : LIT with module T = T
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof
type proof_step
module P : PROOF with type lit = Lit.t and type term = term and type t = proof and type proof_step = proof_step
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
+SI (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI)
Module 1-M.SI
module T : TERM
module Lit : LIT with module T = T
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof
type proof_step
module P : PROOF with type lit = Lit.t and type term = term and type t = proof and type proof_step = proof_step
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
 P.t = proof and type P.lit = lit and type Actions.t = theory_actions
Congruence closure instance
val cc : t -> CC.t
Congruence closure for this solver
Simplifiers
module Simplify : sig ... end
Simplify terms
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
Add a simplifier hook for preprocessing.
val simplify_t : t -> term -> (term * proof_step) option
Simplify input term, returns Some u if some simplification occurred.
val simp_t : t -> term -> term * proof_step option
simp_t si t returns u even if no simplification occurred (in which case t == u syntactically). It emits |- t=u. (see simplifier)
Preprocessors
These preprocessors turn mixed, raw literals (possibly simplified) into literals suitable for reasoning. Typically some clauses are also added to the solver.
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
Actions available to the preprocessor
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
Given a term, try to preprocess it. Return None if it didn't change, or Some (u) if t=u. Can also add clauses to define new terms.
Preprocessing might transform terms to make them more amenable to reasoning, e.g. by removing boolean formulas via Tseitin encoding, adding clauses that encode their meaning in the same move.
  • parameter preprocess_actions 
    actions available during preprocessing.
val on_preprocess : t -> preprocess_hook -> unit
Add a hook that will be called when terms are preprocessed
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
Obtain preprocessor actions, from theory actions
hooks for the theory
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
Give a conflict clause to the solver
val push_decision : t -> theory_actions -> lit -> unit
Ask the SAT solver to decide the given literal in an extension of the current trail. This is useful for theory combination. If the SAT solver backtracks, this (potential) decision is removed and forgotten.
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
Add local clause to the SAT solver. This clause will be removed when the solver backtracks.
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
Add toplevel clause to the SAT solver. This clause will not be backtracked.
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
Create a literal. This automatically preprocesses the term.
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
Preprocess a term.
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
Add the given literal to the SAT solver, so it gets assigned a boolean value.
  • parameter default_pol 
    default polarity for the corresponding atom
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
Add the given (signed) bool term to the SAT solver, so it gets assigned a boolean value
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
Raise a conflict with the given congruence closure explanation. it must be a theory tautology that expl ==> absurd. To be used in theories.
val cc_find : t -> CC.N.t -> CC.N.t
Find representative of the node
val cc_are_equal : t -> term -> term -> bool
Are these two terms equal in the congruence closure?
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
Merge these two nodes in the congruence closure, given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
Merge these two terms in the congruence closure, given this explanation. See cc_merge
val cc_add_term : t -> term -> CC.N.t
Add/retrieve congruence closure node for this term. To be used in theories
val cc_mem_term : t -> term -> bool
Return true if the term is explicitly in the congruence closure. To be used in theories
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called before)
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called after)
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
Callback to add data on terms when they are added to the congruence closure
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
Callback for when a term is a subterm of another term in the congruence closure
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
Callback called on every CC conflict
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
Callback called on every CC propagation
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callbacked to be called with the slice of literals newly added on the trail.
This is called very often and should be efficient. It doesn't have to be complete, only correct. It's given only the slice of the trail consisting in new literals.
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callback to be called during the final check.
Must be complete (i.e. must raise a conflict if the set of literals is not satisfiable) and can be expensive. The function is given the whole trail.
Model production
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
A model-production hook. It takes the solver, a class, and returns a term for this class. For example, an arithmetic theory might detect that a class contains a numeric constant, and return this constant as a model value.
If no hook assigns a value to a class, a fake value is created for it.
val on_model_gen : t -> model_hook -> unit
Add a hook that will be called when a model is being produced

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/module-type-PREPROCESS_ACTS/index.html b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/module-type-PREPROCESS_ACTS/index.html
index b83026fd..ea28f048 100644
--- a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/module-type-PREPROCESS_ACTS/index.html
+++ b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/SI/module-type-PREPROCESS_ACTS/index.html
@@ -1,2 +1,2 @@
 
-PREPROCESS_ACTS (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.PREPROCESS_ACTS)
Module type SI.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
+PREPROCESS_ACTS (sidekick.Sidekick_core.Monoid_of_repr.1-M.SI.PREPROCESS_ACTS)
Module type SI.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/index.html b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/index.html
index 19a6d0e4..3d27e748 100644
--- a/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/index.html
+++ b/dev/sidekick/Sidekick_core/Monoid_of_repr/argument-1-M/index.html
@@ -1,2 +1,2 @@
 
-M (sidekick.Sidekick_core.Monoid_of_repr.1-M)
Parameter Monoid_of_repr.1-M
type t
Some type with a monoid structure
val pp : t Fmt.printer
val name : string
name of the monoid structure (short)
val of_term : SI.CC.t -> SI.CC.N.t -> SI.T.Term.t -> t option * (SI.CC.N.t * t) list
of_term n t, where t is the term annotating node n, must return maybe_m, l, where:
  • maybe_m = Some m if t has monoid value m; otherwise maybe_m=None
  • l is a list of (u, m_u) where each u's term is a direct subterm of t and m_u is the monoid value attached to u.
val merge : SI.CC.t -> SI.CC.N.t -> t -> SI.CC.N.t -> t -> SI.CC.Expl.t -> (t, SI.CC.Expl.t) Stdlib.result
Monoidal combination of two values.
merge cc n1 mon1 n2 mon2 expl returns the result of merging monoid values mon1 (for class n1) and mon2 (for class n2) when n1 and n2 are merged with explanation expl.
  • returns 
    Ok mon if the merge is acceptable, annotating the class of n1 ∪ n2; or Error expl' if the merge is unsatisfiable. expl' can then be used to trigger a conflict and undo the merge.

\ No newline at end of file
+M (sidekick.Sidekick_core.Monoid_of_repr.1-M)
Parameter Monoid_of_repr.1-M
type t
Some type with a monoid structure
val pp : t Fmt.printer
val name : string
name of the monoid structure (short)
val of_term : SI.CC.t -> SI.CC.N.t -> SI.T.Term.t -> t option * (SI.CC.N.t * t) list
of_term n t, where t is the term annotating node n, must return maybe_m, l, where:
  • maybe_m = Some m if t has monoid value m; otherwise maybe_m=None
  • l is a list of (u, m_u) where each u's term is a direct subterm of t and m_u is the monoid value attached to u.
val merge : SI.CC.t -> SI.CC.N.t -> t -> SI.CC.N.t -> t -> SI.CC.Expl.t -> (t, SI.CC.Expl.t) Stdlib.result
Monoidal combination of two values.
merge cc n1 mon1 n2 mon2 expl returns the result of merging monoid values mon1 (for class n1) and mon2 (for class n2) when n1 and n2 are merged with explanation expl.
  • returns 
    Ok mon if the merge is acceptable, annotating the class of n1 ∪ n2; or Error expl' if the merge is unsatisfiable. expl' can then be used to trigger a conflict and undo the merge.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/Monoid_of_repr/index.html b/dev/sidekick/Sidekick_core/Monoid_of_repr/index.html
index 2b2f16e2..47743c5d 100644
--- a/dev/sidekick/Sidekick_core/Monoid_of_repr/index.html
+++ b/dev/sidekick/Sidekick_core/Monoid_of_repr/index.html
@@ -1,2 +1,2 @@
 
-Monoid_of_repr (sidekick.Sidekick_core.Monoid_of_repr)
Module Sidekick_core.Monoid_of_repr
State for a per-equivalence-class monoid.
Helps keep track of monoid state per equivalence class. A theory might use one or more instance(s) of this to aggregate some theory-specific state over all terms, with the information of what terms are already known to be equal potentially saving work for the theory.
Parameters
module M : MONOID_ARG
Signature
type t
val create_and_setup : ?size:int -> M.SI.t -> t
Create a new monoid state
val push_level : t -> unit
Push backtracking point
val pop_levels : t -> int -> unit
Pop n backtracking points
val mem : t -> M.SI.CC.N.t -> bool
Does the CC node have a monoid value?
val get : t -> M.SI.CC.N.t -> M.t option
Get monoid value for this CC node, if any
val iter_all : t -> (M.SI.CC.repr * M.t) Iter.t
val pp : t Fmt.printer

\ No newline at end of file
+Monoid_of_repr (sidekick.Sidekick_core.Monoid_of_repr)
Module Sidekick_core.Monoid_of_repr
State for a per-equivalence-class monoid.
Helps keep track of monoid state per equivalence class. A theory might use one or more instance(s) of this to aggregate some theory-specific state over all terms, with the information of what terms are already known to be equal potentially saving work for the theory.
Parameters
module M : MONOID_ARG
Signature
type t
val create_and_setup : ?size:int -> M.SI.t -> t
Create a new monoid state
val push_level : t -> unit
Push backtracking point
val pop_levels : t -> int -> unit
Pop n backtracking points
val mem : t -> M.SI.CC.N.t -> bool
Does the CC node have a monoid value?
val get : t -> M.SI.CC.N.t -> M.t option
Get monoid value for this CC node, if any
val iter_all : t -> (M.SI.CC.repr * M.t) Iter.t
val pp : t Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/index.html b/dev/sidekick/Sidekick_core/index.html
index bdb171b2..9159dc67 100644
--- a/dev/sidekick/Sidekick_core/index.html
+++ b/dev/sidekick/Sidekick_core/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_core (sidekick.Sidekick_core)
Module Sidekick_core
Main Signatures
Theories and concrete solvers rely on an environment that defines several important types:
  • sorts
  • terms (to represent logic expressions and formulas)
  • a congruence closure instance
  • a bridge to some SAT solver
In this module we define most of the main signatures used throughout Sidekick.
module Fmt = CCFormat
module CC_view : sig ... end
View terms through the lens of the Congruence Closure
module type TERM = sig ... end
Main representation of Terms and Types
module type CC_PROOF = sig ... end
Proofs for the congruence closure
module type SAT_PROOF = sig ... end
Signature for SAT-solver proof emission.
module type PROOF = sig ... end
Proofs of unsatisfiability.
module type LIT = sig ... end
Literals
module type CC_ACTIONS = sig ... end
Actions provided to the congruence closure.
module type CC_ARG = sig ... end
Arguments to a congruence closure's implementation
module type CC_S = sig ... end
Main congruence closure signature.
module type SOLVER_INTERNAL = sig ... end
A view of the solver from a theory's point of view.
module type SOLVER = sig ... end
User facing view of the solver
module type MONOID_ARG = sig ... end
Helper for the congruence closure
module Monoid_of_repr (M : MONOID_ARG) : sig ... end
State for a per-equivalence-class monoid.

\ No newline at end of file
+Sidekick_core (sidekick.Sidekick_core)
Module Sidekick_core
Main Signatures
Theories and concrete solvers rely on an environment that defines several important types:
  • sorts
  • terms (to represent logic expressions and formulas)
  • a congruence closure instance
  • a bridge to some SAT solver
In this module we define most of the main signatures used throughout Sidekick.
module Fmt = CCFormat
module CC_view : sig ... end
View terms through the lens of the Congruence Closure
module type TERM = sig ... end
Main representation of Terms and Types
module type CC_PROOF = sig ... end
Proofs for the congruence closure
module type SAT_PROOF = sig ... end
Signature for SAT-solver proof emission.
module type PROOF = sig ... end
Proofs of unsatisfiability.
module type LIT = sig ... end
Literals
module type CC_ACTIONS = sig ... end
Actions provided to the congruence closure.
module type CC_ARG = sig ... end
Arguments to a congruence closure's implementation
module type CC_S = sig ... end
Main congruence closure signature.
module type SOLVER_INTERNAL = sig ... end
A view of the solver from a theory's point of view.
module type SOLVER = sig ... end
User facing view of the solver
module type MONOID_ARG = sig ... end
Helper for the congruence closure
module Monoid_of_repr (M : MONOID_ARG) : sig ... end
State for a per-equivalence-class monoid.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/Lit/index.html b/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/Lit/index.html
index e7e528bc..456276ca 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/Lit/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_core.CC_ACTIONS.Lit)
Module CC_ACTIONS.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
+Lit (sidekick.Sidekick_core.CC_ACTIONS.Lit)
Module CC_ACTIONS.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/P/index.html b/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/P/index.html
index 1a1d8d5e..1ceee59e 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/P/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_core.CC_ACTIONS.P)
Module CC_ACTIONS.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_core.CC_ACTIONS.P)
Module CC_ACTIONS.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/T/Fun/index.html b/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/T/Fun/index.html
index 1f0dbe52..a935c5b8 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_core.CC_ACTIONS.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_core.CC_ACTIONS.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/T/Term/index.html b/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/T/Term/index.html
index 03143d3e..dae3f1b1 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/T/Term/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_core.CC_ACTIONS.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_core.CC_ACTIONS.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/T/Ty/index.html b/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/T/Ty/index.html
index 8e2f125a..99901ce9 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_core.CC_ACTIONS.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_core.CC_ACTIONS.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/T/index.html b/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/T/index.html
index 23d2f960..a2a92bd4 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/T/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_core.CC_ACTIONS.T)
Module CC_ACTIONS.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_core.CC_ACTIONS.T)
Module CC_ACTIONS.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/index.html b/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/index.html
index 2df2ccd1..1d2daeb2 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_ACTIONS/index.html
@@ -1,2 +1,2 @@
 
-CC_ACTIONS (sidekick.Sidekick_core.CC_ACTIONS)
Module type Sidekick_core.CC_ACTIONS
Actions provided to the congruence closure.
The congruence closure must be able to propagate literals when it detects that they are true or false; it must also be able to create conflicts when the set of (dis)equalities is inconsistent
module T : TERM
module Lit : LIT with module T = T
type proof
type proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
type t
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
+CC_ACTIONS (sidekick.Sidekick_core.CC_ACTIONS)
Module type Sidekick_core.CC_ACTIONS
Actions provided to the congruence closure.
The congruence closure must be able to propagate literals when it detects that they are true or false; it must also be able to create conflicts when the set of (dis)equalities is inconsistent
module T : TERM
module Lit : LIT with module T = T
type proof
type proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
type t
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_ARG/Actions/P/index.html b/dev/sidekick/Sidekick_core/module-type-CC_ARG/Actions/P/index.html
index 15a390d4..2a16e4d9 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_ARG/Actions/P/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_ARG/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_core.CC_ARG.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_core.CC_ARG.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_ARG/Actions/index.html b/dev/sidekick/Sidekick_core/module-type-CC_ARG/Actions/index.html
index 2a53115a..72acea38 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_ARG/Actions/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_ARG/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick.Sidekick_core.CC_ARG.Actions)
Module CC_ARG.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
type t
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
+Actions (sidekick.Sidekick_core.CC_ARG.Actions)
Module CC_ARG.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
type t
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_ARG/Lit/index.html b/dev/sidekick/Sidekick_core/module-type-CC_ARG/Lit/index.html
index 421eb86a..8279a1a3 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_ARG/Lit/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_ARG/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_core.CC_ARG.Lit)
Module CC_ARG.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
+Lit (sidekick.Sidekick_core.CC_ARG.Lit)
Module CC_ARG.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_ARG/P/index.html b/dev/sidekick/Sidekick_core/module-type-CC_ARG/P/index.html
index ae0aca34..a1807d60 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_ARG/P/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_ARG/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_core.CC_ARG.P)
Module CC_ARG.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_core.CC_ARG.P)
Module CC_ARG.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_ARG/T/Fun/index.html b/dev/sidekick/Sidekick_core/module-type-CC_ARG/T/Fun/index.html
index ae539b0c..7d11914f 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_ARG/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_ARG/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_core.CC_ARG.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_core.CC_ARG.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_ARG/T/Term/index.html b/dev/sidekick/Sidekick_core/module-type-CC_ARG/T/Term/index.html
index 6db6543f..f82e4705 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_ARG/T/Term/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_ARG/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_core.CC_ARG.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_core.CC_ARG.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_ARG/T/Ty/index.html b/dev/sidekick/Sidekick_core/module-type-CC_ARG/T/Ty/index.html
index 2825a5b0..a2c9e8d1 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_ARG/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_ARG/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_core.CC_ARG.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_core.CC_ARG.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_ARG/T/index.html b/dev/sidekick/Sidekick_core/module-type-CC_ARG/T/index.html
index 36b39efa..3a383798 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_ARG/T/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_ARG/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_core.CC_ARG.T)
Module CC_ARG.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_core.CC_ARG.T)
Module CC_ARG.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_ARG/index.html b/dev/sidekick/Sidekick_core/module-type-CC_ARG/index.html
index fb715414..e6a197bc 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_ARG/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_ARG/index.html
@@ -1,2 +1,2 @@
 
-CC_ARG (sidekick.Sidekick_core.CC_ARG)
Module type Sidekick_core.CC_ARG
Arguments to a congruence closure's implementation
module T : TERM
module Lit : LIT with module T = T
type proof
type proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
module Actions : CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step
val cc_view : T.Term.t -> (T.Fun.t, T.Term.t, T.Term.t Iter.t) CC_view.t
View the term through the lens of the congruence closure

\ No newline at end of file
+CC_ARG (sidekick.Sidekick_core.CC_ARG)
Module type Sidekick_core.CC_ARG
Arguments to a congruence closure's implementation
module T : TERM
module Lit : LIT with module T = T
type proof
type proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
module Actions : CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step
val cc_view : T.Term.t -> (T.Fun.t, T.Term.t, T.Term.t Iter.t) CC_view.t
View the term through the lens of the congruence closure

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_PROOF/index.html b/dev/sidekick/Sidekick_core/module-type-CC_PROOF/index.html
index 234fd519..1cd3208d 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_PROOF/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_PROOF/index.html
@@ -1,2 +1,2 @@
 
-CC_PROOF (sidekick.Sidekick_core.CC_PROOF)
Module type Sidekick_core.CC_PROOF
Proofs for the congruence closure
type proof_step
type t
type lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+CC_PROOF (sidekick.Sidekick_core.CC_PROOF)
Module type Sidekick_core.CC_PROOF
Proofs for the congruence closure
type proof_step
type t
type lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_S/Actions/P/index.html b/dev/sidekick/Sidekick_core/module-type-CC_S/Actions/P/index.html
index 910a627f..d80be79f 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_S/Actions/P/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_S/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_core.CC_S.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_core.CC_S.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_S/Actions/index.html b/dev/sidekick/Sidekick_core/module-type-CC_S/Actions/index.html
index 7daa4b12..749ef029 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_S/Actions/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_S/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick.Sidekick_core.CC_S.Actions)
Module CC_S.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
type t
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
+Actions (sidekick.Sidekick_core.CC_S.Actions)
Module CC_S.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
type t
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_S/Expl/index.html b/dev/sidekick/Sidekick_core/module-type-CC_S/Expl/index.html
index e2569df6..6d69c902 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_S/Expl/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_S/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick.Sidekick_core.CC_S.Expl)
Module CC_S.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick.Sidekick_core.CC_S.Expl)
Module CC_S.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_S/Lit/index.html b/dev/sidekick/Sidekick_core/module-type-CC_S/Lit/index.html
index 81ee7f17..d462b962 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_S/Lit/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_S/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_core.CC_S.Lit)
Module CC_S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
+Lit (sidekick.Sidekick_core.CC_S.Lit)
Module CC_S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_S/N/index.html b/dev/sidekick/Sidekick_core/module-type-CC_S/N/index.html
index 7028671e..79bee81e 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_S/N/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_S/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick.Sidekick_core.CC_S.N)
Module CC_S.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
+N (sidekick.Sidekick_core.CC_S.N)
Module CC_S.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_S/P/index.html b/dev/sidekick/Sidekick_core/module-type-CC_S/P/index.html
index 83572c49..d8560d5b 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_S/P/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_S/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_core.CC_S.P)
Module CC_S.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_core.CC_S.P)
Module CC_S.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_S/T/Fun/index.html b/dev/sidekick/Sidekick_core/module-type-CC_S/T/Fun/index.html
index 4b24d50f..1f060ba0 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_S/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_S/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_core.CC_S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_core.CC_S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_S/T/Term/index.html b/dev/sidekick/Sidekick_core/module-type-CC_S/T/Term/index.html
index 39959ead..5a7ebee9 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_S/T/Term/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_S/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_core.CC_S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_core.CC_S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_S/T/Ty/index.html b/dev/sidekick/Sidekick_core/module-type-CC_S/T/Ty/index.html
index 84d78f6a..62e118c8 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_S/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_S/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_core.CC_S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_core.CC_S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_S/T/index.html b/dev/sidekick/Sidekick_core/module-type-CC_S/T/index.html
index e26de58f..52f44940 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_S/T/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_S/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_core.CC_S.T)
Module CC_S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_core.CC_S.T)
Module CC_S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-CC_S/index.html b/dev/sidekick/Sidekick_core/module-type-CC_S/index.html
index b9ca416e..0cae1357 100644
--- a/dev/sidekick/Sidekick_core/module-type-CC_S/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-CC_S/index.html
@@ -1,4 +1,4 @@
 
-CC_S (sidekick.Sidekick_core.CC_S)
Module type Sidekick_core.CC_S
Main congruence closure signature.
The congruence closure handles the theory QF_UF (uninterpreted function symbols). It is also responsible for theory combination, and provides a general framework for equality reasoning that other theories piggyback on.
For example, the theory of datatypes relies on the congruence closure to do most of the work, and "only" adds injectivity/disjointness/acyclicity lemmas when needed.
Similarly, a theory of arrays would hook into the congruence closure and assert (dis)equalities as needed.
first, some aliases.
module T : TERM
module Lit : LIT with module T = T
type proof
type proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
module Actions : CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+CC_S (sidekick.Sidekick_core.CC_S)
Module type Sidekick_core.CC_S
Main congruence closure signature.
The congruence closure handles the theory QF_UF (uninterpreted function symbols). It is also responsible for theory combination, and provides a general framework for equality reasoning that other theories piggyback on.
For example, the theory of datatypes relies on the congruence closure to do most of the work, and "only" adds injectivity/disjointness/acyclicity lemmas when needed.
Similarly, a theory of arrays would hook into the congruence closure and assert (dis)equalities as needed.
first, some aliases.
module T : TERM
module Lit : LIT with module T = T
type proof
type proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
module Actions : CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Small | `Big ] -> term_store -> proof -> t
Create a new congruence closure.
  • parameter term_store 
    used to be able to create new terms. All terms interacting with this congruence closure must belong in this term state as well.
val allocate_bitfield : descr:string -> t -> N.bitfield
Allocate a new node field (see N.bitfield).
This field descriptor is henceforth reserved for all nodes in this congruence closure, and can be set using set_bitfield for each node individually. This can be used to efficiently store some metadata on nodes (e.g. "is there a numeric value in the class" or "is there a constructor term in the class").
There may be restrictions on how many distinct fields are allocated for a given congruence closure (e.g. at most Sys.int_size fields).
val get_bitfield : t -> N.bitfield -> N.t -> bool
Access the bit field of the given node
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
Set the bitfield for the node. This will be backtracked. See N.bitfield.
val on_pre_merge : t -> ev_on_pre_merge -> unit
Add a function to be called when two classes are merged
val on_post_merge : t -> ev_on_post_merge -> unit
Add a function to be called when two classes are merged
val on_new_term : t -> ev_on_new_term -> unit
Add a function to be called when a new node is created
val on_conflict : t -> ev_on_conflict -> unit
Called when the congruence closure finds a conflict
val on_propagate : t -> ev_on_propagate -> unit
Called when the congruence closure propagates a literal
val on_is_subterm : t -> ev_on_is_subterm -> unit
Called on terms that are subterms of function symbols
val set_as_lit : t -> N.t -> lit -> unit
map the given node to a literal.
val find_t : t -> term -> repr
Current representative of the term.
  • raises Not_found 
    if the term is not already add-ed.
val add_seq : t -> term Iter.t -> unit
Add a sequence of terms to the congruence closure
val all_classes : t -> repr Iter.t
All current classes. This is costly, only use if there is no other solution
val assert_lit : t -> lit -> unit
Given a literal, assume it in the congruence closure and propagate its consequences. Will be backtracked.
Useful for the theory combination or the SAT solver's functor
val assert_lits : t -> lit Iter.t -> unit
Addition of many literals
val explain_eq : t -> N.t -> N.t -> lit list
Explain why the two nodes are equal. Fails if they are not, in an unspecified way
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
Raise a conflict with the given explanation it must be a theory tautology that expl ==> absurd. To be used in theories.
val n_true : t -> N.t
Node for true
val n_false : t -> N.t
Node for false
val n_bool : t -> bool -> N.t
Node for either true or false
val merge : t -> N.t -> N.t -> Expl.t -> unit
Merge these two nodes given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val merge_t : t -> term -> term -> Expl.t -> unit
Shortcut for adding + merging
val check : t -> actions -> unit
Perform all pending operations done via assert_eq, assert_lit, etc. Will use the actions to propagate literals, declare conflicts, etc.
val new_merges : t -> bool
Called after check, returns true if some pairs of classes were merged.
val push_level : t -> unit
Push backtracking level
val pop_levels : t -> int -> unit
Restore to state n calls to push_level earlier. Used during backtracking.
val get_model : t -> N.t Iter.t Iter.t
get all the equivalence classes so they can be merged in the model

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-LIT/T/Fun/index.html b/dev/sidekick/Sidekick_core/module-type-LIT/T/Fun/index.html
index c7aef48e..20b1ad33 100644
--- a/dev/sidekick/Sidekick_core/module-type-LIT/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-LIT/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_core.LIT.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_core.LIT.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-LIT/T/Term/index.html b/dev/sidekick/Sidekick_core/module-type-LIT/T/Term/index.html
index 87509f9c..75591d1a 100644
--- a/dev/sidekick/Sidekick_core/module-type-LIT/T/Term/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-LIT/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_core.LIT.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_core.LIT.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_core/module-type-LIT/T/Ty/index.html b/dev/sidekick/Sidekick_core/module-type-LIT/T/Ty/index.html
index dc8a7dc3..2260a33b 100644
--- a/dev/sidekick/Sidekick_core/module-type-LIT/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-LIT/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_core.LIT.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_core.LIT.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-LIT/T/index.html b/dev/sidekick/Sidekick_core/module-type-LIT/T/index.html
index 2a9ee06c..967c3b1a 100644
--- a/dev/sidekick/Sidekick_core/module-type-LIT/T/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-LIT/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_core.LIT.T)
Module LIT.T
Literals depend on terms
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_core.LIT.T)
Module LIT.T
Literals depend on terms
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-LIT/index.html b/dev/sidekick/Sidekick_core/module-type-LIT/index.html
index 2e6712d6..5ce3a9a1 100644
--- a/dev/sidekick/Sidekick_core/module-type-LIT/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-LIT/index.html
@@ -1,2 +1,2 @@
 
-LIT (sidekick.Sidekick_core.LIT)
Module type Sidekick_core.LIT
Literals
Literals are a pair of a boolean-sorted term, and a sign. Positive literals are the same as their term, and negative literals are the negation of their term.
The SAT solver deals only in literals and clauses (sets of literals). Everything else belongs in the SMT solver.
module T : TERM
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
+LIT (sidekick.Sidekick_core.LIT)
Module type Sidekick_core.LIT
Literals
Literals are a pair of a boolean-sorted term, and a sign. Positive literals are the same as their term, and negative literals are the negation of their term.
The SAT solver deals only in literals and clauses (sets of literals). Everything else belongs in the SMT solver.
module T : TERM
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/Actions/P/index.html b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/Actions/P/index.html
index d09e9b4e..68b7bbe7 100644
--- a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/Actions/P/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_core.MONOID_ARG.SI.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_core.MONOID_ARG.SI.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/Actions/index.html b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/Actions/index.html
index efd836ac..920ddb6b 100644
--- a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/Actions/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick.Sidekick_core.MONOID_ARG.SI.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
+Actions (sidekick.Sidekick_core.MONOID_ARG.SI.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/Expl/index.html b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/Expl/index.html
index 32e03a6d..d38911bf 100644
--- a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/Expl/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick.Sidekick_core.MONOID_ARG.SI.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick.Sidekick_core.MONOID_ARG.SI.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/N/index.html b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/N/index.html
index 23a43deb..1d336203 100644
--- a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/N/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick.Sidekick_core.MONOID_ARG.SI.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
+N (sidekick.Sidekick_core.MONOID_ARG.SI.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/P/index.html b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/P/index.html
index eef3e4f5..77d67f80 100644
--- a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/P/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_core.MONOID_ARG.SI.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_core.MONOID_ARG.SI.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/index.html b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/index.html
index bb32ecc6..26073477 100644
--- a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/CC/index.html
@@ -1,4 +1,4 @@
 
-CC (sidekick.Sidekick_core.MONOID_ARG.SI.CC)
Module SI.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+CC (sidekick.Sidekick_core.MONOID_ARG.SI.CC)
Module SI.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Small | `Big ] -> term_store -> proof -> t
Create a new congruence closure.
  • parameter term_store 
    used to be able to create new terms. All terms interacting with this congruence closure must belong in this term state as well.
val allocate_bitfield : descr:string -> t -> N.bitfield
Allocate a new node field (see N.bitfield).
This field descriptor is henceforth reserved for all nodes in this congruence closure, and can be set using set_bitfield for each node individually. This can be used to efficiently store some metadata on nodes (e.g. "is there a numeric value in the class" or "is there a constructor term in the class").
There may be restrictions on how many distinct fields are allocated for a given congruence closure (e.g. at most Sys.int_size fields).
val get_bitfield : t -> N.bitfield -> N.t -> bool
Access the bit field of the given node
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
Set the bitfield for the node. This will be backtracked. See N.bitfield.
val on_pre_merge : t -> ev_on_pre_merge -> unit
Add a function to be called when two classes are merged
val on_post_merge : t -> ev_on_post_merge -> unit
Add a function to be called when two classes are merged
val on_new_term : t -> ev_on_new_term -> unit
Add a function to be called when a new node is created
val on_conflict : t -> ev_on_conflict -> unit
Called when the congruence closure finds a conflict
val on_propagate : t -> ev_on_propagate -> unit
Called when the congruence closure propagates a literal
val on_is_subterm : t -> ev_on_is_subterm -> unit
Called on terms that are subterms of function symbols
val set_as_lit : t -> N.t -> lit -> unit
map the given node to a literal.
val find_t : t -> term -> repr
Current representative of the term.
  • raises Not_found 
    if the term is not already add-ed.
val add_seq : t -> term Iter.t -> unit
Add a sequence of terms to the congruence closure
val all_classes : t -> repr Iter.t
All current classes. This is costly, only use if there is no other solution
val assert_lit : t -> lit -> unit
Given a literal, assume it in the congruence closure and propagate its consequences. Will be backtracked.
Useful for the theory combination or the SAT solver's functor
val assert_lits : t -> lit Iter.t -> unit
Addition of many literals
val explain_eq : t -> N.t -> N.t -> lit list
Explain why the two nodes are equal. Fails if they are not, in an unspecified way
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
Raise a conflict with the given explanation it must be a theory tautology that expl ==> absurd. To be used in theories.
val n_true : t -> N.t
Node for true
val n_false : t -> N.t
Node for false
val n_bool : t -> bool -> N.t
Node for either true or false
val merge : t -> N.t -> N.t -> Expl.t -> unit
Merge these two nodes given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val merge_t : t -> term -> term -> Expl.t -> unit
Shortcut for adding + merging
val check : t -> actions -> unit
Perform all pending operations done via assert_eq, assert_lit, etc. Will use the actions to propagate literals, declare conflicts, etc.
val new_merges : t -> bool
Called after check, returns true if some pairs of classes were merged.
val push_level : t -> unit
Push backtracking level
val pop_levels : t -> int -> unit
Restore to state n calls to push_level earlier. Used during backtracking.
val get_model : t -> N.t Iter.t Iter.t
get all the equivalence classes so they can be merged in the model

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/Lit/index.html b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/Lit/index.html
index 3660c84f..8319e871 100644
--- a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/Lit/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_core.MONOID_ARG.SI.Lit)
Module SI.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
+Lit (sidekick.Sidekick_core.MONOID_ARG.SI.Lit)
Module SI.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/P/Step_vec/index.html b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/P/Step_vec/index.html
index 3f86630b..5841792a 100644
--- a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/P/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_core.MONOID_ARG.SI.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_core.MONOID_ARG.SI.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/P/index.html b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/P/index.html
index af91593d..17c2f93e 100644
--- a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/P/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_core.MONOID_ARG.SI.P)
Module SI.P
Proofs
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = term
type lit = Lit.t
type proof_rule = t -> proof_step
include CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
+P (sidekick.Sidekick_core.MONOID_ARG.SI.P)
Module SI.P
Proofs
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = term
type lit = Lit.t
type proof_rule = t -> proof_step
include CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/Simplify/index.html b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/Simplify/index.html
index 7f955736..4662f35f 100644
--- a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/Simplify/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/Simplify/index.html
@@ -1,2 +1,2 @@
 
-Simplify (sidekick.Sidekick_core.MONOID_ARG.SI.Simplify)
Module SI.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
+Simplify (sidekick.Sidekick_core.MONOID_ARG.SI.Simplify)
Module SI.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/T/Fun/index.html b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/T/Fun/index.html
index 506758a2..7e70e7e7 100644
--- a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_core.MONOID_ARG.SI.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_core.MONOID_ARG.SI.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/T/Term/index.html b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/T/Term/index.html
index 5f0ac9a5..5eda59bc 100644
--- a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/T/Term/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_core.MONOID_ARG.SI.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_core.MONOID_ARG.SI.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/T/Ty/index.html b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/T/Ty/index.html
index a8ea8321..7db58cb8 100644
--- a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_core.MONOID_ARG.SI.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_core.MONOID_ARG.SI.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/T/index.html b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/T/index.html
index b4caeadc..e5082b9c 100644
--- a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/T/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_core.MONOID_ARG.SI.T)
Module SI.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_core.MONOID_ARG.SI.T)
Module SI.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/index.html b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/index.html
index b2bc1480..69cf9cf3 100644
--- a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/index.html
@@ -1,3 +1,3 @@
 
-SI (sidekick.Sidekick_core.MONOID_ARG.SI)
Module MONOID_ARG.SI
module T : TERM
module Lit : LIT with module T = T
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof
type proof_step
module P : PROOF with type lit = Lit.t and type term = term and type t = proof and type proof_step = proof_step
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
+SI (sidekick.Sidekick_core.MONOID_ARG.SI)
Module MONOID_ARG.SI
module T : TERM
module Lit : LIT with module T = T
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof
type proof_step
module P : PROOF with type lit = Lit.t and type term = term and type t = proof and type proof_step = proof_step
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
 P.t = proof and type P.lit = lit and type Actions.t = theory_actions
Congruence closure instance
val cc : t -> CC.t
Congruence closure for this solver
Simplifiers
module Simplify : sig ... end
Simplify terms
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
Add a simplifier hook for preprocessing.
val simplify_t : t -> term -> (term * proof_step) option
Simplify input term, returns Some u if some simplification occurred.
val simp_t : t -> term -> term * proof_step option
simp_t si t returns u even if no simplification occurred (in which case t == u syntactically). It emits |- t=u. (see simplifier)
Preprocessors
These preprocessors turn mixed, raw literals (possibly simplified) into literals suitable for reasoning. Typically some clauses are also added to the solver.
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
Actions available to the preprocessor
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
Given a term, try to preprocess it. Return None if it didn't change, or Some (u) if t=u. Can also add clauses to define new terms.
Preprocessing might transform terms to make them more amenable to reasoning, e.g. by removing boolean formulas via Tseitin encoding, adding clauses that encode their meaning in the same move.
  • parameter preprocess_actions 
    actions available during preprocessing.
val on_preprocess : t -> preprocess_hook -> unit
Add a hook that will be called when terms are preprocessed
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
Obtain preprocessor actions, from theory actions
hooks for the theory
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
Give a conflict clause to the solver
val push_decision : t -> theory_actions -> lit -> unit
Ask the SAT solver to decide the given literal in an extension of the current trail. This is useful for theory combination. If the SAT solver backtracks, this (potential) decision is removed and forgotten.
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
Add local clause to the SAT solver. This clause will be removed when the solver backtracks.
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
Add toplevel clause to the SAT solver. This clause will not be backtracked.
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
Create a literal. This automatically preprocesses the term.
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
Preprocess a term.
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
Add the given literal to the SAT solver, so it gets assigned a boolean value.
  • parameter default_pol 
    default polarity for the corresponding atom
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
Add the given (signed) bool term to the SAT solver, so it gets assigned a boolean value
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
Raise a conflict with the given congruence closure explanation. it must be a theory tautology that expl ==> absurd. To be used in theories.
val cc_find : t -> CC.N.t -> CC.N.t
Find representative of the node
val cc_are_equal : t -> term -> term -> bool
Are these two terms equal in the congruence closure?
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
Merge these two nodes in the congruence closure, given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
Merge these two terms in the congruence closure, given this explanation. See cc_merge
val cc_add_term : t -> term -> CC.N.t
Add/retrieve congruence closure node for this term. To be used in theories
val cc_mem_term : t -> term -> bool
Return true if the term is explicitly in the congruence closure. To be used in theories
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called before)
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called after)
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
Callback to add data on terms when they are added to the congruence closure
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
Callback for when a term is a subterm of another term in the congruence closure
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
Callback called on every CC conflict
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
Callback called on every CC propagation
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callbacked to be called with the slice of literals newly added on the trail.
This is called very often and should be efficient. It doesn't have to be complete, only correct. It's given only the slice of the trail consisting in new literals.
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callback to be called during the final check.
Must be complete (i.e. must raise a conflict if the set of literals is not satisfiable) and can be expensive. The function is given the whole trail.
Model production
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
A model-production hook. It takes the solver, a class, and returns a term for this class. For example, an arithmetic theory might detect that a class contains a numeric constant, and return this constant as a model value.
If no hook assigns a value to a class, a fake value is created for it.
val on_model_gen : t -> model_hook -> unit
Add a hook that will be called when a model is being produced

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/module-type-PREPROCESS_ACTS/index.html b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/module-type-PREPROCESS_ACTS/index.html
index 35f4582a..f7319475 100644
--- a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/module-type-PREPROCESS_ACTS/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/SI/module-type-PREPROCESS_ACTS/index.html
@@ -1,2 +1,2 @@
 
-PREPROCESS_ACTS (sidekick.Sidekick_core.MONOID_ARG.SI.PREPROCESS_ACTS)
Module type SI.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
+PREPROCESS_ACTS (sidekick.Sidekick_core.MONOID_ARG.SI.PREPROCESS_ACTS)
Module type SI.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/index.html b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/index.html
index 00f3dca8..29f11f38 100644
--- a/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-MONOID_ARG/index.html
@@ -1,2 +1,2 @@
 
-MONOID_ARG (sidekick.Sidekick_core.MONOID_ARG)
Module type Sidekick_core.MONOID_ARG
Helper for the congruence closure
This helps theories keeping track of some state for each class. The state of a class is the monoidal combination of the state for each term in the class (for example, the set of terms in the class whose head symbol is a datatype constructor).
type t
Some type with a monoid structure
val pp : t Fmt.printer
val name : string
name of the monoid structure (short)
val of_term : SI.CC.t -> SI.CC.N.t -> SI.T.Term.t -> t option * (SI.CC.N.t * t) list
of_term n t, where t is the term annotating node n, must return maybe_m, l, where:
  • maybe_m = Some m if t has monoid value m; otherwise maybe_m=None
  • l is a list of (u, m_u) where each u's term is a direct subterm of t and m_u is the monoid value attached to u.
val merge : SI.CC.t -> SI.CC.N.t -> t -> SI.CC.N.t -> t -> SI.CC.Expl.t -> (t, SI.CC.Expl.t) Stdlib.result
Monoidal combination of two values.
merge cc n1 mon1 n2 mon2 expl returns the result of merging monoid values mon1 (for class n1) and mon2 (for class n2) when n1 and n2 are merged with explanation expl.
  • returns 
    Ok mon if the merge is acceptable, annotating the class of n1 ∪ n2; or Error expl' if the merge is unsatisfiable. expl' can then be used to trigger a conflict and undo the merge.

\ No newline at end of file
+MONOID_ARG (sidekick.Sidekick_core.MONOID_ARG)
Module type Sidekick_core.MONOID_ARG
Helper for the congruence closure
This helps theories keeping track of some state for each class. The state of a class is the monoidal combination of the state for each term in the class (for example, the set of terms in the class whose head symbol is a datatype constructor).
type t
Some type with a monoid structure
val pp : t Fmt.printer
val name : string
name of the monoid structure (short)
val of_term : SI.CC.t -> SI.CC.N.t -> SI.T.Term.t -> t option * (SI.CC.N.t * t) list
of_term n t, where t is the term annotating node n, must return maybe_m, l, where:
  • maybe_m = Some m if t has monoid value m; otherwise maybe_m=None
  • l is a list of (u, m_u) where each u's term is a direct subterm of t and m_u is the monoid value attached to u.
val merge : SI.CC.t -> SI.CC.N.t -> t -> SI.CC.N.t -> t -> SI.CC.Expl.t -> (t, SI.CC.Expl.t) Stdlib.result
Monoidal combination of two values.
merge cc n1 mon1 n2 mon2 expl returns the result of merging monoid values mon1 (for class n1) and mon2 (for class n2) when n1 and n2 are merged with explanation expl.
  • returns 
    Ok mon if the merge is acceptable, annotating the class of n1 ∪ n2; or Error expl' if the merge is unsatisfiable. expl' can then be used to trigger a conflict and undo the merge.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-PROOF/Step_vec/index.html b/dev/sidekick/Sidekick_core/module-type-PROOF/Step_vec/index.html
index 2a7f1188..342c5f8c 100644
--- a/dev/sidekick/Sidekick_core/module-type-PROOF/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-PROOF/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_core.PROOF.Step_vec)
Module PROOF.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_core.PROOF.Step_vec)
Module PROOF.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-PROOF/index.html b/dev/sidekick/Sidekick_core/module-type-PROOF/index.html
index 73498b38..8052fb01 100644
--- a/dev/sidekick/Sidekick_core/module-type-PROOF/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-PROOF/index.html
@@ -1,2 +1,2 @@
 
-PROOF (sidekick.Sidekick_core.PROOF)
Module type Sidekick_core.PROOF
Proofs of unsatisfiability.
type t
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term
type lit
type proof_rule = t -> proof_step
include CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
+PROOF (sidekick.Sidekick_core.PROOF)
Module type Sidekick_core.PROOF
Proofs of unsatisfiability.
type t
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term
type lit
type proof_rule = t -> proof_step
include CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SAT_PROOF/Step_vec/index.html b/dev/sidekick/Sidekick_core/module-type-SAT_PROOF/Step_vec/index.html
index d495f635..c1fafdcb 100644
--- a/dev/sidekick/Sidekick_core/module-type-SAT_PROOF/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SAT_PROOF/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_core.SAT_PROOF.Step_vec)
Module SAT_PROOF.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_core.SAT_PROOF.Step_vec)
Module SAT_PROOF.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SAT_PROOF/index.html b/dev/sidekick/Sidekick_core/module-type-SAT_PROOF/index.html
index 1ec4b26c..aa6f2cee 100644
--- a/dev/sidekick/Sidekick_core/module-type-SAT_PROOF/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SAT_PROOF/index.html
@@ -1,2 +1,2 @@
 
-SAT_PROOF (sidekick.Sidekick_core.SAT_PROOF)
Module type Sidekick_core.SAT_PROOF
Signature for SAT-solver proof emission.
type t
The stored proof (possibly nil, possibly on disk, possibly in memory)
type proof_step
identifier for a proof
A vector of steps
type lit
A boolean literal for the proof trace
type proof_rule = t -> proof_step
A proof proof_rule constructor, used to obtain proofs from theories
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.

\ No newline at end of file
+SAT_PROOF (sidekick.Sidekick_core.SAT_PROOF)
Module type Sidekick_core.SAT_PROOF
Signature for SAT-solver proof emission.
type t
The stored proof (possibly nil, possibly on disk, possibly in memory)
type proof_step
identifier for a proof
A vector of steps
type lit
A boolean literal for the proof trace
type proof_rule = t -> proof_step
A proof proof_rule constructor, used to obtain proofs from theories
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER/Lit/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER/Lit/index.html
index b97493cf..5eb5817f 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER/Lit/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_core.SOLVER.Lit)
Module SOLVER.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
+Lit (sidekick.Sidekick_core.SOLVER.Lit)
Module SOLVER.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER/Model/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER/Model/index.html
index 253d9c8b..1238dfbd 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER/Model/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER/Model/index.html
@@ -1,2 +1,2 @@
 
-Model (sidekick.Sidekick_core.SOLVER.Model)
Module SOLVER.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Fmt.printer

\ No newline at end of file
+Model (sidekick.Sidekick_core.SOLVER.Model)
Module SOLVER.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER/P/Step_vec/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER/P/Step_vec/index.html
index 67e99026..0f9223b6 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER/P/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_core.SOLVER.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_core.SOLVER.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER/P/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER/P/index.html
index 12e7b606..a8ccc0c1 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER/P/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_core.SOLVER.P)
Module SOLVER.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
+P (sidekick.Sidekick_core.SOLVER.P)
Module SOLVER.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/Actions/P/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/Actions/P/index.html
index 297b1526..49fa7589 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/Actions/P/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_core.SOLVER.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_core.SOLVER.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/Actions/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/Actions/index.html
index 8251d4d4..db274fd7 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/Actions/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick.Sidekick_core.SOLVER.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
+Actions (sidekick.Sidekick_core.SOLVER.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/Expl/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/Expl/index.html
index 5724d3c3..a6c3dff7 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/Expl/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick.Sidekick_core.SOLVER.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick.Sidekick_core.SOLVER.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/N/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/N/index.html
index 85f3eccf..fca4d725 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/N/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick.Sidekick_core.SOLVER.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
+N (sidekick.Sidekick_core.SOLVER.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/P/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/P/index.html
index 20f950b3..7f67a0d6 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/P/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_core.SOLVER.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_core.SOLVER.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/index.html
index a9ba3ded..b0b8b367 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/CC/index.html
@@ -1,4 +1,4 @@
 
-CC (sidekick.Sidekick_core.SOLVER.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+CC (sidekick.Sidekick_core.SOLVER.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Small | `Big ] -> term_store -> proof -> t
Create a new congruence closure.
  • parameter term_store 
    used to be able to create new terms. All terms interacting with this congruence closure must belong in this term state as well.
val allocate_bitfield : descr:string -> t -> N.bitfield
Allocate a new node field (see N.bitfield).
This field descriptor is henceforth reserved for all nodes in this congruence closure, and can be set using set_bitfield for each node individually. This can be used to efficiently store some metadata on nodes (e.g. "is there a numeric value in the class" or "is there a constructor term in the class").
There may be restrictions on how many distinct fields are allocated for a given congruence closure (e.g. at most Sys.int_size fields).
val get_bitfield : t -> N.bitfield -> N.t -> bool
Access the bit field of the given node
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
Set the bitfield for the node. This will be backtracked. See N.bitfield.
val on_pre_merge : t -> ev_on_pre_merge -> unit
Add a function to be called when two classes are merged
val on_post_merge : t -> ev_on_post_merge -> unit
Add a function to be called when two classes are merged
val on_new_term : t -> ev_on_new_term -> unit
Add a function to be called when a new node is created
val on_conflict : t -> ev_on_conflict -> unit
Called when the congruence closure finds a conflict
val on_propagate : t -> ev_on_propagate -> unit
Called when the congruence closure propagates a literal
val on_is_subterm : t -> ev_on_is_subterm -> unit
Called on terms that are subterms of function symbols
val set_as_lit : t -> N.t -> lit -> unit
map the given node to a literal.
val find_t : t -> term -> repr
Current representative of the term.
  • raises Not_found 
    if the term is not already add-ed.
val add_seq : t -> term Iter.t -> unit
Add a sequence of terms to the congruence closure
val all_classes : t -> repr Iter.t
All current classes. This is costly, only use if there is no other solution
val assert_lit : t -> lit -> unit
Given a literal, assume it in the congruence closure and propagate its consequences. Will be backtracked.
Useful for the theory combination or the SAT solver's functor
val assert_lits : t -> lit Iter.t -> unit
Addition of many literals
val explain_eq : t -> N.t -> N.t -> lit list
Explain why the two nodes are equal. Fails if they are not, in an unspecified way
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
Raise a conflict with the given explanation it must be a theory tautology that expl ==> absurd. To be used in theories.
val n_true : t -> N.t
Node for true
val n_false : t -> N.t
Node for false
val n_bool : t -> bool -> N.t
Node for either true or false
val merge : t -> N.t -> N.t -> Expl.t -> unit
Merge these two nodes given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val merge_t : t -> term -> term -> Expl.t -> unit
Shortcut for adding + merging
val check : t -> actions -> unit
Perform all pending operations done via assert_eq, assert_lit, etc. Will use the actions to propagate literals, declare conflicts, etc.
val new_merges : t -> bool
Called after check, returns true if some pairs of classes were merged.
val push_level : t -> unit
Push backtracking level
val pop_levels : t -> int -> unit
Restore to state n calls to push_level earlier. Used during backtracking.
val get_model : t -> N.t Iter.t Iter.t
get all the equivalence classes so they can be merged in the model

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/Simplify/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/Simplify/index.html
index 53ffc6c0..9f2d507e 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/Simplify/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/Simplify/index.html
@@ -1,2 +1,2 @@
 
-Simplify (sidekick.Sidekick_core.SOLVER.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
+Simplify (sidekick.Sidekick_core.SOLVER.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/index.html
index b75a4608..e37c806f 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/index.html
@@ -1,3 +1,3 @@
 
-Solver_internal (sidekick.Sidekick_core.SOLVER.Solver_internal)
Module SOLVER.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
+Solver_internal (sidekick.Sidekick_core.SOLVER.Solver_internal)
Module SOLVER.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
 P.t = proof and type P.lit = lit and type Actions.t = theory_actions
Congruence closure instance
val cc : t -> CC.t
Congruence closure for this solver
Simplifiers
module Simplify : sig ... end
Simplify terms
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
Add a simplifier hook for preprocessing.
val simplify_t : t -> term -> (term * proof_step) option
Simplify input term, returns Some u if some simplification occurred.
val simp_t : t -> term -> term * proof_step option
simp_t si t returns u even if no simplification occurred (in which case t == u syntactically). It emits |- t=u. (see simplifier)
Preprocessors
These preprocessors turn mixed, raw literals (possibly simplified) into literals suitable for reasoning. Typically some clauses are also added to the solver.
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
Actions available to the preprocessor
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
Given a term, try to preprocess it. Return None if it didn't change, or Some (u) if t=u. Can also add clauses to define new terms.
Preprocessing might transform terms to make them more amenable to reasoning, e.g. by removing boolean formulas via Tseitin encoding, adding clauses that encode their meaning in the same move.
  • parameter preprocess_actions 
    actions available during preprocessing.
val on_preprocess : t -> preprocess_hook -> unit
Add a hook that will be called when terms are preprocessed
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
Obtain preprocessor actions, from theory actions
hooks for the theory
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
Give a conflict clause to the solver
val push_decision : t -> theory_actions -> lit -> unit
Ask the SAT solver to decide the given literal in an extension of the current trail. This is useful for theory combination. If the SAT solver backtracks, this (potential) decision is removed and forgotten.
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
Add local clause to the SAT solver. This clause will be removed when the solver backtracks.
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
Add toplevel clause to the SAT solver. This clause will not be backtracked.
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
Create a literal. This automatically preprocesses the term.
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
Preprocess a term.
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
Add the given literal to the SAT solver, so it gets assigned a boolean value.
  • parameter default_pol 
    default polarity for the corresponding atom
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
Add the given (signed) bool term to the SAT solver, so it gets assigned a boolean value
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
Raise a conflict with the given congruence closure explanation. it must be a theory tautology that expl ==> absurd. To be used in theories.
val cc_find : t -> CC.N.t -> CC.N.t
Find representative of the node
val cc_are_equal : t -> term -> term -> bool
Are these two terms equal in the congruence closure?
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
Merge these two nodes in the congruence closure, given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
Merge these two terms in the congruence closure, given this explanation. See cc_merge
val cc_add_term : t -> term -> CC.N.t
Add/retrieve congruence closure node for this term. To be used in theories
val cc_mem_term : t -> term -> bool
Return true if the term is explicitly in the congruence closure. To be used in theories
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called before)
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called after)
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
Callback to add data on terms when they are added to the congruence closure
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
Callback for when a term is a subterm of another term in the congruence closure
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
Callback called on every CC conflict
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
Callback called on every CC propagation
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callbacked to be called with the slice of literals newly added on the trail.
This is called very often and should be efficient. It doesn't have to be complete, only correct. It's given only the slice of the trail consisting in new literals.
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callback to be called during the final check.
Must be complete (i.e. must raise a conflict if the set of literals is not satisfiable) and can be expensive. The function is given the whole trail.
Model production
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
A model-production hook. It takes the solver, a class, and returns a term for this class. For example, an arithmetic theory might detect that a class contains a numeric constant, and return this constant as a model value.
If no hook assigns a value to a class, a fake value is created for it.
val on_model_gen : t -> model_hook -> unit
Add a hook that will be called when a model is being produced

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/module-type-PREPROCESS_ACTS/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/module-type-PREPROCESS_ACTS/index.html
index 3f12ab6a..edec460f 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/module-type-PREPROCESS_ACTS/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER/Solver_internal/module-type-PREPROCESS_ACTS/index.html
@@ -1,2 +1,2 @@
 
-PREPROCESS_ACTS (sidekick.Sidekick_core.SOLVER.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
+PREPROCESS_ACTS (sidekick.Sidekick_core.SOLVER.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER/T/Fun/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER/T/Fun/index.html
index 07c0ee17..5025f74c 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_core.SOLVER.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_core.SOLVER.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER/T/Term/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER/T/Term/index.html
index f73271f2..ad6e97e9 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER/T/Term/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_core.SOLVER.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_core.SOLVER.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER/T/Ty/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER/T/Ty/index.html
index bf76e120..e20264b6 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_core.SOLVER.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_core.SOLVER.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER/T/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER/T/index.html
index fd43d0ba..ecc99e8d 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER/T/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_core.SOLVER.T)
Module SOLVER.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_core.SOLVER.T)
Module SOLVER.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER/Unknown/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER/Unknown/index.html
index 02f7a244..c7eced4b 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER/Unknown/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER/Unknown/index.html
@@ -1,2 +1,2 @@
 
-Unknown (sidekick.Sidekick_core.SOLVER.Unknown)
Module SOLVER.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
+Unknown (sidekick.Sidekick_core.SOLVER.Unknown)
Module SOLVER.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER/index.html
index d1aae9bf..3606146a 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER/index.html
@@ -1,5 +1,5 @@
 
-SOLVER (sidekick.Sidekick_core.SOLVER)
Module type Sidekick_core.SOLVER
User facing view of the solver
This is the solver a user of sidekick can see, after instantiating everything. The user can add some theories, clauses, etc. and asks the solver to check satisfiability.
Theory implementors will mostly interact with SOLVER_INTERNAL.
module T : TERM
module Lit : LIT with module T = T
type proof
type proof_step
module P : PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
+SOLVER (sidekick.Sidekick_core.SOLVER)
Module type Sidekick_core.SOLVER
User facing view of the solver
This is the solver a user of sidekick can see, after instantiating everything. The user can add some theories, clauses, etc. and asks the solver to check satisfiability.
Theory implementors will mostly interact with SOLVER_INTERNAL.
module T : TERM
module Lit : LIT with module T = T
type proof
type proof_step
module P : PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
 ?push_level:('th -> unit) -> ?pop_levels:('th -> int -> unit) -> unit -> theory
Helper to create a theory.
module Model : sig ... end
Models
module Unknown : sig ... end
Main API
val stats : t -> Sidekick_util.Stat.t
val tst : t -> T.Term.store
val ty_st : t -> T.Ty.store
val proof : t -> proof
val create : ?stat:Sidekick_util.Stat.t -> ?size:[ `Big | `Tiny | `Small ] -> proof:proof -> theories:theory list ->
 T.Term.store -> T.Ty.store -> unit -> t
Create a new solver.
It needs a term state and a type state to manipulate terms and types. All terms and types interacting with this solver will need to come from these exact states.
  • parameter store_proof 
    if true, proofs from the SAT solver and theories are retained and potentially accessible after solve returns UNSAT.
  • parameter size 
    influences the size of initial allocations.
  • parameter theories 
    theories to load from the start. Other theories can be added using add_theory.
val add_theory : t -> theory -> unit
Add a theory to the solver. This should be called before any call to solve or to add_clause and the likes (otherwise the theory will have a partial view of the problem).
val add_theory_p : t -> 'a theory_p -> 'a
Add the given theory and obtain its state
val add_theory_l : t -> theory list -> unit
val mk_lit_t : t -> ?sign:bool -> term -> lit
mk_lit_t _ ~sign t returns lit', where lit' is preprocess(lit) and lit is an internal representation of ± t.
The proof of |- lit = lit' is directly added to the solver's proof.
val add_clause : t -> lit Sidekick_util.IArray.t -> proof_step -> unit
add_clause solver cs adds a boolean clause to the solver. Subsequent calls to solve will need to satisfy this clause.
val add_clause_l : t -> lit list -> proof_step -> unit
Add a clause to the solver, given as a list.
val assert_terms : t -> term list -> unit
Helper that turns each term into an atom, before adding the result to the solver as an assertion
val assert_term : t -> term -> unit
Helper that turns the term into an atom, before adding the result to the solver as a unit clause assertion
type res = 
| Sat of Model.t(*
Satisfiable
*)
| Unsat of {
unsat_core : unit -> lit Iter.t;(*
Unsat core (subset of assumptions), or empty
*)
unsat_proof_step : unit -> proof_step option;(*
Proof step for the empty clause
*)
}		(*
Unsatisfiable
*)
| Unknown of Unknown.t(*
Unknown, obtained after a timeout, memory limit, etc.
*)
Result of solving for the current set of clauses
val solve : ?on_exit:(unit -> unit) list -> ?check:bool -> ?on_progress:(t -> unit) ->
 assumptions:lit list -> t -> res
solve s checks the satisfiability of the clauses added so far to s.
  • parameter check 
    if true, the model is checked before returning.
  • parameter on_progress 
    called regularly during solving.
  • parameter assumptions 
    a set of atoms held to be true. The unsat core, if any, will be a subset of assumptions.
  • parameter on_exit 
    functions to be run before this returns
val pp_stats : t CCFormat.printer
Print some statistics. What it prints exactly is unspecified.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER/module-type-THEORY/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER/module-type-THEORY/index.html
index 569c5ed7..cb16590c 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER/module-type-THEORY/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER/module-type-THEORY/index.html
@@ -1,2 +1,2 @@
 
-THEORY (sidekick.Sidekick_core.SOLVER.THEORY)
Module type SOLVER.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
+THEORY (sidekick.Sidekick_core.SOLVER.THEORY)
Module type SOLVER.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/Actions/P/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/Actions/P/index.html
index 60cb7714..b6156891 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/Actions/P/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_core.SOLVER_INTERNAL.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_core.SOLVER_INTERNAL.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/Actions/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/Actions/index.html
index 8502c361..5ca996d0 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/Actions/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick.Sidekick_core.SOLVER_INTERNAL.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
+Actions (sidekick.Sidekick_core.SOLVER_INTERNAL.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/Expl/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/Expl/index.html
index 0f64f4f6..d1aeb515 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/Expl/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick.Sidekick_core.SOLVER_INTERNAL.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick.Sidekick_core.SOLVER_INTERNAL.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/N/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/N/index.html
index b608bf9c..3dd451a1 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/N/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick.Sidekick_core.SOLVER_INTERNAL.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
+N (sidekick.Sidekick_core.SOLVER_INTERNAL.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/P/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/P/index.html
index d0fdb219..8adeaab1 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/P/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_core.SOLVER_INTERNAL.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_core.SOLVER_INTERNAL.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/index.html
index 7b003919..806738e6 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/CC/index.html
@@ -1,4 +1,4 @@
 
-CC (sidekick.Sidekick_core.SOLVER_INTERNAL.CC)
Module SOLVER_INTERNAL.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+CC (sidekick.Sidekick_core.SOLVER_INTERNAL.CC)
Module SOLVER_INTERNAL.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Small | `Big ] -> term_store -> proof -> t
Create a new congruence closure.
  • parameter term_store 
    used to be able to create new terms. All terms interacting with this congruence closure must belong in this term state as well.
val allocate_bitfield : descr:string -> t -> N.bitfield
Allocate a new node field (see N.bitfield).
This field descriptor is henceforth reserved for all nodes in this congruence closure, and can be set using set_bitfield for each node individually. This can be used to efficiently store some metadata on nodes (e.g. "is there a numeric value in the class" or "is there a constructor term in the class").
There may be restrictions on how many distinct fields are allocated for a given congruence closure (e.g. at most Sys.int_size fields).
val get_bitfield : t -> N.bitfield -> N.t -> bool
Access the bit field of the given node
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
Set the bitfield for the node. This will be backtracked. See N.bitfield.
val on_pre_merge : t -> ev_on_pre_merge -> unit
Add a function to be called when two classes are merged
val on_post_merge : t -> ev_on_post_merge -> unit
Add a function to be called when two classes are merged
val on_new_term : t -> ev_on_new_term -> unit
Add a function to be called when a new node is created
val on_conflict : t -> ev_on_conflict -> unit
Called when the congruence closure finds a conflict
val on_propagate : t -> ev_on_propagate -> unit
Called when the congruence closure propagates a literal
val on_is_subterm : t -> ev_on_is_subterm -> unit
Called on terms that are subterms of function symbols
val set_as_lit : t -> N.t -> lit -> unit
map the given node to a literal.
val find_t : t -> term -> repr
Current representative of the term.
  • raises Not_found 
    if the term is not already add-ed.
val add_seq : t -> term Iter.t -> unit
Add a sequence of terms to the congruence closure
val all_classes : t -> repr Iter.t
All current classes. This is costly, only use if there is no other solution
val assert_lit : t -> lit -> unit
Given a literal, assume it in the congruence closure and propagate its consequences. Will be backtracked.
Useful for the theory combination or the SAT solver's functor
val assert_lits : t -> lit Iter.t -> unit
Addition of many literals
val explain_eq : t -> N.t -> N.t -> lit list
Explain why the two nodes are equal. Fails if they are not, in an unspecified way
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
Raise a conflict with the given explanation it must be a theory tautology that expl ==> absurd. To be used in theories.
val n_true : t -> N.t
Node for true
val n_false : t -> N.t
Node for false
val n_bool : t -> bool -> N.t
Node for either true or false
val merge : t -> N.t -> N.t -> Expl.t -> unit
Merge these two nodes given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val merge_t : t -> term -> term -> Expl.t -> unit
Shortcut for adding + merging
val check : t -> actions -> unit
Perform all pending operations done via assert_eq, assert_lit, etc. Will use the actions to propagate literals, declare conflicts, etc.
val new_merges : t -> bool
Called after check, returns true if some pairs of classes were merged.
val push_level : t -> unit
Push backtracking level
val pop_levels : t -> int -> unit
Restore to state n calls to push_level earlier. Used during backtracking.
val get_model : t -> N.t Iter.t Iter.t
get all the equivalence classes so they can be merged in the model

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/Lit/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/Lit/index.html
index 9c68205a..e00bb9b9 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/Lit/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_core.SOLVER_INTERNAL.Lit)
Module SOLVER_INTERNAL.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
+Lit (sidekick.Sidekick_core.SOLVER_INTERNAL.Lit)
Module SOLVER_INTERNAL.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/P/Step_vec/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/P/Step_vec/index.html
index f0983ea5..69471338 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/P/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_core.SOLVER_INTERNAL.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_core.SOLVER_INTERNAL.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/P/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/P/index.html
index feb9c56f..7bd098ce 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/P/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_core.SOLVER_INTERNAL.P)
Module SOLVER_INTERNAL.P
Proofs
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = term
type lit = Lit.t
type proof_rule = t -> proof_step
include CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
+P (sidekick.Sidekick_core.SOLVER_INTERNAL.P)
Module SOLVER_INTERNAL.P
Proofs
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = term
type lit = Lit.t
type proof_rule = t -> proof_step
include CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/Simplify/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/Simplify/index.html
index 3d2f7186..b26b0bd3 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/Simplify/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/Simplify/index.html
@@ -1,2 +1,2 @@
 
-Simplify (sidekick.Sidekick_core.SOLVER_INTERNAL.Simplify)
Module SOLVER_INTERNAL.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
+Simplify (sidekick.Sidekick_core.SOLVER_INTERNAL.Simplify)
Module SOLVER_INTERNAL.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/T/Fun/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/T/Fun/index.html
index aaea97c9..47b828da 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_core.SOLVER_INTERNAL.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_core.SOLVER_INTERNAL.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/T/Term/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/T/Term/index.html
index 08ef7f2e..78e0f554 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/T/Term/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_core.SOLVER_INTERNAL.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_core.SOLVER_INTERNAL.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/T/Ty/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/T/Ty/index.html
index 94cad8ae..b3f77124 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_core.SOLVER_INTERNAL.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_core.SOLVER_INTERNAL.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/T/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/T/index.html
index a3a7694f..a4073a44 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/T/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_core.SOLVER_INTERNAL.T)
Module SOLVER_INTERNAL.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_core.SOLVER_INTERNAL.T)
Module SOLVER_INTERNAL.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/index.html
index 7c08aa39..47432ea5 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/index.html
@@ -1,3 +1,3 @@
 
-SOLVER_INTERNAL (sidekick.Sidekick_core.SOLVER_INTERNAL)
Module type Sidekick_core.SOLVER_INTERNAL
A view of the solver from a theory's point of view.
Theories should interact with the solver via this module, to assert new lemmas, propagate literals, access the congruence closure, etc.
module T : TERM
module Lit : LIT with module T = T
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof
type proof_step
module P : PROOF with type lit = Lit.t and type term = term and type t = proof and type proof_step = proof_step
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
+SOLVER_INTERNAL (sidekick.Sidekick_core.SOLVER_INTERNAL)
Module type Sidekick_core.SOLVER_INTERNAL
A view of the solver from a theory's point of view.
Theories should interact with the solver via this module, to assert new lemmas, propagate literals, access the congruence closure, etc.
module T : TERM
module Lit : LIT with module T = T
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof
type proof_step
module P : PROOF with type lit = Lit.t and type term = term and type t = proof and type proof_step = proof_step
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
 P.t = proof and type P.lit = lit and type Actions.t = theory_actions
Congruence closure instance
val cc : t -> CC.t
Congruence closure for this solver
Simplifiers
module Simplify : sig ... end
Simplify terms
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
Add a simplifier hook for preprocessing.
val simplify_t : t -> term -> (term * proof_step) option
Simplify input term, returns Some u if some simplification occurred.
val simp_t : t -> term -> term * proof_step option
simp_t si t returns u even if no simplification occurred (in which case t == u syntactically). It emits |- t=u. (see simplifier)
Preprocessors
These preprocessors turn mixed, raw literals (possibly simplified) into literals suitable for reasoning. Typically some clauses are also added to the solver.
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
Actions available to the preprocessor
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
Given a term, try to preprocess it. Return None if it didn't change, or Some (u) if t=u. Can also add clauses to define new terms.
Preprocessing might transform terms to make them more amenable to reasoning, e.g. by removing boolean formulas via Tseitin encoding, adding clauses that encode their meaning in the same move.
  • parameter preprocess_actions 
    actions available during preprocessing.
val on_preprocess : t -> preprocess_hook -> unit
Add a hook that will be called when terms are preprocessed
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
Obtain preprocessor actions, from theory actions
hooks for the theory
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
Give a conflict clause to the solver
val push_decision : t -> theory_actions -> lit -> unit
Ask the SAT solver to decide the given literal in an extension of the current trail. This is useful for theory combination. If the SAT solver backtracks, this (potential) decision is removed and forgotten.
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
Add local clause to the SAT solver. This clause will be removed when the solver backtracks.
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
Add toplevel clause to the SAT solver. This clause will not be backtracked.
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
Create a literal. This automatically preprocesses the term.
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
Preprocess a term.
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
Add the given literal to the SAT solver, so it gets assigned a boolean value.
  • parameter default_pol 
    default polarity for the corresponding atom
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
Add the given (signed) bool term to the SAT solver, so it gets assigned a boolean value
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
Raise a conflict with the given congruence closure explanation. it must be a theory tautology that expl ==> absurd. To be used in theories.
val cc_find : t -> CC.N.t -> CC.N.t
Find representative of the node
val cc_are_equal : t -> term -> term -> bool
Are these two terms equal in the congruence closure?
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
Merge these two nodes in the congruence closure, given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
Merge these two terms in the congruence closure, given this explanation. See cc_merge
val cc_add_term : t -> term -> CC.N.t
Add/retrieve congruence closure node for this term. To be used in theories
val cc_mem_term : t -> term -> bool
Return true if the term is explicitly in the congruence closure. To be used in theories
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called before)
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called after)
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
Callback to add data on terms when they are added to the congruence closure
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
Callback for when a term is a subterm of another term in the congruence closure
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
Callback called on every CC conflict
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
Callback called on every CC propagation
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callbacked to be called with the slice of literals newly added on the trail.
This is called very often and should be efficient. It doesn't have to be complete, only correct. It's given only the slice of the trail consisting in new literals.
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callback to be called during the final check.
Must be complete (i.e. must raise a conflict if the set of literals is not satisfiable) and can be expensive. The function is given the whole trail.
Model production
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
A model-production hook. It takes the solver, a class, and returns a term for this class. For example, an arithmetic theory might detect that a class contains a numeric constant, and return this constant as a model value.
If no hook assigns a value to a class, a fake value is created for it.
val on_model_gen : t -> model_hook -> unit
Add a hook that will be called when a model is being produced

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/module-type-PREPROCESS_ACTS/index.html b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/module-type-PREPROCESS_ACTS/index.html
index 96a62bc1..a94989ce 100644
--- a/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/module-type-PREPROCESS_ACTS/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-SOLVER_INTERNAL/module-type-PREPROCESS_ACTS/index.html
@@ -1,2 +1,2 @@
 
-PREPROCESS_ACTS (sidekick.Sidekick_core.SOLVER_INTERNAL.PREPROCESS_ACTS)
Module type SOLVER_INTERNAL.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
+PREPROCESS_ACTS (sidekick.Sidekick_core.SOLVER_INTERNAL.PREPROCESS_ACTS)
Module type SOLVER_INTERNAL.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-TERM/Fun/index.html b/dev/sidekick/Sidekick_core/module-type-TERM/Fun/index.html
index cb213b0b..bf61e5d0 100644
--- a/dev/sidekick/Sidekick_core/module-type-TERM/Fun/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-TERM/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_core.TERM.Fun)
Module TERM.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_core.TERM.Fun)
Module TERM.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-TERM/Term/index.html b/dev/sidekick/Sidekick_core/module-type-TERM/Term/index.html
index e9e1bb41..8ddc8dbf 100644
--- a/dev/sidekick/Sidekick_core/module-type-TERM/Term/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-TERM/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_core.TERM.Term)
Module TERM.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_core.TERM.Term)
Module TERM.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_core/module-type-TERM/Ty/index.html b/dev/sidekick/Sidekick_core/module-type-TERM/Ty/index.html
index d5b947f9..7b521e7a 100644
--- a/dev/sidekick/Sidekick_core/module-type-TERM/Ty/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-TERM/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_core.TERM.Ty)
Module TERM.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_core.TERM.Ty)
Module TERM.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_core/module-type-TERM/index.html b/dev/sidekick/Sidekick_core/module-type-TERM/index.html
index 0e5b405b..b329caf5 100644
--- a/dev/sidekick/Sidekick_core/module-type-TERM/index.html
+++ b/dev/sidekick/Sidekick_core/module-type-TERM/index.html
@@ -1,2 +1,2 @@
 
-TERM (sidekick.Sidekick_core.TERM)
Module type Sidekick_core.TERM
Main representation of Terms and Types
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+TERM (sidekick.Sidekick_core.TERM)
Module type Sidekick_core.TERM
Main representation of Terms and Types
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_drup/Make/Atom/index.html b/dev/sidekick/Sidekick_drup/Make/Atom/index.html
index b5eb9c54..879d4612 100644
--- a/dev/sidekick/Sidekick_drup/Make/Atom/index.html
+++ b/dev/sidekick/Sidekick_drup/Make/Atom/index.html
@@ -1,2 +1,2 @@
 
-Atom (sidekick.Sidekick_drup.Make.Atom)
Module Make.Atom
type t = private int
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val neg : t -> t
val sign : t -> bool
val pp : t Fmt.printer
type atom = t
val of_int_dimacs : int -> t
Turn a signed integer into an atom. Positive integers are positive atoms, and -i is neg (of_int i).
  • raises Invalid_argument 
    if the argument is 0

\ No newline at end of file
+Atom (sidekick.Sidekick_drup.Make.Atom)
Module Make.Atom
type t = private int
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val neg : t -> t
val sign : t -> bool
val pp : t Fmt.printer
type atom = t
val of_int_dimacs : int -> t
Turn a signed integer into an atom. Positive integers are positive atoms, and -i is neg (of_int i).
  • raises Invalid_argument 
    if the argument is 0

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_drup/Make/Checker/index.html b/dev/sidekick/Sidekick_drup/Make/Checker/index.html
index 5021f394..7a07d444 100644
--- a/dev/sidekick/Sidekick_drup/Make/Checker/index.html
+++ b/dev/sidekick/Sidekick_drup/Make/Checker/index.html
@@ -1,2 +1,2 @@
 
-Checker (sidekick.Sidekick_drup.Make.Checker)
Module Make.Checker
type t
val create : Clause.store -> t
val add_clause : t -> Clause.t -> unit
val is_valid_drup : t -> Clause.t -> bool
val del_clause : t -> Clause.t -> unit

\ No newline at end of file
+Checker (sidekick.Sidekick_drup.Make.Checker)
Module Make.Checker
type t
val create : Clause.store -> t
val add_clause : t -> Clause.t -> unit
val is_valid_drup : t -> Clause.t -> bool
val del_clause : t -> Clause.t -> unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_drup/Make/Clause/index.html b/dev/sidekick/Sidekick_drup/Make/Clause/index.html
index 18c79bbd..ef706655 100644
--- a/dev/sidekick/Sidekick_drup/Make/Clause/index.html
+++ b/dev/sidekick/Sidekick_drup/Make/Clause/index.html
@@ -1,2 +1,2 @@
 
-Clause (sidekick.Sidekick_drup.Make.Clause)
Module Make.Clause
type store
val create : unit -> store
type t
val size : t -> int
val get : t -> int -> atom
val iter : f:(atom -> unit) -> t -> unit
val pp : t Fmt.printer
val of_list : store -> atom list -> t
val of_iter : store -> atom Iter.t -> t

\ No newline at end of file
+Clause (sidekick.Sidekick_drup.Make.Clause)
Module Make.Clause
type store
val create : unit -> store
type t
val size : t -> int
val get : t -> int -> atom
val iter : f:(atom -> unit) -> t -> unit
val pp : t Fmt.printer
val of_list : store -> atom list -> t
val of_iter : store -> atom Iter.t -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_drup/Make/index.html b/dev/sidekick/Sidekick_drup/Make/index.html
index 8ed0a1a3..461b9b55 100644
--- a/dev/sidekick/Sidekick_drup/Make/index.html
+++ b/dev/sidekick/Sidekick_drup/Make/index.html
@@ -1,2 +1,2 @@
 
-Make (sidekick.Sidekick_drup.Make)
Module Sidekick_drup.Make
Parameters
Signature
module Atom : sig ... end
type atom = Atom.t
module Clause : sig ... end
type clause = Clause.t
module Checker : sig ... end

\ No newline at end of file
+Make (sidekick.Sidekick_drup.Make)
Module Sidekick_drup.Make
Parameters
Signature
module Atom : sig ... end
type atom = Atom.t
module Clause : sig ... end
type clause = Clause.t
module Checker : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_drup/index.html b/dev/sidekick/Sidekick_drup/index.html
index 42a12b7b..e6f368ef 100644
--- a/dev/sidekick/Sidekick_drup/index.html
+++ b/dev/sidekick/Sidekick_drup/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_drup (sidekick.Sidekick_drup)
Module Sidekick_drup
DRUP trace checker.
This module provides a checker for DRUP traces, including proof_rule-by-proof_rule checking for traces that interleave DRUP steps with other kinds of steps.
module Fmt = CCFormat
module VecSmallInt = Sidekick_util.VecSmallInt
module type S = sig ... end
An instance of the checker
module Make () : S

\ No newline at end of file
+Sidekick_drup (sidekick.Sidekick_drup)
Module Sidekick_drup
DRUP trace checker.
This module provides a checker for DRUP traces, including proof_rule-by-proof_rule checking for traces that interleave DRUP steps with other kinds of steps.
module Fmt = CCFormat
module VecSmallInt = Sidekick_util.VecSmallInt
module type S = sig ... end
An instance of the checker
module Make () : S

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_drup/module-type-S/Atom/index.html b/dev/sidekick/Sidekick_drup/module-type-S/Atom/index.html
index 4ec5e9cb..c5bd50f1 100644
--- a/dev/sidekick/Sidekick_drup/module-type-S/Atom/index.html
+++ b/dev/sidekick/Sidekick_drup/module-type-S/Atom/index.html
@@ -1,2 +1,2 @@
 
-Atom (sidekick.Sidekick_drup.S.Atom)
Module S.Atom
type t = private int
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val neg : t -> t
val sign : t -> bool
val pp : t Fmt.printer
type atom = t
val of_int_dimacs : int -> t
Turn a signed integer into an atom. Positive integers are positive atoms, and -i is neg (of_int i).
  • raises Invalid_argument 
    if the argument is 0

\ No newline at end of file
+Atom (sidekick.Sidekick_drup.S.Atom)
Module S.Atom
type t = private int
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val neg : t -> t
val sign : t -> bool
val pp : t Fmt.printer
type atom = t
val of_int_dimacs : int -> t
Turn a signed integer into an atom. Positive integers are positive atoms, and -i is neg (of_int i).
  • raises Invalid_argument 
    if the argument is 0

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_drup/module-type-S/Checker/index.html b/dev/sidekick/Sidekick_drup/module-type-S/Checker/index.html
index 07d118ef..a8423503 100644
--- a/dev/sidekick/Sidekick_drup/module-type-S/Checker/index.html
+++ b/dev/sidekick/Sidekick_drup/module-type-S/Checker/index.html
@@ -1,2 +1,2 @@
 
-Checker (sidekick.Sidekick_drup.S.Checker)
Module S.Checker
type t
val create : Clause.store -> t
val add_clause : t -> Clause.t -> unit
val is_valid_drup : t -> Clause.t -> bool
val del_clause : t -> Clause.t -> unit

\ No newline at end of file
+Checker (sidekick.Sidekick_drup.S.Checker)
Module S.Checker
type t
val create : Clause.store -> t
val add_clause : t -> Clause.t -> unit
val is_valid_drup : t -> Clause.t -> bool
val del_clause : t -> Clause.t -> unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_drup/module-type-S/Clause/index.html b/dev/sidekick/Sidekick_drup/module-type-S/Clause/index.html
index ad9d5c54..8cf53bc8 100644
--- a/dev/sidekick/Sidekick_drup/module-type-S/Clause/index.html
+++ b/dev/sidekick/Sidekick_drup/module-type-S/Clause/index.html
@@ -1,2 +1,2 @@
 
-Clause (sidekick.Sidekick_drup.S.Clause)
Module S.Clause
type store
val create : unit -> store
type t
val size : t -> int
val get : t -> int -> atom
val iter : f:(atom -> unit) -> t -> unit
val pp : t Fmt.printer
val of_list : store -> atom list -> t
val of_iter : store -> atom Iter.t -> t

\ No newline at end of file
+Clause (sidekick.Sidekick_drup.S.Clause)
Module S.Clause
type store
val create : unit -> store
type t
val size : t -> int
val get : t -> int -> atom
val iter : f:(atom -> unit) -> t -> unit
val pp : t Fmt.printer
val of_list : store -> atom list -> t
val of_iter : store -> atom Iter.t -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_drup/module-type-S/index.html b/dev/sidekick/Sidekick_drup/module-type-S/index.html
index ec6ffd31..fb2e4485 100644
--- a/dev/sidekick/Sidekick_drup/module-type-S/index.html
+++ b/dev/sidekick/Sidekick_drup/module-type-S/index.html
@@ -1,2 +1,2 @@
 
-S (sidekick.Sidekick_drup.S)
Module type Sidekick_drup.S
An instance of the checker
module Atom : sig ... end
type atom = Atom.t
module Clause : sig ... end
type clause = Clause.t
module Checker : sig ... end

\ No newline at end of file
+S (sidekick.Sidekick_drup.S)
Module type Sidekick_drup.S
An instance of the checker
module Atom : sig ... end
type atom = Atom.t
module Clause : sig ... end
type clause = Clause.t
module Checker : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_lit/Make/argument-1-T/Fun/index.html b/dev/sidekick/Sidekick_lit/Make/argument-1-T/Fun/index.html
index 5091becb..53bfaf69 100644
--- a/dev/sidekick/Sidekick_lit/Make/argument-1-T/Fun/index.html
+++ b/dev/sidekick/Sidekick_lit/Make/argument-1-T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_lit.Make.1-T.Fun)
Module 1-T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_lit.Make.1-T.Fun)
Module 1-T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_lit/Make/argument-1-T/Term/index.html b/dev/sidekick/Sidekick_lit/Make/argument-1-T/Term/index.html
index 1f668e2e..38111c56 100644
--- a/dev/sidekick/Sidekick_lit/Make/argument-1-T/Term/index.html
+++ b/dev/sidekick/Sidekick_lit/Make/argument-1-T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_lit.Make.1-T.Term)
Module 1-T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_lit.Make.1-T.Term)
Module 1-T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_lit/Make/argument-1-T/Ty/index.html b/dev/sidekick/Sidekick_lit/Make/argument-1-T/Ty/index.html
index 8cb703af..0ec51672 100644
--- a/dev/sidekick/Sidekick_lit/Make/argument-1-T/Ty/index.html
+++ b/dev/sidekick/Sidekick_lit/Make/argument-1-T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_lit.Make.1-T.Ty)
Module 1-T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_lit.Make.1-T.Ty)
Module 1-T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_lit/Make/argument-1-T/index.html b/dev/sidekick/Sidekick_lit/Make/argument-1-T/index.html
index bd07c30a..a4f7a377 100644
--- a/dev/sidekick/Sidekick_lit/Make/argument-1-T/index.html
+++ b/dev/sidekick/Sidekick_lit/Make/argument-1-T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_lit.Make.1-T)
Parameter Make.1-T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_lit.Make.1-T)
Parameter Make.1-T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_lit/Make/index.html b/dev/sidekick/Sidekick_lit/Make/index.html
index 20346615..8f7fc809 100644
--- a/dev/sidekick/Sidekick_lit/Make/index.html
+++ b/dev/sidekick/Sidekick_lit/Make/index.html
@@ -1,2 +1,2 @@
 
-Make (sidekick.Sidekick_lit.Make)
Module Sidekick_lit.Make
Parameters
Signature
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Make (sidekick.Sidekick_lit.Make)
Module Sidekick_lit.Make
Parameters
Signature
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_lit/index.html b/dev/sidekick/Sidekick_lit/index.html
index 9ad9c7a1..426b2706 100644
--- a/dev/sidekick/Sidekick_lit/index.html
+++ b/dev/sidekick/Sidekick_lit/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_lit (sidekick.Sidekick_lit)
Module Sidekick_lit
Implementation of literals from terms
module Make (T : Sidekick_core.TERM) : Sidekick_core.LIT with module T = T

\ No newline at end of file
+Sidekick_lit (sidekick.Sidekick_lit)
Module Sidekick_lit
Implementation of literals from terms
module Make (T : Sidekick_core.TERM) : Sidekick_core.LIT with module T = T

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_memtrace/index.html b/dev/sidekick/Sidekick_memtrace/index.html
index 0c8c268f..6c86028a 100644
--- a/dev/sidekick/Sidekick_memtrace/index.html
+++ b/dev/sidekick/Sidekick_memtrace/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_memtrace (sidekick.Sidekick_memtrace)
Module Sidekick_memtrace
val trace_if_requested : ?context:string -> ?sampling_rate:float -> unit -> unit

\ No newline at end of file
+Sidekick_memtrace (sidekick.Sidekick_memtrace)
Module Sidekick_memtrace
val trace_if_requested : ?context:string -> ?sampling_rate:float -> unit -> unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_mini_cc/Make/argument-1-A/T/Fun/index.html b/dev/sidekick/Sidekick_mini_cc/Make/argument-1-A/T/Fun/index.html
index 3839ab2a..17d9a85e 100644
--- a/dev/sidekick/Sidekick_mini_cc/Make/argument-1-A/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_mini_cc/Make/argument-1-A/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_mini_cc.Make.1-A.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_mini_cc.Make.1-A.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_mini_cc/Make/argument-1-A/T/Term/index.html b/dev/sidekick/Sidekick_mini_cc/Make/argument-1-A/T/Term/index.html
index df4ab321..ee1fab62 100644
--- a/dev/sidekick/Sidekick_mini_cc/Make/argument-1-A/T/Term/index.html
+++ b/dev/sidekick/Sidekick_mini_cc/Make/argument-1-A/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_mini_cc.Make.1-A.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_mini_cc.Make.1-A.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_mini_cc/Make/argument-1-A/T/Ty/index.html b/dev/sidekick/Sidekick_mini_cc/Make/argument-1-A/T/Ty/index.html
index 1d58190e..4243a41b 100644
--- a/dev/sidekick/Sidekick_mini_cc/Make/argument-1-A/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_mini_cc/Make/argument-1-A/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_mini_cc.Make.1-A.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_mini_cc.Make.1-A.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_mini_cc/Make/argument-1-A/T/index.html b/dev/sidekick/Sidekick_mini_cc/Make/argument-1-A/T/index.html
index 5bc929da..729a9740 100644
--- a/dev/sidekick/Sidekick_mini_cc/Make/argument-1-A/T/index.html
+++ b/dev/sidekick/Sidekick_mini_cc/Make/argument-1-A/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_mini_cc.Make.1-A.T)
Module 1-A.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_mini_cc.Make.1-A.T)
Module 1-A.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_mini_cc/Make/argument-1-A/index.html b/dev/sidekick/Sidekick_mini_cc/Make/argument-1-A/index.html
index 588cd87d..08f14cc5 100644
--- a/dev/sidekick/Sidekick_mini_cc/Make/argument-1-A/index.html
+++ b/dev/sidekick/Sidekick_mini_cc/Make/argument-1-A/index.html
@@ -1,2 +1,2 @@
 
-A (sidekick.Sidekick_mini_cc.Make.1-A)
Parameter Make.1-A
val cc_view : T.Term.t -> (T.Fun.t, T.Term.t, T.Term.t Iter.t) CC_view.t

\ No newline at end of file
+A (sidekick.Sidekick_mini_cc.Make.1-A)
Parameter Make.1-A
val cc_view : T.Term.t -> (T.Fun.t, T.Term.t, T.Term.t Iter.t) CC_view.t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_mini_cc/Make/index.html b/dev/sidekick/Sidekick_mini_cc/Make/index.html
index 50d8b497..1f17f541 100644
--- a/dev/sidekick/Sidekick_mini_cc/Make/index.html
+++ b/dev/sidekick/Sidekick_mini_cc/Make/index.html
@@ -1,2 +1,2 @@
 
-Make (sidekick.Sidekick_mini_cc.Make)
Module Sidekick_mini_cc.Make
Instantiate the congruence closure for the given term structure.
Parameters
module A : ARG
Signature
type term = A.T.Term.t
type fun_ = A.T.Fun.t
type term_store = A.T.Term.store
type t
An instance of the congruence closure. Mutable
val create : term_store -> t
New instance
val clear : t -> unit
Fully reset the congruence closure's state
val add_lit : t -> term -> bool -> unit
add_lit cc p sign asserts that p is true if sign, or p is false if not sign. If p is an equation and sign is true, this adds a new equation to the congruence relation.
val check_sat : t -> bool
check_sat cc returns true if the current state is satisfiable, false if it's unsatisfiable.
val classes : t -> term Iter.t Iter.t
Traverse the set of classes in the congruence closure. This should be called only if check returned Sat.

\ No newline at end of file
+Make (sidekick.Sidekick_mini_cc.Make)
Module Sidekick_mini_cc.Make
Instantiate the congruence closure for the given term structure.
Parameters
module A : ARG
Signature
type term = A.T.Term.t
type fun_ = A.T.Fun.t
type term_store = A.T.Term.store
type t
An instance of the congruence closure. Mutable
val create : term_store -> t
New instance
val clear : t -> unit
Fully reset the congruence closure's state
val add_lit : t -> term -> bool -> unit
add_lit cc p sign asserts that p is true if sign, or p is false if not sign. If p is an equation and sign is true, this adds a new equation to the congruence relation.
val check_sat : t -> bool
check_sat cc returns true if the current state is satisfiable, false if it's unsatisfiable.
val classes : t -> term Iter.t Iter.t
Traverse the set of classes in the congruence closure. This should be called only if check returned Sat.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_mini_cc/index.html b/dev/sidekick/Sidekick_mini_cc/index.html
index 67ee1788..68bec242 100644
--- a/dev/sidekick/Sidekick_mini_cc/index.html
+++ b/dev/sidekick/Sidekick_mini_cc/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_mini_cc (sidekick.Sidekick_mini_cc)
Module Sidekick_mini_cc
Mini congruence closure
This implementation is as simple as possible, and doesn't provide backtracking, theories, or explanations. It just decides the satisfiability of a set of (dis)equations.
module CC_view = Sidekick_core.CC_view
module type ARG = sig ... end
Argument for the functor Make
module type S = sig ... end
Main signature for an instance of the mini congruence closure
module Make (A : ARG) : S with type term = A.T.Term.t and type fun_ = A.T.Fun.t and type term_store = A.T.Term.store
Instantiate the congruence closure for the given term structure.

\ No newline at end of file
+Sidekick_mini_cc (sidekick.Sidekick_mini_cc)
Module Sidekick_mini_cc
Mini congruence closure
This implementation is as simple as possible, and doesn't provide backtracking, theories, or explanations. It just decides the satisfiability of a set of (dis)equations.
module CC_view = Sidekick_core.CC_view
module type ARG = sig ... end
Argument for the functor Make
module type S = sig ... end
Main signature for an instance of the mini congruence closure
module Make (A : ARG) : S with type term = A.T.Term.t and type fun_ = A.T.Fun.t and type term_store = A.T.Term.store
Instantiate the congruence closure for the given term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_mini_cc/module-type-ARG/T/Fun/index.html b/dev/sidekick/Sidekick_mini_cc/module-type-ARG/T/Fun/index.html
index e55297c9..59876586 100644
--- a/dev/sidekick/Sidekick_mini_cc/module-type-ARG/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_mini_cc/module-type-ARG/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_mini_cc.ARG.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_mini_cc.ARG.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_mini_cc/module-type-ARG/T/Term/index.html b/dev/sidekick/Sidekick_mini_cc/module-type-ARG/T/Term/index.html
index a349b2c5..4f1f1bff 100644
--- a/dev/sidekick/Sidekick_mini_cc/module-type-ARG/T/Term/index.html
+++ b/dev/sidekick/Sidekick_mini_cc/module-type-ARG/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_mini_cc.ARG.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_mini_cc.ARG.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_mini_cc/module-type-ARG/T/Ty/index.html b/dev/sidekick/Sidekick_mini_cc/module-type-ARG/T/Ty/index.html
index 57706643..f2132157 100644
--- a/dev/sidekick/Sidekick_mini_cc/module-type-ARG/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_mini_cc/module-type-ARG/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_mini_cc.ARG.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_mini_cc.ARG.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_mini_cc/module-type-ARG/T/index.html b/dev/sidekick/Sidekick_mini_cc/module-type-ARG/T/index.html
index ecab48dd..8304069f 100644
--- a/dev/sidekick/Sidekick_mini_cc/module-type-ARG/T/index.html
+++ b/dev/sidekick/Sidekick_mini_cc/module-type-ARG/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_mini_cc.ARG.T)
Module ARG.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_mini_cc.ARG.T)
Module ARG.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_mini_cc/module-type-ARG/index.html b/dev/sidekick/Sidekick_mini_cc/module-type-ARG/index.html
index 4e1fd4ea..6276d574 100644
--- a/dev/sidekick/Sidekick_mini_cc/module-type-ARG/index.html
+++ b/dev/sidekick/Sidekick_mini_cc/module-type-ARG/index.html
@@ -1,2 +1,2 @@
 
-ARG (sidekick.Sidekick_mini_cc.ARG)
Module type Sidekick_mini_cc.ARG
Argument for the functor Make
It only requires a term structure, and a congruence-oriented view.
val cc_view : T.Term.t -> (T.Fun.t, T.Term.t, T.Term.t Iter.t) CC_view.t

\ No newline at end of file
+ARG (sidekick.Sidekick_mini_cc.ARG)
Module type Sidekick_mini_cc.ARG
Argument for the functor Make
It only requires a term structure, and a congruence-oriented view.
val cc_view : T.Term.t -> (T.Fun.t, T.Term.t, T.Term.t Iter.t) CC_view.t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_mini_cc/module-type-S/index.html b/dev/sidekick/Sidekick_mini_cc/module-type-S/index.html
index 5ef62429..d75687e1 100644
--- a/dev/sidekick/Sidekick_mini_cc/module-type-S/index.html
+++ b/dev/sidekick/Sidekick_mini_cc/module-type-S/index.html
@@ -1,2 +1,2 @@
 
-S (sidekick.Sidekick_mini_cc.S)
Module type Sidekick_mini_cc.S
Main signature for an instance of the mini congruence closure
type term
type fun_
type term_store
type t
An instance of the congruence closure. Mutable
val create : term_store -> t
New instance
val clear : t -> unit
Fully reset the congruence closure's state
val add_lit : t -> term -> bool -> unit
add_lit cc p sign asserts that p is true if sign, or p is false if not sign. If p is an equation and sign is true, this adds a new equation to the congruence relation.
val check_sat : t -> bool
check_sat cc returns true if the current state is satisfiable, false if it's unsatisfiable.
val classes : t -> term Iter.t Iter.t
Traverse the set of classes in the congruence closure. This should be called only if check returned Sat.

\ No newline at end of file
+S (sidekick.Sidekick_mini_cc.S)
Module type Sidekick_mini_cc.S
Main signature for an instance of the mini congruence closure
type term
type fun_
type term_store
type t
An instance of the congruence closure. Mutable
val create : term_store -> t
New instance
val clear : t -> unit
Fully reset the congruence closure's state
val add_lit : t -> term -> bool -> unit
add_lit cc p sign asserts that p is true if sign, or p is false if not sign. If p is an equation and sign is true, this adds a new equation to the congruence relation.
val check_sat : t -> bool
check_sat cc returns true if the current state is satisfiable, false if it's unsatisfiable.
val classes : t -> term Iter.t Iter.t
Traverse the set of classes in the congruence closure. This should be called only if check returned Sat.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_quip/Proof/Fun/index.html b/dev/sidekick/Sidekick_quip/Proof/Fun/index.html
index 5b03325b..c7e71194 100644
--- a/dev/sidekick/Sidekick_quip/Proof/Fun/index.html
+++ b/dev/sidekick/Sidekick_quip/Proof/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_quip.Proof.Fun)
Module Proof.Fun
type t = string
val pp : Sidekick_util.Fmt.t -> t -> unit
val equal : t -> t -> bool
val hash : t -> int

\ No newline at end of file
+Fun (sidekick.Sidekick_quip.Proof.Fun)
Module Proof.Fun
type t = string
val pp : Sidekick_util.Fmt.t -> t -> unit
val equal : t -> t -> bool
val hash : t -> int

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_quip/Proof/Lit/index.html b/dev/sidekick/Sidekick_quip/Proof/Lit/index.html
index fc7263ef..ceafd24b 100644
--- a/dev/sidekick/Sidekick_quip/Proof/Lit/index.html
+++ b/dev/sidekick/Sidekick_quip/Proof/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_quip.Proof.Lit)
Module Proof.Lit
type t = 
| L_eq of term * term
| L_a of bool * term
val pp_with : pp_t:(Sidekick_util.Fmt.t -> term -> unit) -> Sidekick_util.Fmt.t -> t -> unit
val pp : Sidekick_util.Fmt.t -> t -> unit
val eq : term -> term -> t
val mk : bool -> term -> t

\ No newline at end of file
+Lit (sidekick.Sidekick_quip.Proof.Lit)
Module Proof.Lit
type t = 
| L_eq of term * term
| L_a of bool * term
val pp_with : pp_t:(Sidekick_util.Fmt.t -> term -> unit) -> Sidekick_util.Fmt.t -> t -> unit
val pp : Sidekick_util.Fmt.t -> t -> unit
val eq : term -> term -> t
val mk : bool -> term -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_quip/Proof/T/index.html b/dev/sidekick/Sidekick_quip/Proof/T/index.html
index 8292c47e..ca632e2e 100644
--- a/dev/sidekick/Sidekick_quip/Proof/T/index.html
+++ b/dev/sidekick/Sidekick_quip/Proof/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_quip.Proof.T)
Module Proof.T
Representation of terms, with explicit sharing
type t = 
| Bool of bool
| App_fun of Fun.t * t array
| App_ho of t * t
| Ite of t * t * t
| Not of t
| Eq of t * t
| Ref of string
val view : t -> t
val equal : t -> t -> bool
val hash : t -> int
val true_ : t
val false_ : t
val bool : bool -> t
val not_ : t -> t
val eq : t -> t -> t
val ref : string -> t
val app_fun : Fun.t -> t array -> t
val const : Fun.t -> t
val app_ho : t -> t -> t
val ite : t -> t -> t -> t

\ No newline at end of file
+T (sidekick.Sidekick_quip.Proof.T)
Module Proof.T
Representation of terms, with explicit sharing
type t = 
| Bool of bool
| App_fun of Fun.t * t array
| App_ho of t * t
| Ite of t * t * t
| Not of t
| Eq of t * t
| Ref of string
val view : t -> t
val equal : t -> t -> bool
val hash : t -> int
val true_ : t
val false_ : t
val bool : bool -> t
val not_ : t -> t
val eq : t -> t -> t
val ref : string -> t
val app_fun : Fun.t -> t array -> t
val const : Fun.t -> t
val app_ho : t -> t -> t
val ite : t -> t -> t -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_quip/Proof/Ty/index.html b/dev/sidekick/Sidekick_quip/Proof/Ty/index.html
index ad83e50e..8b56fa05 100644
--- a/dev/sidekick/Sidekick_quip/Proof/Ty/index.html
+++ b/dev/sidekick/Sidekick_quip/Proof/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_quip.Proof.Ty)
Module Proof.Ty
Representation of types
type t = 
| Bool
| Arrow of t array * t
| App of string * t array
| Ref of string
val equal : t -> t -> bool
val hash : t -> int
val view : t -> t

\ No newline at end of file
+Ty (sidekick.Sidekick_quip.Proof.Ty)
Module Proof.Ty
Representation of types
type t = 
| Bool
| Arrow of t array * t
| App of string * t array
| Ref of string
val equal : t -> t -> bool
val hash : t -> int
val view : t -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_quip/Proof/index.html b/dev/sidekick/Sidekick_quip/Proof/index.html
index 80d2935c..06be892c 100644
--- a/dev/sidekick/Sidekick_quip/Proof/index.html
+++ b/dev/sidekick/Sidekick_quip/Proof/index.html
@@ -1,2 +1,2 @@
 
-Proof (sidekick.Sidekick_quip.Proof)
Module Sidekick_quip.Proof
type id = int
A reference to a previously defined object in the proof
module Ty : sig ... end
Representation of types
module Fun : sig ... end
module Cstor = Fun
module T : sig ... end
Representation of terms, with explicit sharing
type term = T.t
type ty = Ty.t
module Lit : sig ... end
type clause = Lit.t list
type t = 
| Unspecified
| Sorry
| Sorry_c of clause
| Named of string
| Refl of term
| CC_lemma_imply of t list * term * term
| CC_lemma of clause
| Assertion of term
| Assertion_c of clause
| Hres of t * hres_step list
| Res of term * t * t
| Res1 of t * t
| Paramod1 of t * t
| Rup of clause * t list
| Clause_rw of {
res : clause;
c0 : t;
using : t list;(*
the rewriting equations/atoms
*)
}
| DT_isa_split of ty * term list
| DT_isa_disj of ty * term * term
| DT_cstor_inj of Cstor.t * int * term list * term list
| Bool_true_is_true
| Bool_true_neq_false
| Bool_eq of term * term
| Bool_c of bool_c_name * term list
| Ite_true of term
| Ite_false of term
| LRA of clause
| Composite of {
assumptions : (string * Lit.t) list;
steps : composite_step array;
}
and bool_c_name = string
and composite_step = 
| S_step_c of {
name : string;
res : clause;
proof : t;
}
| S_define_t of term * term
| S_define_t_name of string * term
and hres_step = 
| R of {
pivot : term;
p : t;
}
| R1 of t
| P of {
lhs : term;
rhs : term;
p : t;
}
| P1 of t
val r : t -> pivot:term -> hres_step
val r1 : t -> hres_step
val p : t -> lhs:term -> rhs:term -> hres_step
val p1 : t -> hres_step
val stepc : name:string -> clause -> t -> composite_step
val deft : term -> term -> composite_step
val deft_name : string -> term -> composite_step
val is_trivial_refl : t -> bool
val default : t
val sorry_c : Lit.t Iter.t -> t
val sorry_c_l : clause -> t
val sorry : t
val refl : term -> t
val ref_by_name : string -> t
val cc_lemma : clause -> t
val cc_imply_l : t list -> term -> term -> t
val cc_imply2 : t -> t -> term -> term -> t
val assertion : term -> t
val assertion_c : Lit.t Iter.t -> t
val assertion_c_l : clause -> t
val rup : clause -> t list -> t
val clause_rw : t -> res:clause -> using:t list -> t
val composite_a : ?assms:(string * Lit.t) list -> composite_step array -> t
val composite_l : ?assms:(string * Lit.t) list -> composite_step list -> t
val composite_iter : ?assms:(string * Lit.t) list -> composite_step Iter.t -> t
val isa_split : ty -> term Iter.t -> t
val isa_disj : ty -> term -> term -> t
val cstor_inj : Cstor.t -> int -> term list -> term list -> t
val ite_true : term -> t
val ite_false : term -> t
val true_is_true : t
val true_neq_false : t
val bool_eq : term -> term -> t
val bool_c : bool_c_name -> term list -> t
val hres_l : t -> hres_step list -> t
val hres_iter : t -> hres_step Iter.t -> t
val res : pivot:term -> t -> t -> t
val res1 : t -> t -> t
val paramod1 : t -> t -> t
val lra_l : clause -> t
val lra : Lit.t Iter.t -> t

\ No newline at end of file
+Proof (sidekick.Sidekick_quip.Proof)
Module Sidekick_quip.Proof
type id = int
A reference to a previously defined object in the proof
module Ty : sig ... end
Representation of types
module Fun : sig ... end
module Cstor = Fun
module T : sig ... end
Representation of terms, with explicit sharing
type term = T.t
type ty = Ty.t
module Lit : sig ... end
type clause = Lit.t list
type t = 
| Unspecified
| Sorry
| Sorry_c of clause
| Named of string
| Refl of term
| CC_lemma_imply of t list * term * term
| CC_lemma of clause
| Assertion of term
| Assertion_c of clause
| Hres of t * hres_step list
| Res of term * t * t
| Res1 of t * t
| Paramod1 of t * t
| Rup of clause * t list
| Clause_rw of {
res : clause;
c0 : t;
using : t list;(*
the rewriting equations/atoms
*)
}
| DT_isa_split of ty * term list
| DT_isa_disj of ty * term * term
| DT_cstor_inj of Cstor.t * int * term list * term list
| Bool_true_is_true
| Bool_true_neq_false
| Bool_eq of term * term
| Bool_c of bool_c_name * term list
| Ite_true of term
| Ite_false of term
| LRA of clause
| Composite of {
assumptions : (string * Lit.t) list;
steps : composite_step array;
}
and bool_c_name = string
and composite_step = 
| S_step_c of {
name : string;
res : clause;
proof : t;
}
| S_define_t of term * term
| S_define_t_name of string * term
and hres_step = 
| R of {
pivot : term;
p : t;
}
| R1 of t
| P of {
lhs : term;
rhs : term;
p : t;
}
| P1 of t
val r : t -> pivot:term -> hres_step
val r1 : t -> hres_step
val p : t -> lhs:term -> rhs:term -> hres_step
val p1 : t -> hres_step
val stepc : name:string -> clause -> t -> composite_step
val deft : term -> term -> composite_step
val deft_name : string -> term -> composite_step
val is_trivial_refl : t -> bool
val default : t
val sorry_c : Lit.t Iter.t -> t
val sorry_c_l : clause -> t
val sorry : t
val refl : term -> t
val ref_by_name : string -> t
val cc_lemma : clause -> t
val cc_imply_l : t list -> term -> term -> t
val cc_imply2 : t -> t -> term -> term -> t
val assertion : term -> t
val assertion_c : Lit.t Iter.t -> t
val assertion_c_l : clause -> t
val rup : clause -> t list -> t
val clause_rw : t -> res:clause -> using:t list -> t
val composite_a : ?assms:(string * Lit.t) list -> composite_step array -> t
val composite_l : ?assms:(string * Lit.t) list -> composite_step list -> t
val composite_iter : ?assms:(string * Lit.t) list -> composite_step Iter.t -> t
val isa_split : ty -> term Iter.t -> t
val isa_disj : ty -> term -> term -> t
val cstor_inj : Cstor.t -> int -> term list -> term list -> t
val ite_true : term -> t
val ite_false : term -> t
val true_is_true : t
val true_neq_false : t
val bool_eq : term -> term -> t
val bool_c : bool_c_name -> term list -> t
val hres_l : t -> hres_step list -> t
val hres_iter : t -> hres_step Iter.t -> t
val res : pivot:term -> t -> t -> t
val res1 : t -> t -> t
val paramod1 : t -> t -> t
val lra_l : clause -> t
val lra : Lit.t Iter.t -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_quip/index.html b/dev/sidekick/Sidekick_quip/index.html
index 4ef27521..7cc107dc 100644
--- a/dev/sidekick/Sidekick_quip/index.html
+++ b/dev/sidekick/Sidekick_quip/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_quip (sidekick.Sidekick_quip)
Module Sidekick_quip
Proofs of unsatisfiability in the Quip proof format..
This targets Quip as an experimental proof backend.
module Proof : sig ... end
type t = Proof.t
The state holding the whole proof.
type out_format = 
| Sexp(*
S-expressions
*)
| CSexp(*
Canonical S-expressions
*)
What format to use to serialize the proof?
val pp_out_format : out_format Sidekick_util.Fmt.printer
val output : ?fmt:out_format -> Stdlib.out_channel -> t -> unit
val pp_debug : t Sidekick_util.Fmt.printer

\ No newline at end of file
+Sidekick_quip (sidekick.Sidekick_quip)
Module Sidekick_quip
Proofs of unsatisfiability in the Quip proof format..
This targets Quip as an experimental proof backend.
module Proof : sig ... end
type t = Proof.t
The state holding the whole proof.
type out_format = 
| Sexp(*
S-expressions
*)
| CSexp(*
Canonical S-expressions
*)
What format to use to serialize the proof?
val pp_out_format : out_format Sidekick_util.Fmt.printer
val output : ?fmt:out_format -> Stdlib.out_channel -> t -> unit
val pp_debug : t Sidekick_util.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_quip__/index.html b/dev/sidekick/Sidekick_quip__/index.html
index f707e1d8..5110bf05 100644
--- a/dev/sidekick/Sidekick_quip__/index.html
+++ b/dev/sidekick/Sidekick_quip__/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_quip__ (sidekick.Sidekick_quip__)
Module Sidekick_quip__

\ No newline at end of file
+Sidekick_quip__ (sidekick.Sidekick_quip__)
Module Sidekick_quip__

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_quip__Proof/index.html b/dev/sidekick/Sidekick_quip__Proof/index.html
index f9063c42..4fc8779a 100644
--- a/dev/sidekick/Sidekick_quip__Proof/index.html
+++ b/dev/sidekick/Sidekick_quip__Proof/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_quip__Proof (sidekick.Sidekick_quip__Proof)
Module Sidekick_quip__Proof

\ No newline at end of file
+Sidekick_quip__Proof (sidekick.Sidekick_quip__Proof)
Module Sidekick_quip__Proof

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/Clause/index.html b/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/Clause/index.html
index 36f6c3e9..1060da70 100644
--- a/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/Clause/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/Clause/index.html
@@ -1,2 +1,2 @@
 
-Clause (sidekick.Sidekick_sat.Solver.Make_cdcl_t.Clause)
Module Make_cdcl_t.Clause
type t = clause
val equal : t -> t -> bool
module Tbl : Stdlib.Hashtbl.S with type key = t
Print the clause
val short_name : store -> t -> string
Short name for a clause. Unspecified
val n_atoms : store -> t -> int
val lits_iter : store -> t -> lit Iter.t
Literals of a clause
val lits_a : store -> t -> lit array
Atoms of a clause
val lits_l : store -> t -> lit list
List of atoms of a clause

\ No newline at end of file
+Clause (sidekick.Sidekick_sat.Solver.Make_cdcl_t.Clause)
Module Make_cdcl_t.Clause
type t = clause
val equal : t -> t -> bool
module Tbl : Stdlib.Hashtbl.S with type key = t
Print the clause
val short_name : store -> t -> string
Short name for a clause. Unspecified
val n_atoms : store -> t -> int
val lits_iter : store -> t -> lit Iter.t
Literals of a clause
val lits_a : store -> t -> lit array
Atoms of a clause
val lits_l : store -> t -> lit list
List of atoms of a clause

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/argument-1-Th/Lit/index.html b/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/argument-1-Th/Lit/index.html
index 43543a2b..9b00e6cd 100644
--- a/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/argument-1-Th/Lit/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/argument-1-Th/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_sat.Solver.Make_cdcl_t.1-Th.Lit)
Module 1-Th.Lit
lits
type t = lit
The type of atomic lits over terms.
val equal : t -> t -> bool
Equality over lits.
val hash : t -> int
Hashing function for lits. Should be such that two lits equal according to Expr_intf.S.equal have the same hash.
Printing function used among other thing for debugging.
val neg : t -> t
Formula negation
val norm_sign : t -> t * Solver_intf.same_sign
Returns a 'normalized' form of the lit, possibly same_sign (in which case return false). norm must be so that a and neg a normalise to the same lit, but one returns false and the other true.

\ No newline at end of file
+Lit (sidekick.Sidekick_sat.Solver.Make_cdcl_t.1-Th.Lit)
Module 1-Th.Lit
lits
type t = lit
The type of atomic lits over terms.
val equal : t -> t -> bool
Equality over lits.
val hash : t -> int
Hashing function for lits. Should be such that two lits equal according to Expr_intf.S.equal have the same hash.
Printing function used among other thing for debugging.
val neg : t -> t
Formula negation
val norm_sign : t -> t * Solver_intf.same_sign
Returns a 'normalized' form of the lit, possibly same_sign (in which case return false). norm must be so that a and neg a normalise to the same lit, but one returns false and the other true.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/argument-1-Th/Proof/Step_vec/index.html b/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/argument-1-Th/Proof/Step_vec/index.html
index 788986e2..616b96a3 100644
--- a/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/argument-1-Th/Proof/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/argument-1-Th/Proof/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_sat.Solver.Make_cdcl_t.1-Th.Proof.Step_vec)
Module Proof.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_sat.Solver.Make_cdcl_t.1-Th.Proof.Step_vec)
Module Proof.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/argument-1-Th/Proof/index.html b/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/argument-1-Th/Proof/index.html
index 010f9ab3..d7141888 100644
--- a/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/argument-1-Th/Proof/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/argument-1-Th/Proof/index.html
@@ -1,2 +1,2 @@
 
-Proof (sidekick.Sidekick_sat.Solver.Make_cdcl_t.1-Th.Proof)
Module 1-Th.Proof
type t = proof
The stored proof (possibly nil, possibly on disk, possibly in memory)
type proof_step = proof_step
identifier for a proof
A vector of steps
type lit = lit
A boolean literal for the proof trace
type proof_rule = t -> proof_step
A proof proof_rule constructor, used to obtain proofs from theories
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.

\ No newline at end of file
+Proof (sidekick.Sidekick_sat.Solver.Make_cdcl_t.1-Th.Proof)
Module 1-Th.Proof
type t = proof
The stored proof (possibly nil, possibly on disk, possibly in memory)
type proof_step = proof_step
identifier for a proof
A vector of steps
type lit = lit
A boolean literal for the proof trace
type proof_rule = t -> proof_step
A proof proof_rule constructor, used to obtain proofs from theories
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/argument-1-Th/index.html b/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/argument-1-Th/index.html
index 1f88bac1..ab86cb5f 100644
--- a/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/argument-1-Th/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/argument-1-Th/index.html
@@ -1,2 +1,2 @@
 
-Th (sidekick.Sidekick_sat.Solver.Make_cdcl_t.1-Th)
Parameter Make_cdcl_t.1-Th
type t
The plugin state itself
type lit
module Lit : Solver_intf.LIT with type t = lit
lits
type proof
Proof storage/recording
type proof_step
Identifier for a clause precendently added/proved
module Proof : Solver_intf.PROOF with type t = proof and type lit = lit and type proof_step = proof_step
val push_level : t -> unit
Create a new backtrack level
val pop_levels : t -> int -> unit
Pop n levels of the theory
val partial_check : t -> (lit, proof, proof_step) Solver_intf.acts -> unit
Assume the lits in the slice, possibly using the slice to push new lits to be propagated or to raising a conflict or to add new lemmas.
val final_check : t -> (lit, proof, proof_step) Solver_intf.acts -> unit
Called at the end of the search in case a model has been found. If no new clause is pushed, then proof search ends and "sat" is returned; if lemmas are added, search is resumed; if a conflict clause is added, search backtracks and then resumes.

\ No newline at end of file
+Th (sidekick.Sidekick_sat.Solver.Make_cdcl_t.1-Th)
Parameter Make_cdcl_t.1-Th
type t
The plugin state itself
type lit
module Lit : Solver_intf.LIT with type t = lit
lits
type proof
Proof storage/recording
type proof_step
Identifier for a clause precendently added/proved
module Proof : Solver_intf.PROOF with type t = proof and type lit = lit and type proof_step = proof_step
val push_level : t -> unit
Create a new backtrack level
val pop_levels : t -> int -> unit
Pop n levels of the theory
val partial_check : t -> (lit, proof, proof_step) Solver_intf.acts -> unit
Assume the lits in the slice, possibly using the slice to push new lits to be propagated or to raising a conflict or to add new lemmas.
val final_check : t -> (lit, proof, proof_step) Solver_intf.acts -> unit
Called at the end of the search in case a model has been found. If no new clause is pushed, then proof search ends and "sat" is returned; if lemmas are added, search is resumed; if a conflict clause is added, search backtracks and then resumes.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/index.html b/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/index.html
index fdf85889..b5fac6a5 100644
--- a/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver/Make_cdcl_t/index.html
@@ -1,4 +1,4 @@
 
-Make_cdcl_t (sidekick.Sidekick_sat.Solver.Make_cdcl_t)
Module Solver.Make_cdcl_t
Internal modules
These are the internal modules used, you should probably not use them if you're not familiar with the internals of mSAT.
Parameters
Signature
type lit = Th.lit
literals
module Lit = Th.Lit
type clause
type clause_pool_id
Pool of clauses, with its own lifetime management
type theory = Th.t
type proof = Th.proof
A representation of a full proof
type proof_step = Th.proof_step
type solver
The main solver type.
type store
Stores atoms, clauses, etc.
module Clause : sig ... end
module Proof = Th.Proof
A module to manipulate proofs.
type t = solver
Main solver type, containing all state for solving.
val create : ?on_conflict:(t -> Clause.t -> unit) -> ?on_decision:(t -> lit -> unit) ->
+Make_cdcl_t (sidekick.Sidekick_sat.Solver.Make_cdcl_t)
Module Solver.Make_cdcl_t
Parameters
Signature
Internal modules
These are the internal modules used, you should probably not use them if you're not familiar with the internals of mSAT.
type lit = Th.lit
literals
module Lit = Th.Lit
type clause
type clause_pool_id
Pool of clauses, with its own lifetime management
type theory = Th.t
type proof = Th.proof
A representation of a full proof
type proof_step = Th.proof_step
type solver
The main solver type.
type store
Stores atoms, clauses, etc.
module Clause : sig ... end
module Proof = Th.Proof
A module to manipulate proofs.
type t = solver
Main solver type, containing all state for solving.
val create : ?on_conflict:(t -> Clause.t -> unit) -> ?on_decision:(t -> lit -> unit) ->
 ?on_learnt:(t -> Clause.t -> unit) -> ?on_gc:(t -> lit array -> unit) -> ?stat:Sidekick_util.Stat.t ->
 ?size:[ `Tiny | `Small | `Big ] -> proof:Proof.t -> theory -> t
Create new solver
  • parameter theory 
    the theory
  • parameter the 
    proof
  • parameter size 
    the initial size of internal data structures. The bigger, the faster, but also the more RAM it uses.
val theory : t -> theory
Access the theory state
val store : t -> store
Store for the solver
val stat : t -> Sidekick_util.Stat.t
Statistics
val proof : t -> proof
Access the inner proof
Clause Pools
Clause pools.
A clause pool holds/owns a set of clauses, and is responsible for managing their lifetime. We only expose an id, not a private type.
val clause_pool_descr : t -> clause_pool_id -> string
val new_clause_pool_gc_fixed_size : descr:string -> size:int -> t -> clause_pool_id
Allocate a new clause pool that GC's its clauses when its size goes above size. It keeps half of the clauses.
Types
type res = 
| Sat of lit Solver_intf.sat_state(*
Returned when the solver reaches SAT, with a model
*)
| Unsat of (lit, clause, proof_step) Solver_intf.unsat_state(*
Returned when the solver reaches UNSAT, with a proof
*)
Result type for the solver
exception UndecidedLit
Exception raised by the evaluating functions when a literal has not yet been assigned a value.
Base operations
val assume : t -> lit list list -> unit
Add the list of clauses to the current set of assumptions. Modifies the sat solver state in place.
val add_clause : t -> lit list -> proof_step -> unit
Lower level addition of clauses
val add_clause_a : t -> lit array -> proof_step -> unit
Lower level addition of clauses
val add_input_clause : t -> lit list -> unit
Like add_clause but with the justification of being an input clause
val add_input_clause_a : t -> lit array -> unit
Like add_clause_a but with justification of being an input clause
val add_clause_in_pool : t -> pool:clause_pool_id -> lit list -> proof_step -> unit
Like add_clause but using a specific clause pool
val add_clause_a_in_pool : t -> pool:clause_pool_id -> lit array -> proof_step -> unit
Like add_clause_a but using a specific clause pool
val solve : ?assumptions:lit list -> t -> res
Try and solves the current set of clauses.
  • parameter assumptions 
    additional atomic assumptions to be temporarily added. The assumptions are just used for this call to solve, they are not saved in the solver's state.
val add_lit : t -> ?default_pol:bool -> lit -> unit
Ensure the SAT solver handles this particular literal, ie add a boolean variable for it if it's not already there.
val set_default_pol : t -> lit -> bool -> unit
Set default polarity for the given boolean variable. Sign of the literal is ignored.
val true_at_level0 : t -> lit -> bool
true_at_level0 a returns true if a was proved at level0, i.e. it must hold in all models
val eval_lit : t -> lit -> Solver_intf.lbool
Evaluate atom in current state

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/Clause/index.html b/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/Clause/index.html
index d18a2cac..fcf71d64 100644
--- a/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/Clause/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/Clause/index.html
@@ -1,2 +1,2 @@
 
-Clause (sidekick.Sidekick_sat.Solver.Make_pure_sat.Clause)
Module Make_pure_sat.Clause
type t = clause
val equal : t -> t -> bool
module Tbl : Stdlib.Hashtbl.S with type key = t
Print the clause
val short_name : store -> t -> string
Short name for a clause. Unspecified
val n_atoms : store -> t -> int
val lits_iter : store -> t -> lit Iter.t
Literals of a clause
val lits_a : store -> t -> lit array
Atoms of a clause
val lits_l : store -> t -> lit list
List of atoms of a clause

\ No newline at end of file
+Clause (sidekick.Sidekick_sat.Solver.Make_pure_sat.Clause)
Module Make_pure_sat.Clause
type t = clause
val equal : t -> t -> bool
module Tbl : Stdlib.Hashtbl.S with type key = t
Print the clause
val short_name : store -> t -> string
Short name for a clause. Unspecified
val n_atoms : store -> t -> int
val lits_iter : store -> t -> lit Iter.t
Literals of a clause
val lits_a : store -> t -> lit array
Atoms of a clause
val lits_l : store -> t -> lit list
List of atoms of a clause

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/argument-1-Th/Lit/index.html b/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/argument-1-Th/Lit/index.html
index e7319f05..cae968ac 100644
--- a/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/argument-1-Th/Lit/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/argument-1-Th/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_sat.Solver.Make_pure_sat.1-Th.Lit)
Module 1-Th.Lit
lits
type t = lit
The type of atomic lits over terms.
val equal : t -> t -> bool
Equality over lits.
val hash : t -> int
Hashing function for lits. Should be such that two lits equal according to Expr_intf.S.equal have the same hash.
Printing function used among other thing for debugging.
val neg : t -> t
Formula negation
val norm_sign : t -> t * Solver_intf.same_sign
Returns a 'normalized' form of the lit, possibly same_sign (in which case return false). norm must be so that a and neg a normalise to the same lit, but one returns false and the other true.

\ No newline at end of file
+Lit (sidekick.Sidekick_sat.Solver.Make_pure_sat.1-Th.Lit)
Module 1-Th.Lit
lits
type t = lit
The type of atomic lits over terms.
val equal : t -> t -> bool
Equality over lits.
val hash : t -> int
Hashing function for lits. Should be such that two lits equal according to Expr_intf.S.equal have the same hash.
Printing function used among other thing for debugging.
val neg : t -> t
Formula negation
val norm_sign : t -> t * Solver_intf.same_sign
Returns a 'normalized' form of the lit, possibly same_sign (in which case return false). norm must be so that a and neg a normalise to the same lit, but one returns false and the other true.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/argument-1-Th/Proof/Step_vec/index.html b/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/argument-1-Th/Proof/Step_vec/index.html
index 16fcaad1..959b7702 100644
--- a/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/argument-1-Th/Proof/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/argument-1-Th/Proof/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_sat.Solver.Make_pure_sat.1-Th.Proof.Step_vec)
Module Proof.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_sat.Solver.Make_pure_sat.1-Th.Proof.Step_vec)
Module Proof.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/argument-1-Th/Proof/index.html b/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/argument-1-Th/Proof/index.html
index dc7e22cb..cf126184 100644
--- a/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/argument-1-Th/Proof/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/argument-1-Th/Proof/index.html
@@ -1,2 +1,2 @@
 
-Proof (sidekick.Sidekick_sat.Solver.Make_pure_sat.1-Th.Proof)
Module 1-Th.Proof
type t = proof
The stored proof (possibly nil, possibly on disk, possibly in memory)
type proof_step = proof_step
identifier for a proof
A vector of steps
type lit = lit
A boolean literal for the proof trace
type proof_rule = t -> proof_step
A proof proof_rule constructor, used to obtain proofs from theories
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.

\ No newline at end of file
+Proof (sidekick.Sidekick_sat.Solver.Make_pure_sat.1-Th.Proof)
Module 1-Th.Proof
type t = proof
The stored proof (possibly nil, possibly on disk, possibly in memory)
type proof_step = proof_step
identifier for a proof
A vector of steps
type lit = lit
A boolean literal for the proof trace
type proof_rule = t -> proof_step
A proof proof_rule constructor, used to obtain proofs from theories
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/argument-1-Th/index.html b/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/argument-1-Th/index.html
index 739c73f4..c0073ac7 100644
--- a/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/argument-1-Th/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/argument-1-Th/index.html
@@ -1,2 +1,2 @@
 
-Th (sidekick.Sidekick_sat.Solver.Make_pure_sat.1-Th)
Parameter Make_pure_sat.1-Th
type lit
module Lit : Solver_intf.LIT with type t = lit
lits
type proof
type proof_step
module Proof : Solver_intf.PROOF with type t = proof and type lit = lit and type proof_step = proof_step

\ No newline at end of file
+Th (sidekick.Sidekick_sat.Solver.Make_pure_sat.1-Th)
Parameter Make_pure_sat.1-Th
type lit
module Lit : Solver_intf.LIT with type t = lit
lits
type proof
type proof_step
module Proof : Solver_intf.PROOF with type t = proof and type lit = lit and type proof_step = proof_step

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/index.html b/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/index.html
index 3d5f65ed..b31b6078 100644
--- a/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver/Make_pure_sat/index.html
@@ -1,4 +1,4 @@
 
-Make_pure_sat (sidekick.Sidekick_sat.Solver.Make_pure_sat)
Module Solver.Make_pure_sat
Internal modules
These are the internal modules used, you should probably not use them if you're not familiar with the internals of mSAT.
Parameters
Signature
type lit = Th.lit
literals
module Lit = Th.Lit
type clause
type clause_pool_id
Pool of clauses, with its own lifetime management
type theory = unit
type proof = Th.proof
A representation of a full proof
type proof_step = Th.proof_step
type solver
The main solver type.
type store
Stores atoms, clauses, etc.
module Clause : sig ... end
module Proof = Th.Proof
A module to manipulate proofs.
type t = solver
Main solver type, containing all state for solving.
val create : ?on_conflict:(t -> Clause.t -> unit) -> ?on_decision:(t -> lit -> unit) ->
+Make_pure_sat (sidekick.Sidekick_sat.Solver.Make_pure_sat)
Module Solver.Make_pure_sat
Parameters
Signature
Internal modules
These are the internal modules used, you should probably not use them if you're not familiar with the internals of mSAT.
type lit = Th.lit
literals
module Lit = Th.Lit
type clause
type clause_pool_id
Pool of clauses, with its own lifetime management
type theory = unit
type proof = Th.proof
A representation of a full proof
type proof_step = Th.proof_step
type solver
The main solver type.
type store
Stores atoms, clauses, etc.
module Clause : sig ... end
module Proof = Th.Proof
A module to manipulate proofs.
type t = solver
Main solver type, containing all state for solving.
val create : ?on_conflict:(t -> Clause.t -> unit) -> ?on_decision:(t -> lit -> unit) ->
 ?on_learnt:(t -> Clause.t -> unit) -> ?on_gc:(t -> lit array -> unit) -> ?stat:Sidekick_util.Stat.t ->
 ?size:[ `Tiny | `Small | `Big ] -> proof:Proof.t -> theory -> t
Create new solver
  • parameter theory 
    the theory
  • parameter the 
    proof
  • parameter size 
    the initial size of internal data structures. The bigger, the faster, but also the more RAM it uses.
val theory : t -> theory
Access the theory state
val store : t -> store
Store for the solver
val stat : t -> Sidekick_util.Stat.t
Statistics
val proof : t -> proof
Access the inner proof
Clause Pools
Clause pools.
A clause pool holds/owns a set of clauses, and is responsible for managing their lifetime. We only expose an id, not a private type.
val clause_pool_descr : t -> clause_pool_id -> string
val new_clause_pool_gc_fixed_size : descr:string -> size:int -> t -> clause_pool_id
Allocate a new clause pool that GC's its clauses when its size goes above size. It keeps half of the clauses.
Types
type res = 
| Sat of lit Solver_intf.sat_state(*
Returned when the solver reaches SAT, with a model
*)
| Unsat of (lit, clause, proof_step) Solver_intf.unsat_state(*
Returned when the solver reaches UNSAT, with a proof
*)
Result type for the solver
exception UndecidedLit
Exception raised by the evaluating functions when a literal has not yet been assigned a value.
Base operations
val assume : t -> lit list list -> unit
Add the list of clauses to the current set of assumptions. Modifies the sat solver state in place.
val add_clause : t -> lit list -> proof_step -> unit
Lower level addition of clauses
val add_clause_a : t -> lit array -> proof_step -> unit
Lower level addition of clauses
val add_input_clause : t -> lit list -> unit
Like add_clause but with the justification of being an input clause
val add_input_clause_a : t -> lit array -> unit
Like add_clause_a but with justification of being an input clause
val add_clause_in_pool : t -> pool:clause_pool_id -> lit list -> proof_step -> unit
Like add_clause but using a specific clause pool
val add_clause_a_in_pool : t -> pool:clause_pool_id -> lit array -> proof_step -> unit
Like add_clause_a but using a specific clause pool
val solve : ?assumptions:lit list -> t -> res
Try and solves the current set of clauses.
  • parameter assumptions 
    additional atomic assumptions to be temporarily added. The assumptions are just used for this call to solve, they are not saved in the solver's state.
val add_lit : t -> ?default_pol:bool -> lit -> unit
Ensure the SAT solver handles this particular literal, ie add a boolean variable for it if it's not already there.
val set_default_pol : t -> lit -> bool -> unit
Set default polarity for the given boolean variable. Sign of the literal is ignored.
val true_at_level0 : t -> lit -> bool
true_at_level0 a returns true if a was proved at level0, i.e. it must hold in all models
val eval_lit : t -> lit -> Solver_intf.lbool
Evaluate atom in current state

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver/index.html b/dev/sidekick/Sidekick_sat/Solver/index.html
index 42976f78..5f9fda3e 100644
--- a/dev/sidekick/Sidekick_sat/Solver/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver/index.html
@@ -1,4 +1,4 @@
 
-Solver (sidekick.Sidekick_sat.Solver)
Module Sidekick_sat.Solver
module type S = Solver_intf.S
Safe external interface of solvers.
module Make_pure_sat (Th : Solver_intf.PLUGIN_SAT) : S with type lit = Th.lit and module Lit = Th.Lit and type proof = Th.proof and type proof_step = Th.proof_step and module Proof
+Solver (sidekick.Sidekick_sat.Solver)
Module Sidekick_sat.Solver
module type S = Solver_intf.S
Safe external interface of solvers.
module Make_pure_sat (Th : Solver_intf.PLUGIN_SAT) : S with type lit = Th.lit and module Lit = Th.Lit and type proof = Th.proof and type proof_step = Th.proof_step and module Proof
 = Th.Proof and type theory = unit
module Make_cdcl_t (Th : Solver_intf.PLUGIN_CDCL_T) : S with type lit = Th.lit and module Lit = Th.Lit and type proof = Th.proof and type proof_step = Th.proof_step and module Proof
 = Th.Proof and type theory = Th.t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver_intf/Clause_pool_id/index.html b/dev/sidekick/Sidekick_sat/Solver_intf/Clause_pool_id/index.html
index ccdbd7b0..7c538ed0 100644
--- a/dev/sidekick/Sidekick_sat/Solver_intf/Clause_pool_id/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver_intf/Clause_pool_id/index.html
@@ -1,2 +1,2 @@
 
-Clause_pool_id (sidekick.Sidekick_sat.Solver_intf.Clause_pool_id)
Module Solver_intf.Clause_pool_id
type t = private int
val _unsafe_of_int : int -> t

\ No newline at end of file
+Clause_pool_id (sidekick.Sidekick_sat.Solver_intf.Clause_pool_id)
Module Solver_intf.Clause_pool_id
type t = private int
val _unsafe_of_int : int -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver_intf/index.html b/dev/sidekick/Sidekick_sat/Solver_intf/index.html
index e9d75be9..53f6b8b8 100644
--- a/dev/sidekick/Sidekick_sat/Solver_intf/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver_intf/index.html
@@ -1,2 +1,2 @@
 
-Solver_intf (sidekick.Sidekick_sat.Solver_intf)
Module Sidekick_sat.Solver_intf
Interface for Solvers
This modules defines the safe external interface for solvers. Solvers that implements this interface can be obtained using the Make functor in Solver or Mcsolver.
type 'a printer = Stdlib.Format.formatter -> 'a -> unit
module type SAT_STATE = sig ... end
type 'form sat_state = (module SAT_STATE with type lit = 'form)
The type of values returned when the solver reaches a SAT state.
module type UNSAT_STATE = sig ... end
type ('lit, 'clause, 'proof) unsat_state = (module UNSAT_STATE with type clause = 'clause and type lit = 'lit and type proof = 'proof)
The type of values returned when the solver reaches an UNSAT state.
type same_sign = bool
This type is used during the normalisation of lits. true means the literal stayed the same, false that its sign was flipped.
type ('lit, 'proof) reason = 
| Consequence of unit -> 'lit list * 'proof
The type of reasons for propagations of a lit f.
Consequence (l, p) means that the lits in l imply the propagated lit f. The proof should be a proof of the clause "l implies f".
invariant: in Consequence (fun () -> l,p), all elements of l must be true in the current trail.
note on lazyiness: the justification is suspended (using unit -> …) to avoid potentially costly computations that might never be used if this literal is backtracked without participating in a conflict. Therefore the function that produces (l,p) needs only be safe in trails (partial models) that are conservative extensions of the current trail. If the theory isn't robust w.r.t. extensions of the trail (e.g. if its internal state undergoes significant changes), it can be easier to produce the explanation eagerly when propagating, and then use Consequence (fun () -> expl, proof) with the already produced (expl,proof) tuple.
type lbool = 
| L_true
| L_false
| L_undefined(*
Valuation of an atom
*)
module Clause_pool_id : sig ... end
module type ACTS = sig ... end
Actions available to the Plugin
type ('lit, 'proof, 'proof_step) acts = (module ACTS with type lit = 'lit and type proof = 'proof and type proof_step = 'proof_step)
The type for a slice of assertions to assume/propagate in the theory.
exception No_proof
module type LIT = sig ... end
lits
module type PROOF = Sidekick_core.SAT_PROOF
module type PLUGIN_CDCL_T = sig ... end
Signature for theories to be given to the CDCL(T) solver
module type PLUGIN_SAT = sig ... end
Signature for pure SAT solvers
module type S = sig ... end
The external interface implemented by safe solvers, such as the one created by the Solver.Make and Mcsolver.Make functors.

\ No newline at end of file
+Solver_intf (sidekick.Sidekick_sat.Solver_intf)
Module Sidekick_sat.Solver_intf
Interface for Solvers
This modules defines the safe external interface for solvers. Solvers that implements this interface can be obtained using the Make functor in Solver or Mcsolver.
type 'a printer = Stdlib.Format.formatter -> 'a -> unit
module type SAT_STATE = sig ... end
type 'form sat_state = (module SAT_STATE with type lit = 'form)
The type of values returned when the solver reaches a SAT state.
module type UNSAT_STATE = sig ... end
type ('lit, 'clause, 'proof) unsat_state = (module UNSAT_STATE with type clause = 'clause and type lit = 'lit and type proof = 'proof)
The type of values returned when the solver reaches an UNSAT state.
type same_sign = bool
This type is used during the normalisation of lits. true means the literal stayed the same, false that its sign was flipped.
type ('lit, 'proof) reason = 
| Consequence of unit -> 'lit list * 'proof
The type of reasons for propagations of a lit f.
Consequence (l, p) means that the lits in l imply the propagated lit f. The proof should be a proof of the clause "l implies f".
invariant: in Consequence (fun () -> l,p), all elements of l must be true in the current trail.
note on lazyiness: the justification is suspended (using unit -> …) to avoid potentially costly computations that might never be used if this literal is backtracked without participating in a conflict. Therefore the function that produces (l,p) needs only be safe in trails (partial models) that are conservative extensions of the current trail. If the theory isn't robust w.r.t. extensions of the trail (e.g. if its internal state undergoes significant changes), it can be easier to produce the explanation eagerly when propagating, and then use Consequence (fun () -> expl, proof) with the already produced (expl,proof) tuple.
type lbool = 
| L_true
| L_false
| L_undefined(*
Valuation of an atom
*)
module Clause_pool_id : sig ... end
module type ACTS = sig ... end
Actions available to the Plugin
type ('lit, 'proof, 'proof_step) acts = (module ACTS with type lit = 'lit and type proof = 'proof and type proof_step = 'proof_step)
The type for a slice of assertions to assume/propagate in the theory.
exception No_proof
module type LIT = sig ... end
lits
module type PROOF = Sidekick_core.SAT_PROOF
module type PLUGIN_CDCL_T = sig ... end
Signature for theories to be given to the CDCL(T) solver
module type PLUGIN_SAT = sig ... end
Signature for pure SAT solvers
module type S = sig ... end
The external interface implemented by safe solvers, such as the one created by the Solver.Make and Mcsolver.Make functors.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-ACTS/index.html b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-ACTS/index.html
index 989dce77..883d24e3 100644
--- a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-ACTS/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-ACTS/index.html
@@ -1,2 +1,2 @@
 
-ACTS (sidekick.Sidekick_sat.Solver_intf.ACTS)
Module type Solver_intf.ACTS
Actions available to the Plugin
The plugin provides callbacks for the SAT solver to use. These callbacks are provided with a (module ACTS) so they can modify the SAT solver by adding new lemmas, raise conflicts, etc.
type lit
type proof
type proof_step
type clause_pool_id = Clause_pool_id.t
val proof : proof
val iter_assumptions : (lit -> unit) -> unit
Traverse the new assumptions on the boolean trail.
val eval_lit : lit -> lbool
Obtain current value of the given literal
val add_lit : ?default_pol:bool -> lit -> unit
Map the given lit to an internal atom, which will be decided by the SAT solver.
val add_clause : ?keep:bool -> lit list -> proof_step -> unit
Add a clause to the solver.
  • parameter keep 
    if true, the clause will be kept by the solver. Otherwise the solver is allowed to GC the clause and propose this partial model again.
    • C_use_allocator alloc puts the clause in the given allocator.
val add_clause_in_pool : pool:clause_pool_id -> lit list -> proof_step -> unit
Like add_clause but uses a custom clause pool for the clause, with its own lifetime.
val raise_conflict : lit list -> proof_step -> 'b
Raise a conflict, yielding control back to the solver. The list of atoms must be a valid theory lemma that is false in the current trail.
val propagate : lit -> (lit, proof_step) reason -> unit
Propagate a lit, i.e. the theory can evaluate the lit to be true (see the definition of eval_res
val add_decision_lit : lit -> bool -> unit
Ask the SAT solver to decide on the given lit with given sign before it can answer SAT. The order of decisions is still unspecified. Useful for theory combination. This will be undone on backtracking.

\ No newline at end of file
+ACTS (sidekick.Sidekick_sat.Solver_intf.ACTS)
Module type Solver_intf.ACTS
Actions available to the Plugin
The plugin provides callbacks for the SAT solver to use. These callbacks are provided with a (module ACTS) so they can modify the SAT solver by adding new lemmas, raise conflicts, etc.
type lit
type proof
type proof_step
type clause_pool_id = Clause_pool_id.t
val proof : proof
val iter_assumptions : (lit -> unit) -> unit
Traverse the new assumptions on the boolean trail.
val eval_lit : lit -> lbool
Obtain current value of the given literal
val add_lit : ?default_pol:bool -> lit -> unit
Map the given lit to an internal atom, which will be decided by the SAT solver.
val add_clause : ?keep:bool -> lit list -> proof_step -> unit
Add a clause to the solver.
  • parameter keep 
    if true, the clause will be kept by the solver. Otherwise the solver is allowed to GC the clause and propose this partial model again.
    • C_use_allocator alloc puts the clause in the given allocator.
val add_clause_in_pool : pool:clause_pool_id -> lit list -> proof_step -> unit
Like add_clause but uses a custom clause pool for the clause, with its own lifetime.
val raise_conflict : lit list -> proof_step -> 'b
Raise a conflict, yielding control back to the solver. The list of atoms must be a valid theory lemma that is false in the current trail.
val propagate : lit -> (lit, proof_step) reason -> unit
Propagate a lit, i.e. the theory can evaluate the lit to be true (see the definition of eval_res
val add_decision_lit : lit -> bool -> unit
Ask the SAT solver to decide on the given lit with given sign before it can answer SAT. The order of decisions is still unspecified. Useful for theory combination. This will be undone on backtracking.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-LIT/index.html b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-LIT/index.html
index 2602d436..55d9c3e0 100644
--- a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-LIT/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-LIT/index.html
@@ -1,2 +1,2 @@
 
-LIT (sidekick.Sidekick_sat.Solver_intf.LIT)
Module type Solver_intf.LIT
lits
type t
The type of atomic lits over terms.
val equal : t -> t -> bool
Equality over lits.
val hash : t -> int
Hashing function for lits. Should be such that two lits equal according to Expr_intf.S.equal have the same hash.
val pp : t printer
Printing function used among other thing for debugging.
val neg : t -> t
Formula negation
val norm_sign : t -> t * same_sign
Returns a 'normalized' form of the lit, possibly same_sign (in which case return false). norm must be so that a and neg a normalise to the same lit, but one returns false and the other true.

\ No newline at end of file
+LIT (sidekick.Sidekick_sat.Solver_intf.LIT)
Module type Solver_intf.LIT
lits
type t
The type of atomic lits over terms.
val equal : t -> t -> bool
Equality over lits.
val hash : t -> int
Hashing function for lits. Should be such that two lits equal according to Expr_intf.S.equal have the same hash.
val pp : t printer
Printing function used among other thing for debugging.
val neg : t -> t
Formula negation
val norm_sign : t -> t * same_sign
Returns a 'normalized' form of the lit, possibly same_sign (in which case return false). norm must be so that a and neg a normalise to the same lit, but one returns false and the other true.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_CDCL_T/Lit/index.html b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_CDCL_T/Lit/index.html
index ed52eb87..5d020d7e 100644
--- a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_CDCL_T/Lit/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_CDCL_T/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_sat.Solver_intf.PLUGIN_CDCL_T.Lit)
Module PLUGIN_CDCL_T.Lit
lits
type t = lit
The type of atomic lits over terms.
val equal : t -> t -> bool
Equality over lits.
val hash : t -> int
Hashing function for lits. Should be such that two lits equal according to Expr_intf.S.equal have the same hash.
val pp : t printer
Printing function used among other thing for debugging.
val neg : t -> t
Formula negation
val norm_sign : t -> t * same_sign
Returns a 'normalized' form of the lit, possibly same_sign (in which case return false). norm must be so that a and neg a normalise to the same lit, but one returns false and the other true.

\ No newline at end of file
+Lit (sidekick.Sidekick_sat.Solver_intf.PLUGIN_CDCL_T.Lit)
Module PLUGIN_CDCL_T.Lit
lits
type t = lit
The type of atomic lits over terms.
val equal : t -> t -> bool
Equality over lits.
val hash : t -> int
Hashing function for lits. Should be such that two lits equal according to Expr_intf.S.equal have the same hash.
val pp : t printer
Printing function used among other thing for debugging.
val neg : t -> t
Formula negation
val norm_sign : t -> t * same_sign
Returns a 'normalized' form of the lit, possibly same_sign (in which case return false). norm must be so that a and neg a normalise to the same lit, but one returns false and the other true.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_CDCL_T/Proof/Step_vec/index.html b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_CDCL_T/Proof/Step_vec/index.html
index 19d2e0d7..26c83513 100644
--- a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_CDCL_T/Proof/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_CDCL_T/Proof/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_sat.Solver_intf.PLUGIN_CDCL_T.Proof.Step_vec)
Module Proof.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_sat.Solver_intf.PLUGIN_CDCL_T.Proof.Step_vec)
Module Proof.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_CDCL_T/Proof/index.html b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_CDCL_T/Proof/index.html
index 70c3186e..e6e7c4a2 100644
--- a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_CDCL_T/Proof/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_CDCL_T/Proof/index.html
@@ -1,2 +1,2 @@
 
-Proof (sidekick.Sidekick_sat.Solver_intf.PLUGIN_CDCL_T.Proof)
Module PLUGIN_CDCL_T.Proof
type t = proof
The stored proof (possibly nil, possibly on disk, possibly in memory)
type proof_step = proof_step
identifier for a proof
A vector of steps
type lit = lit
A boolean literal for the proof trace
type proof_rule = t -> proof_step
A proof proof_rule constructor, used to obtain proofs from theories
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.

\ No newline at end of file
+Proof (sidekick.Sidekick_sat.Solver_intf.PLUGIN_CDCL_T.Proof)
Module PLUGIN_CDCL_T.Proof
type t = proof
The stored proof (possibly nil, possibly on disk, possibly in memory)
type proof_step = proof_step
identifier for a proof
A vector of steps
type lit = lit
A boolean literal for the proof trace
type proof_rule = t -> proof_step
A proof proof_rule constructor, used to obtain proofs from theories
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_CDCL_T/index.html b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_CDCL_T/index.html
index bc36f1d2..8e5eb351 100644
--- a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_CDCL_T/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_CDCL_T/index.html
@@ -1,2 +1,2 @@
 
-PLUGIN_CDCL_T (sidekick.Sidekick_sat.Solver_intf.PLUGIN_CDCL_T)
Module type Solver_intf.PLUGIN_CDCL_T
Signature for theories to be given to the CDCL(T) solver
type t
The plugin state itself
type lit
module Lit : LIT with type t = lit
lits
type proof
Proof storage/recording
type proof_step
Identifier for a clause precendently added/proved
module Proof : PROOF with type t = proof and type lit = lit and type proof_step = proof_step
val push_level : t -> unit
Create a new backtrack level
val pop_levels : t -> int -> unit
Pop n levels of the theory
val partial_check : t -> (lit, proof, proof_step) acts -> unit
Assume the lits in the slice, possibly using the slice to push new lits to be propagated or to raising a conflict or to add new lemmas.
val final_check : t -> (lit, proof, proof_step) acts -> unit
Called at the end of the search in case a model has been found. If no new clause is pushed, then proof search ends and "sat" is returned; if lemmas are added, search is resumed; if a conflict clause is added, search backtracks and then resumes.

\ No newline at end of file
+PLUGIN_CDCL_T (sidekick.Sidekick_sat.Solver_intf.PLUGIN_CDCL_T)
Module type Solver_intf.PLUGIN_CDCL_T
Signature for theories to be given to the CDCL(T) solver
type t
The plugin state itself
type lit
module Lit : LIT with type t = lit
lits
type proof
Proof storage/recording
type proof_step
Identifier for a clause precendently added/proved
module Proof : PROOF with type t = proof and type lit = lit and type proof_step = proof_step
val push_level : t -> unit
Create a new backtrack level
val pop_levels : t -> int -> unit
Pop n levels of the theory
val partial_check : t -> (lit, proof, proof_step) acts -> unit
Assume the lits in the slice, possibly using the slice to push new lits to be propagated or to raising a conflict or to add new lemmas.
val final_check : t -> (lit, proof, proof_step) acts -> unit
Called at the end of the search in case a model has been found. If no new clause is pushed, then proof search ends and "sat" is returned; if lemmas are added, search is resumed; if a conflict clause is added, search backtracks and then resumes.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_SAT/Lit/index.html b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_SAT/Lit/index.html
index 99e98b15..825a43b5 100644
--- a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_SAT/Lit/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_SAT/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_sat.Solver_intf.PLUGIN_SAT.Lit)
Module PLUGIN_SAT.Lit
lits
type t = lit
The type of atomic lits over terms.
val equal : t -> t -> bool
Equality over lits.
val hash : t -> int
Hashing function for lits. Should be such that two lits equal according to Expr_intf.S.equal have the same hash.
val pp : t printer
Printing function used among other thing for debugging.
val neg : t -> t
Formula negation
val norm_sign : t -> t * same_sign
Returns a 'normalized' form of the lit, possibly same_sign (in which case return false). norm must be so that a and neg a normalise to the same lit, but one returns false and the other true.

\ No newline at end of file
+Lit (sidekick.Sidekick_sat.Solver_intf.PLUGIN_SAT.Lit)
Module PLUGIN_SAT.Lit
lits
type t = lit
The type of atomic lits over terms.
val equal : t -> t -> bool
Equality over lits.
val hash : t -> int
Hashing function for lits. Should be such that two lits equal according to Expr_intf.S.equal have the same hash.
val pp : t printer
Printing function used among other thing for debugging.
val neg : t -> t
Formula negation
val norm_sign : t -> t * same_sign
Returns a 'normalized' form of the lit, possibly same_sign (in which case return false). norm must be so that a and neg a normalise to the same lit, but one returns false and the other true.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_SAT/Proof/Step_vec/index.html b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_SAT/Proof/Step_vec/index.html
index e663ab40..9ba2d13b 100644
--- a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_SAT/Proof/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_SAT/Proof/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_sat.Solver_intf.PLUGIN_SAT.Proof.Step_vec)
Module Proof.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_sat.Solver_intf.PLUGIN_SAT.Proof.Step_vec)
Module Proof.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_SAT/Proof/index.html b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_SAT/Proof/index.html
index 4c4d1d87..31690ca3 100644
--- a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_SAT/Proof/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_SAT/Proof/index.html
@@ -1,2 +1,2 @@
 
-Proof (sidekick.Sidekick_sat.Solver_intf.PLUGIN_SAT.Proof)
Module PLUGIN_SAT.Proof
type t = proof
The stored proof (possibly nil, possibly on disk, possibly in memory)
type proof_step = proof_step
identifier for a proof
A vector of steps
type lit = lit
A boolean literal for the proof trace
type proof_rule = t -> proof_step
A proof proof_rule constructor, used to obtain proofs from theories
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.

\ No newline at end of file
+Proof (sidekick.Sidekick_sat.Solver_intf.PLUGIN_SAT.Proof)
Module PLUGIN_SAT.Proof
type t = proof
The stored proof (possibly nil, possibly on disk, possibly in memory)
type proof_step = proof_step
identifier for a proof
A vector of steps
type lit = lit
A boolean literal for the proof trace
type proof_rule = t -> proof_step
A proof proof_rule constructor, used to obtain proofs from theories
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_SAT/index.html b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_SAT/index.html
index f4002d29..85cab03b 100644
--- a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_SAT/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-PLUGIN_SAT/index.html
@@ -1,2 +1,2 @@
 
-PLUGIN_SAT (sidekick.Sidekick_sat.Solver_intf.PLUGIN_SAT)
Module type Solver_intf.PLUGIN_SAT
Signature for pure SAT solvers
type lit
module Lit : LIT with type t = lit
lits
type proof
type proof_step
module Proof : PROOF with type t = proof and type lit = lit and type proof_step = proof_step

\ No newline at end of file
+PLUGIN_SAT (sidekick.Sidekick_sat.Solver_intf.PLUGIN_SAT)
Module type Solver_intf.PLUGIN_SAT
Signature for pure SAT solvers
type lit
module Lit : LIT with type t = lit
lits
type proof
type proof_step
module Proof : PROOF with type t = proof and type lit = lit and type proof_step = proof_step

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-S/Clause/index.html b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-S/Clause/index.html
index 34ca0406..adf36125 100644
--- a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-S/Clause/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-S/Clause/index.html
@@ -1,2 +1,2 @@
 
-Clause (sidekick.Sidekick_sat.Solver_intf.S.Clause)
Module S.Clause
type t = clause
val equal : t -> t -> bool
module Tbl : Stdlib.Hashtbl.S with type key = t
val pp : store -> t printer
Print the clause
val short_name : store -> t -> string
Short name for a clause. Unspecified
val n_atoms : store -> t -> int
val lits_iter : store -> t -> lit Iter.t
Literals of a clause
val lits_a : store -> t -> lit array
Atoms of a clause
val lits_l : store -> t -> lit list
List of atoms of a clause

\ No newline at end of file
+Clause (sidekick.Sidekick_sat.Solver_intf.S.Clause)
Module S.Clause
type t = clause
val equal : t -> t -> bool
module Tbl : Stdlib.Hashtbl.S with type key = t
val pp : store -> t printer
Print the clause
val short_name : store -> t -> string
Short name for a clause. Unspecified
val n_atoms : store -> t -> int
val lits_iter : store -> t -> lit Iter.t
Literals of a clause
val lits_a : store -> t -> lit array
Atoms of a clause
val lits_l : store -> t -> lit list
List of atoms of a clause

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-S/Lit/index.html b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-S/Lit/index.html
index a2f86c83..459e7cf1 100644
--- a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-S/Lit/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-S/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_sat.Solver_intf.S.Lit)
Module S.Lit
lits
type t = lit
The type of atomic lits over terms.
val equal : t -> t -> bool
Equality over lits.
val hash : t -> int
Hashing function for lits. Should be such that two lits equal according to Expr_intf.S.equal have the same hash.
val pp : t printer
Printing function used among other thing for debugging.
val neg : t -> t
Formula negation
val norm_sign : t -> t * same_sign
Returns a 'normalized' form of the lit, possibly same_sign (in which case return false). norm must be so that a and neg a normalise to the same lit, but one returns false and the other true.

\ No newline at end of file
+Lit (sidekick.Sidekick_sat.Solver_intf.S.Lit)
Module S.Lit
lits
type t = lit
The type of atomic lits over terms.
val equal : t -> t -> bool
Equality over lits.
val hash : t -> int
Hashing function for lits. Should be such that two lits equal according to Expr_intf.S.equal have the same hash.
val pp : t printer
Printing function used among other thing for debugging.
val neg : t -> t
Formula negation
val norm_sign : t -> t * same_sign
Returns a 'normalized' form of the lit, possibly same_sign (in which case return false). norm must be so that a and neg a normalise to the same lit, but one returns false and the other true.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-S/Proof/Step_vec/index.html b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-S/Proof/Step_vec/index.html
index 731383bc..c635eac0 100644
--- a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-S/Proof/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-S/Proof/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_sat.Solver_intf.S.Proof.Step_vec)
Module Proof.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_sat.Solver_intf.S.Proof.Step_vec)
Module Proof.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-S/Proof/index.html b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-S/Proof/index.html
index 70bc198b..9e4d9d5b 100644
--- a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-S/Proof/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-S/Proof/index.html
@@ -1,2 +1,2 @@
 
-Proof (sidekick.Sidekick_sat.Solver_intf.S.Proof)
Module S.Proof
A module to manipulate proofs.
type t = proof
The stored proof (possibly nil, possibly on disk, possibly in memory)
type proof_step
identifier for a proof
A vector of steps
type lit = lit
A boolean literal for the proof trace
type proof_rule = t -> proof_step
A proof proof_rule constructor, used to obtain proofs from theories
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.

\ No newline at end of file
+Proof (sidekick.Sidekick_sat.Solver_intf.S.Proof)
Module S.Proof
A module to manipulate proofs.
type t = proof
The stored proof (possibly nil, possibly on disk, possibly in memory)
type proof_step
identifier for a proof
A vector of steps
type lit = lit
A boolean literal for the proof trace
type proof_rule = t -> proof_step
A proof proof_rule constructor, used to obtain proofs from theories
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-S/index.html b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-S/index.html
index db5fe063..8d8bd545 100644
--- a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-S/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-S/index.html
@@ -1,4 +1,4 @@
 
-S (sidekick.Sidekick_sat.Solver_intf.S)
Module type Solver_intf.S
The external interface implemented by safe solvers, such as the one created by the Solver.Make and Mcsolver.Make functors.
Internal modules
These are the internal modules used, you should probably not use them if you're not familiar with the internals of mSAT.
type lit
literals
module Lit : LIT with type t = lit
lits
type clause
type clause_pool_id
Pool of clauses, with its own lifetime management
type theory
type proof
A representation of a full proof
type proof_step
type solver
The main solver type.
type store
Stores atoms, clauses, etc.
module Clause : sig ... end
module Proof : PROOF with type lit = lit and type t = proof
A module to manipulate proofs.
type t = solver
Main solver type, containing all state for solving.
val create : ?on_conflict:(t -> Clause.t -> unit) -> ?on_decision:(t -> lit -> unit) ->
+S (sidekick.Sidekick_sat.Solver_intf.S)
Module type Solver_intf.S
The external interface implemented by safe solvers, such as the one created by the Solver.Make and Mcsolver.Make functors.
Internal modules
These are the internal modules used, you should probably not use them if you're not familiar with the internals of mSAT.
type lit
literals
module Lit : LIT with type t = lit
lits
type clause
type clause_pool_id
Pool of clauses, with its own lifetime management
type theory
type proof
A representation of a full proof
type proof_step
type solver
The main solver type.
type store
Stores atoms, clauses, etc.
module Clause : sig ... end
module Proof : PROOF with type lit = lit and type t = proof
A module to manipulate proofs.
type t = solver
Main solver type, containing all state for solving.
val create : ?on_conflict:(t -> Clause.t -> unit) -> ?on_decision:(t -> lit -> unit) ->
 ?on_learnt:(t -> Clause.t -> unit) -> ?on_gc:(t -> lit array -> unit) -> ?stat:Sidekick_util.Stat.t ->
 ?size:[ `Tiny | `Small | `Big ] -> proof:Proof.t -> theory -> t
Create new solver
  • parameter theory 
    the theory
  • parameter the 
    proof
  • parameter size 
    the initial size of internal data structures. The bigger, the faster, but also the more RAM it uses.
val theory : t -> theory
Access the theory state
val store : t -> store
Store for the solver
val stat : t -> Sidekick_util.Stat.t
Statistics
val proof : t -> proof
Access the inner proof
Clause Pools
Clause pools.
A clause pool holds/owns a set of clauses, and is responsible for managing their lifetime. We only expose an id, not a private type.
val clause_pool_descr : t -> clause_pool_id -> string
val new_clause_pool_gc_fixed_size : descr:string -> size:int -> t -> clause_pool_id
Allocate a new clause pool that GC's its clauses when its size goes above size. It keeps half of the clauses.
Types
type res = 
| Sat of lit sat_state(*
Returned when the solver reaches SAT, with a model
*)
| Unsat of (lit, clause, proof_step) unsat_state(*
Returned when the solver reaches UNSAT, with a proof
*)
Result type for the solver
exception UndecidedLit
Exception raised by the evaluating functions when a literal has not yet been assigned a value.
Base operations
val assume : t -> lit list list -> unit
Add the list of clauses to the current set of assumptions. Modifies the sat solver state in place.
val add_clause : t -> lit list -> proof_step -> unit
Lower level addition of clauses
val add_clause_a : t -> lit array -> proof_step -> unit
Lower level addition of clauses
val add_input_clause : t -> lit list -> unit
Like add_clause but with the justification of being an input clause
val add_input_clause_a : t -> lit array -> unit
Like add_clause_a but with justification of being an input clause
val add_clause_in_pool : t -> pool:clause_pool_id -> lit list -> proof_step -> unit
Like add_clause but using a specific clause pool
val add_clause_a_in_pool : t -> pool:clause_pool_id -> lit array -> proof_step -> unit
Like add_clause_a but using a specific clause pool
val solve : ?assumptions:lit list -> t -> res
Try and solves the current set of clauses.
  • parameter assumptions 
    additional atomic assumptions to be temporarily added. The assumptions are just used for this call to solve, they are not saved in the solver's state.
val add_lit : t -> ?default_pol:bool -> lit -> unit
Ensure the SAT solver handles this particular literal, ie add a boolean variable for it if it's not already there.
val set_default_pol : t -> lit -> bool -> unit
Set default polarity for the given boolean variable. Sign of the literal is ignored.
val true_at_level0 : t -> lit -> bool
true_at_level0 a returns true if a was proved at level0, i.e. it must hold in all models
val eval_lit : t -> lit -> lbool
Evaluate atom in current state

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-SAT_STATE/index.html b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-SAT_STATE/index.html
index d68bdcec..11d434d0 100644
--- a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-SAT_STATE/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-SAT_STATE/index.html
@@ -1,2 +1,2 @@
 
-SAT_STATE (sidekick.Sidekick_sat.Solver_intf.SAT_STATE)
Module type Solver_intf.SAT_STATE
type lit
Literals (signed boolean atoms)
val eval : lit -> bool
Returns the valuation of a lit in the current state of the sat solver.
  • raises UndecidedLit 
    if the literal is not decided
val eval_level : lit -> bool * int
Return the current assignement of the literals, as well as its decision level. If the level is 0, then it is necessary for the literal to have this value; otherwise it is due to choices that can potentially be backtracked.
  • raises UndecidedLit 
    if the literal is not decided
val iter_trail : (lit -> unit) -> unit
Iter through the lits in order of decision/propagation (starting from the first propagation, to the last propagation).

\ No newline at end of file
+SAT_STATE (sidekick.Sidekick_sat.Solver_intf.SAT_STATE)
Module type Solver_intf.SAT_STATE
type lit
Literals (signed boolean atoms)
val eval : lit -> bool
Returns the valuation of a lit in the current state of the sat solver.
  • raises UndecidedLit 
    if the literal is not decided
val eval_level : lit -> bool * int
Return the current assignement of the literals, as well as its decision level. If the level is 0, then it is necessary for the literal to have this value; otherwise it is due to choices that can potentially be backtracked.
  • raises UndecidedLit 
    if the literal is not decided
val iter_trail : (lit -> unit) -> unit
Iter through the lits in order of decision/propagation (starting from the first propagation, to the last propagation).

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-UNSAT_STATE/index.html b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-UNSAT_STATE/index.html
index 416fd757..70108095 100644
--- a/dev/sidekick/Sidekick_sat/Solver_intf/module-type-UNSAT_STATE/index.html
+++ b/dev/sidekick/Sidekick_sat/Solver_intf/module-type-UNSAT_STATE/index.html
@@ -1,2 +1,2 @@
 
-UNSAT_STATE (sidekick.Sidekick_sat.Solver_intf.UNSAT_STATE)
Module type Solver_intf.UNSAT_STATE
type lit
type clause
type proof
val unsat_conflict : unit -> clause
Returns the unsat clause found at the toplevel
val unsat_assumptions : unit -> lit Iter.t
Subset of assumptions responsible for "unsat"
val unsat_proof : unit -> proof

\ No newline at end of file
+UNSAT_STATE (sidekick.Sidekick_sat.Solver_intf.UNSAT_STATE)
Module type Solver_intf.UNSAT_STATE
type lit
type clause
type proof
val unsat_conflict : unit -> clause
Returns the unsat clause found at the toplevel
val unsat_assumptions : unit -> lit Iter.t
Subset of assumptions responsible for "unsat"
val unsat_proof : unit -> proof

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat/index.html b/dev/sidekick/Sidekick_sat/index.html
index 35d597bd..9e860f58 100644
--- a/dev/sidekick/Sidekick_sat/index.html
+++ b/dev/sidekick/Sidekick_sat/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_sat (sidekick.Sidekick_sat)
Module Sidekick_sat
Main API
module Solver_intf : sig ... end
Interface for Solvers
module type S = Solver_intf.S
module type LIT = Solver_intf.LIT
module type PLUGIN_CDCL_T = Solver_intf.PLUGIN_CDCL_T
module type PROOF = Solver_intf.PROOF
type lbool = Solver_intf.lbool = 
| L_true
| L_false
| L_undefined
module type SAT_STATE = Solver_intf.SAT_STATE
type 'form sat_state = 'form Solver_intf.sat_state
type ('lit, 'proof) reason = ('lit, 'proof) Solver_intf.reason = 
| Consequence of unit -> 'lit list * 'proof
module type ACTS = Solver_intf.ACTS
type ('lit, 'proof, 'proof_step) acts = ('lit, 'proof, 'proof_step) Solver_intf.acts
type negated = bool
val pp_lbool : Stdlib.Format.formatter -> lbool -> unit
Print lbool values
exception No_proof
module Solver : sig ... end
module Make_cdcl_t = Solver.Make_cdcl_t
module Make_pure_sat = Solver.Make_pure_sat

\ No newline at end of file
+Sidekick_sat (sidekick.Sidekick_sat)
Module Sidekick_sat
Main API
module Solver_intf : sig ... end
Interface for Solvers
module type S = Solver_intf.S
module type LIT = Solver_intf.LIT
module type PLUGIN_CDCL_T = Solver_intf.PLUGIN_CDCL_T
module type PROOF = Solver_intf.PROOF
type lbool = Solver_intf.lbool = 
| L_true
| L_false
| L_undefined
module type SAT_STATE = Solver_intf.SAT_STATE
type 'form sat_state = 'form Solver_intf.sat_state
type ('lit, 'proof) reason = ('lit, 'proof) Solver_intf.reason = 
| Consequence of unit -> 'lit list * 'proof
module type ACTS = Solver_intf.ACTS
type ('lit, 'proof, 'proof_step) acts = ('lit, 'proof, 'proof_step) Solver_intf.acts
type negated = bool
val pp_lbool : Stdlib.Format.formatter -> lbool -> unit
Print lbool values
exception No_proof
module Solver : sig ... end
module Make_cdcl_t = Solver.Make_cdcl_t
module Make_pure_sat = Solver.Make_pure_sat

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat__/index.html b/dev/sidekick/Sidekick_sat__/index.html
index 1fcbad66..a860e63c 100644
--- a/dev/sidekick/Sidekick_sat__/index.html
+++ b/dev/sidekick/Sidekick_sat__/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_sat__ (sidekick.Sidekick_sat__)
Module Sidekick_sat__

\ No newline at end of file
+Sidekick_sat__ (sidekick.Sidekick_sat__)
Module Sidekick_sat__

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat__Heap/index.html b/dev/sidekick/Sidekick_sat__Heap/index.html
index 9a74ee90..2bf3c0fc 100644
--- a/dev/sidekick/Sidekick_sat__Heap/index.html
+++ b/dev/sidekick/Sidekick_sat__Heap/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_sat__Heap (sidekick.Sidekick_sat__Heap)
Module Sidekick_sat__Heap

\ No newline at end of file
+Sidekick_sat__Heap (sidekick.Sidekick_sat__Heap)
Module Sidekick_sat__Heap

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat__Heap_intf/index.html b/dev/sidekick/Sidekick_sat__Heap_intf/index.html
index 18fcaee2..740940e7 100644
--- a/dev/sidekick/Sidekick_sat__Heap_intf/index.html
+++ b/dev/sidekick/Sidekick_sat__Heap_intf/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_sat__Heap_intf (sidekick.Sidekick_sat__Heap_intf)
Module Sidekick_sat__Heap_intf

\ No newline at end of file
+Sidekick_sat__Heap_intf (sidekick.Sidekick_sat__Heap_intf)
Module Sidekick_sat__Heap_intf

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat__Solver/index.html b/dev/sidekick/Sidekick_sat__Solver/index.html
index d053cd63..e78871af 100644
--- a/dev/sidekick/Sidekick_sat__Solver/index.html
+++ b/dev/sidekick/Sidekick_sat__Solver/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_sat__Solver (sidekick.Sidekick_sat__Solver)
Module Sidekick_sat__Solver

\ No newline at end of file
+Sidekick_sat__Solver (sidekick.Sidekick_sat__Solver)
Module Sidekick_sat__Solver

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sat__Solver_intf/index.html b/dev/sidekick/Sidekick_sat__Solver_intf/index.html
index 0b8be942..f03fc841 100644
--- a/dev/sidekick/Sidekick_sat__Solver_intf/index.html
+++ b/dev/sidekick/Sidekick_sat__Solver_intf/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_sat__Solver_intf (sidekick.Sidekick_sat__Solver_intf)
Module Sidekick_sat__Solver_intf

\ No newline at end of file
+Sidekick_sat__Solver_intf (sidekick.Sidekick_sat__Solver_intf)
Module Sidekick_sat__Solver_intf

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sigs/index.html b/dev/sidekick/Sidekick_sigs/index.html
index f6f4d45a..cd985230 100644
--- a/dev/sidekick/Sidekick_sigs/index.html
+++ b/dev/sidekick/Sidekick_sigs/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_sigs (sidekick.Sidekick_sigs)
Module Sidekick_sigs
module type EQ = sig ... end
module type ORD = sig ... end
module type HASH = sig ... end
module type PRINT = sig ... end
type 'a printer = Stdlib.Format.formatter -> 'a -> unit

\ No newline at end of file
+Sidekick_sigs (sidekick.Sidekick_sigs)
Module Sidekick_sigs
module type EQ = sig ... end
module type ORD = sig ... end
module type HASH = sig ... end
module type PRINT = sig ... end
type 'a printer = Stdlib.Format.formatter -> 'a -> unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sigs/module-type-EQ/index.html b/dev/sidekick/Sidekick_sigs/module-type-EQ/index.html
index 0f729a95..8e18dff4 100644
--- a/dev/sidekick/Sidekick_sigs/module-type-EQ/index.html
+++ b/dev/sidekick/Sidekick_sigs/module-type-EQ/index.html
@@ -1,2 +1,2 @@
 
-EQ (sidekick.Sidekick_sigs.EQ)
Module type Sidekick_sigs.EQ
type t
val equal : t -> t -> bool

\ No newline at end of file
+EQ (sidekick.Sidekick_sigs.EQ)
Module type Sidekick_sigs.EQ
type t
val equal : t -> t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sigs/module-type-HASH/index.html b/dev/sidekick/Sidekick_sigs/module-type-HASH/index.html
index 017ee4f4..33098612 100644
--- a/dev/sidekick/Sidekick_sigs/module-type-HASH/index.html
+++ b/dev/sidekick/Sidekick_sigs/module-type-HASH/index.html
@@ -1,2 +1,2 @@
 
-HASH (sidekick.Sidekick_sigs.HASH)
Module type Sidekick_sigs.HASH
type t
val hash : t -> int

\ No newline at end of file
+HASH (sidekick.Sidekick_sigs.HASH)
Module type Sidekick_sigs.HASH
type t
val hash : t -> int

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sigs/module-type-ORD/index.html b/dev/sidekick/Sidekick_sigs/module-type-ORD/index.html
index bd8f2f41..5beb334f 100644
--- a/dev/sidekick/Sidekick_sigs/module-type-ORD/index.html
+++ b/dev/sidekick/Sidekick_sigs/module-type-ORD/index.html
@@ -1,2 +1,2 @@
 
-ORD (sidekick.Sidekick_sigs.ORD)
Module type Sidekick_sigs.ORD
type t
val compare : t -> t -> int

\ No newline at end of file
+ORD (sidekick.Sidekick_sigs.ORD)
Module type Sidekick_sigs.ORD
type t
val compare : t -> t -> int

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_sigs/module-type-PRINT/index.html b/dev/sidekick/Sidekick_sigs/module-type-PRINT/index.html
index a4126f23..54fec14e 100644
--- a/dev/sidekick/Sidekick_sigs/module-type-PRINT/index.html
+++ b/dev/sidekick/Sidekick_sigs/module-type-PRINT/index.html
@@ -1,2 +1,2 @@
 
-PRINT (sidekick.Sidekick_sigs.PRINT)
Module type Sidekick_sigs.PRINT
type t
val pp : t CCFormat.printer

\ No newline at end of file
+PRINT (sidekick.Sidekick_sigs.PRINT)
Module type Sidekick_sigs.PRINT
type t
val pp : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/Make/Model/index.html b/dev/sidekick/Sidekick_smt_solver/Make/Model/index.html
index 6d558be3..38b6024e 100644
--- a/dev/sidekick/Sidekick_smt_solver/Make/Model/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/Make/Model/index.html
@@ -1,2 +1,2 @@
 
-Model (sidekick.Sidekick_smt_solver.Make.Model)
Module Make.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Model (sidekick.Sidekick_smt_solver.Make.Model)
Module Make.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/Actions/P/index.html b/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/Actions/P/index.html
index f074d4e8..2898d33e 100644
--- a/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/Actions/P/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_smt_solver.Make.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_smt_solver.Make.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/Actions/index.html b/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/Actions/index.html
index 23363015..2a369f8e 100644
--- a/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/Actions/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick.Sidekick_smt_solver.Make.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
+Actions (sidekick.Sidekick_smt_solver.Make.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/Expl/index.html b/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/Expl/index.html
index f677d88c..30f5f9a8 100644
--- a/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/Expl/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick.Sidekick_smt_solver.Make.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick.Sidekick_smt_solver.Make.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/N/index.html b/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/N/index.html
index b6229fc9..17ee32b4 100644
--- a/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/N/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick.Sidekick_smt_solver.Make.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
+N (sidekick.Sidekick_smt_solver.Make.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/P/index.html b/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/P/index.html
index bca55212..a8674e95 100644
--- a/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/P/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_smt_solver.Make.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_smt_solver.Make.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/index.html b/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/index.html
index 7b357e4a..cfb5f900 100644
--- a/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/CC/index.html
@@ -1,4 +1,4 @@
 
-CC (sidekick.Sidekick_smt_solver.Make.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+CC (sidekick.Sidekick_smt_solver.Make.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Small | `Big ] -> term_store -> proof -> t
Create a new congruence closure.
  • parameter term_store 
    used to be able to create new terms. All terms interacting with this congruence closure must belong in this term state as well.
val allocate_bitfield : descr:string -> t -> N.bitfield
Allocate a new node field (see N.bitfield).
This field descriptor is henceforth reserved for all nodes in this congruence closure, and can be set using set_bitfield for each node individually. This can be used to efficiently store some metadata on nodes (e.g. "is there a numeric value in the class" or "is there a constructor term in the class").
There may be restrictions on how many distinct fields are allocated for a given congruence closure (e.g. at most Sys.int_size fields).
val get_bitfield : t -> N.bitfield -> N.t -> bool
Access the bit field of the given node
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
Set the bitfield for the node. This will be backtracked. See N.bitfield.
val on_pre_merge : t -> ev_on_pre_merge -> unit
Add a function to be called when two classes are merged
val on_post_merge : t -> ev_on_post_merge -> unit
Add a function to be called when two classes are merged
val on_new_term : t -> ev_on_new_term -> unit
Add a function to be called when a new node is created
val on_conflict : t -> ev_on_conflict -> unit
Called when the congruence closure finds a conflict
val on_propagate : t -> ev_on_propagate -> unit
Called when the congruence closure propagates a literal
val on_is_subterm : t -> ev_on_is_subterm -> unit
Called on terms that are subterms of function symbols
val set_as_lit : t -> N.t -> lit -> unit
map the given node to a literal.
val find_t : t -> term -> repr
Current representative of the term.
  • raises Not_found 
    if the term is not already add-ed.
val add_seq : t -> term Iter.t -> unit
Add a sequence of terms to the congruence closure
val all_classes : t -> repr Iter.t
All current classes. This is costly, only use if there is no other solution
val assert_lit : t -> lit -> unit
Given a literal, assume it in the congruence closure and propagate its consequences. Will be backtracked.
Useful for the theory combination or the SAT solver's functor
val assert_lits : t -> lit Iter.t -> unit
Addition of many literals
val explain_eq : t -> N.t -> N.t -> lit list
Explain why the two nodes are equal. Fails if they are not, in an unspecified way
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
Raise a conflict with the given explanation it must be a theory tautology that expl ==> absurd. To be used in theories.
val n_true : t -> N.t
Node for true
val n_false : t -> N.t
Node for false
val n_bool : t -> bool -> N.t
Node for either true or false
val merge : t -> N.t -> N.t -> Expl.t -> unit
Merge these two nodes given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val merge_t : t -> term -> term -> Expl.t -> unit
Shortcut for adding + merging
val check : t -> actions -> unit
Perform all pending operations done via assert_eq, assert_lit, etc. Will use the actions to propagate literals, declare conflicts, etc.
val new_merges : t -> bool
Called after check, returns true if some pairs of classes were merged.
val push_level : t -> unit
Push backtracking level
val pop_levels : t -> int -> unit
Restore to state n calls to push_level earlier. Used during backtracking.
val get_model : t -> N.t Iter.t Iter.t
get all the equivalence classes so they can be merged in the model

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/Simplify/index.html b/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/Simplify/index.html
index 68414675..9d706ed4 100644
--- a/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/Simplify/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/Simplify/index.html
@@ -1,2 +1,2 @@
 
-Simplify (sidekick.Sidekick_smt_solver.Make.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
+Simplify (sidekick.Sidekick_smt_solver.Make.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/index.html b/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/index.html
index 0390e3e0..a7b3f6be 100644
--- a/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/index.html
@@ -1,3 +1,3 @@
 
-Solver_internal (sidekick.Sidekick_smt_solver.Make.Solver_internal)
Module Make.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
+Solver_internal (sidekick.Sidekick_smt_solver.Make.Solver_internal)
Module Make.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
 P.t = proof and type P.lit = lit and type Actions.t = theory_actions
Congruence closure instance
val cc : t -> CC.t
Congruence closure for this solver
Simplifiers
module Simplify : sig ... end
Simplify terms
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
Add a simplifier hook for preprocessing.
val simplify_t : t -> term -> (term * proof_step) option
Simplify input term, returns Some u if some simplification occurred.
val simp_t : t -> term -> term * proof_step option
simp_t si t returns u even if no simplification occurred (in which case t == u syntactically). It emits |- t=u. (see simplifier)
Preprocessors
These preprocessors turn mixed, raw literals (possibly simplified) into literals suitable for reasoning. Typically some clauses are also added to the solver.
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
Actions available to the preprocessor
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
Given a term, try to preprocess it. Return None if it didn't change, or Some (u) if t=u. Can also add clauses to define new terms.
Preprocessing might transform terms to make them more amenable to reasoning, e.g. by removing boolean formulas via Tseitin encoding, adding clauses that encode their meaning in the same move.
  • parameter preprocess_actions 
    actions available during preprocessing.
val on_preprocess : t -> preprocess_hook -> unit
Add a hook that will be called when terms are preprocessed
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
Obtain preprocessor actions, from theory actions
hooks for the theory
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
Give a conflict clause to the solver
val push_decision : t -> theory_actions -> lit -> unit
Ask the SAT solver to decide the given literal in an extension of the current trail. This is useful for theory combination. If the SAT solver backtracks, this (potential) decision is removed and forgotten.
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
Add local clause to the SAT solver. This clause will be removed when the solver backtracks.
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
Add toplevel clause to the SAT solver. This clause will not be backtracked.
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
Create a literal. This automatically preprocesses the term.
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
Preprocess a term.
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
Add the given literal to the SAT solver, so it gets assigned a boolean value.
  • parameter default_pol 
    default polarity for the corresponding atom
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
Add the given (signed) bool term to the SAT solver, so it gets assigned a boolean value
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
Raise a conflict with the given congruence closure explanation. it must be a theory tautology that expl ==> absurd. To be used in theories.
val cc_find : t -> CC.N.t -> CC.N.t
Find representative of the node
val cc_are_equal : t -> term -> term -> bool
Are these two terms equal in the congruence closure?
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
Merge these two nodes in the congruence closure, given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
Merge these two terms in the congruence closure, given this explanation. See cc_merge
val cc_add_term : t -> term -> CC.N.t
Add/retrieve congruence closure node for this term. To be used in theories
val cc_mem_term : t -> term -> bool
Return true if the term is explicitly in the congruence closure. To be used in theories
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called before)
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called after)
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
Callback to add data on terms when they are added to the congruence closure
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
Callback for when a term is a subterm of another term in the congruence closure
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
Callback called on every CC conflict
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
Callback called on every CC propagation
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callbacked to be called with the slice of literals newly added on the trail.
This is called very often and should be efficient. It doesn't have to be complete, only correct. It's given only the slice of the trail consisting in new literals.
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callback to be called during the final check.
Must be complete (i.e. must raise a conflict if the set of literals is not satisfiable) and can be expensive. The function is given the whole trail.
Model production
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
A model-production hook. It takes the solver, a class, and returns a term for this class. For example, an arithmetic theory might detect that a class contains a numeric constant, and return this constant as a model value.
If no hook assigns a value to a class, a fake value is created for it.
val on_model_gen : t -> model_hook -> unit
Add a hook that will be called when a model is being produced

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/module-type-PREPROCESS_ACTS/index.html b/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/module-type-PREPROCESS_ACTS/index.html
index 4aa26030..42253bcf 100644
--- a/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/module-type-PREPROCESS_ACTS/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/Make/Solver_internal/module-type-PREPROCESS_ACTS/index.html
@@ -1,2 +1,2 @@
 
-PREPROCESS_ACTS (sidekick.Sidekick_smt_solver.Make.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
+PREPROCESS_ACTS (sidekick.Sidekick_smt_solver.Make.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/Make/Unknown/index.html b/dev/sidekick/Sidekick_smt_solver/Make/Unknown/index.html
index 84ed5625..af516b6b 100644
--- a/dev/sidekick/Sidekick_smt_solver/Make/Unknown/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/Make/Unknown/index.html
@@ -1,2 +1,2 @@
 
-Unknown (sidekick.Sidekick_smt_solver.Make.Unknown)
Module Make.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
+Unknown (sidekick.Sidekick_smt_solver.Make.Unknown)
Module Make.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/Lit/index.html b/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/Lit/index.html
index 1654ff08..8dd83adc 100644
--- a/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/Lit/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_smt_solver.Make.1-A.Lit)
Module 1-A.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick.Sidekick_smt_solver.Make.1-A.Lit)
Module 1-A.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/P/Step_vec/index.html b/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/P/Step_vec/index.html
index fd170938..1ce22cce 100644
--- a/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/P/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_smt_solver.Make.1-A.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_smt_solver.Make.1-A.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/P/index.html b/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/P/index.html
index a97ed6aa..da9ad66b 100644
--- a/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/P/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_smt_solver.Make.1-A.P)
Module 1-A.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
+P (sidekick.Sidekick_smt_solver.Make.1-A.P)
Module 1-A.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/T/Fun/index.html b/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/T/Fun/index.html
index cf7ac310..c99990e9 100644
--- a/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_smt_solver.Make.1-A.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_smt_solver.Make.1-A.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/T/Term/index.html b/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/T/Term/index.html
index 6fcacc81..522bd60f 100644
--- a/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/T/Term/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_smt_solver.Make.1-A.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_smt_solver.Make.1-A.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/T/Ty/index.html b/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/T/Ty/index.html
index 38b53255..402b661f 100644
--- a/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_smt_solver.Make.1-A.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_smt_solver.Make.1-A.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/T/index.html b/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/T/index.html
index 4ceb1470..c5fdf584 100644
--- a/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/T/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_smt_solver.Make.1-A.T)
Module 1-A.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_smt_solver.Make.1-A.T)
Module 1-A.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/index.html b/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/index.html
index f27403dc..3458539c 100644
--- a/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/Make/argument-1-A/index.html
@@ -1,2 +1,2 @@
 
-A (sidekick.Sidekick_smt_solver.Make.1-A)
Parameter Make.1-A
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type term = T.Term.t and type t = proof and type proof_step = proof_step and type lit = Lit.t
val is_valid_literal : T.Term.t -> bool
Is this a valid boolean literal? (e.g. is it a closed term, not inside a quantifier)

\ No newline at end of file
+A (sidekick.Sidekick_smt_solver.Make.1-A)
Parameter Make.1-A
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type term = T.Term.t and type t = proof and type proof_step = proof_step and type lit = Lit.t
val is_valid_literal : T.Term.t -> bool
Is this a valid boolean literal? (e.g. is it a closed term, not inside a quantifier)

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/Make/index.html b/dev/sidekick/Sidekick_smt_solver/Make/index.html
index d6ddc6fe..76dc931d 100644
--- a/dev/sidekick/Sidekick_smt_solver/Make/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/Make/index.html
@@ -1,5 +1,5 @@
 
-Make (sidekick.Sidekick_smt_solver.Make)
Module Sidekick_smt_solver.Make
Main functor to get a solver.
Parameters
module A : ARG
Signature
module T = A.T
module Lit = A.Lit
type proof = A.proof
type proof_step = A.proof_step
module P = A.P
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
+Make (sidekick.Sidekick_smt_solver.Make)
Module Sidekick_smt_solver.Make
Main functor to get a solver.
Parameters
module A : ARG
Signature
module T = A.T
module Lit = A.Lit
type proof = A.proof
type proof_step = A.proof_step
module P = A.P
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
 ?push_level:('th -> unit) -> ?pop_levels:('th -> int -> unit) -> unit -> theory
Helper to create a theory.
module Model : sig ... end
Models
module Unknown : sig ... end
Main API
val stats : t -> Sidekick_util.Stat.t
val tst : t -> T.Term.store
val ty_st : t -> T.Ty.store
val proof : t -> proof
val create : ?stat:Sidekick_util.Stat.t -> ?size:[ `Big | `Tiny | `Small ] -> proof:proof -> theories:theory list ->
 T.Term.store -> T.Ty.store -> unit -> t
Create a new solver.
It needs a term state and a type state to manipulate terms and types. All terms and types interacting with this solver will need to come from these exact states.
  • parameter store_proof 
    if true, proofs from the SAT solver and theories are retained and potentially accessible after solve returns UNSAT.
  • parameter size 
    influences the size of initial allocations.
  • parameter theories 
    theories to load from the start. Other theories can be added using add_theory.
val add_theory : t -> theory -> unit
Add a theory to the solver. This should be called before any call to solve or to add_clause and the likes (otherwise the theory will have a partial view of the problem).
val add_theory_p : t -> 'a theory_p -> 'a
Add the given theory and obtain its state
val add_theory_l : t -> theory list -> unit
val mk_lit_t : t -> ?sign:bool -> term -> lit
mk_lit_t _ ~sign t returns lit', where lit' is preprocess(lit) and lit is an internal representation of ± t.
The proof of |- lit = lit' is directly added to the solver's proof.
val add_clause : t -> lit Sidekick_util.IArray.t -> proof_step -> unit
add_clause solver cs adds a boolean clause to the solver. Subsequent calls to solve will need to satisfy this clause.
val add_clause_l : t -> lit list -> proof_step -> unit
Add a clause to the solver, given as a list.
val assert_terms : t -> term list -> unit
Helper that turns each term into an atom, before adding the result to the solver as an assertion
val assert_term : t -> term -> unit
Helper that turns the term into an atom, before adding the result to the solver as a unit clause assertion
type res = 
| Sat of Model.t(*
Satisfiable
*)
| Unsat of {
unsat_core : unit -> lit Iter.t;(*
Unsat core (subset of assumptions), or empty
*)
unsat_proof_step : unit -> proof_step option;(*
Proof step for the empty clause
*)
}		(*
Unsatisfiable
*)
| Unknown of Unknown.t(*
Unknown, obtained after a timeout, memory limit, etc.
*)
Result of solving for the current set of clauses
val solve : ?on_exit:(unit -> unit) list -> ?check:bool -> ?on_progress:(t -> unit) ->
 assumptions:lit list -> t -> res
solve s checks the satisfiability of the clauses added so far to s.
  • parameter check 
    if true, the model is checked before returning.
  • parameter on_progress 
    called regularly during solving.
  • parameter assumptions 
    a set of atoms held to be true. The unsat core, if any, will be a subset of assumptions.
  • parameter on_exit 
    functions to be run before this returns
val pp_stats : t CCFormat.printer
Print some statistics. What it prints exactly is unspecified.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/Make/module-type-THEORY/index.html b/dev/sidekick/Sidekick_smt_solver/Make/module-type-THEORY/index.html
index 3bd65a08..4f6286a4 100644
--- a/dev/sidekick/Sidekick_smt_solver/Make/module-type-THEORY/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/Make/module-type-THEORY/index.html
@@ -1,2 +1,2 @@
 
-THEORY (sidekick.Sidekick_smt_solver.Make.THEORY)
Module type Make.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
+THEORY (sidekick.Sidekick_smt_solver.Make.THEORY)
Module type Make.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/index.html b/dev/sidekick/Sidekick_smt_solver/index.html
index c7e18c9a..fc81b064 100644
--- a/dev/sidekick/Sidekick_smt_solver/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/index.html
@@ -1,3 +1,3 @@
 
-Sidekick_smt_solver (sidekick.Sidekick_smt_solver)
Module Sidekick_smt_solver
Core of the SMT solver using Sidekick_sat
Sidekick_sat (in src/sat/) is a modular SAT solver in pure OCaml.
This builds a Sidekick_core.SOLVER on top of it.
module type ARG = sig ... end
Argument to pass to the functor Make in order to create a new Msat-based SMT solver.
module type S = Sidekick_core.SOLVER
module Make (A : ARG) : S with module T = A.T and type proof = A.proof and type proof_step = A.proof_step and module Lit = A.Lit and module
+Sidekick_smt_solver (sidekick.Sidekick_smt_solver)
Module Sidekick_smt_solver
Core of the SMT solver using Sidekick_sat
Sidekick_sat (in src/sat/) is a modular SAT solver in pure OCaml.
This builds a Sidekick_core.SOLVER on top of it.
module type ARG = sig ... end
Argument to pass to the functor Make in order to create a new Msat-based SMT solver.
module type S = Sidekick_core.SOLVER
module Make (A : ARG) : S with module T = A.T and type proof = A.proof and type proof_step = A.proof_step and module Lit = A.Lit and module
 P = A.P
Main functor to get a solver.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/module-type-ARG/Lit/index.html b/dev/sidekick/Sidekick_smt_solver/module-type-ARG/Lit/index.html
index ef91de5d..f5934d42 100644
--- a/dev/sidekick/Sidekick_smt_solver/module-type-ARG/Lit/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/module-type-ARG/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_smt_solver.ARG.Lit)
Module ARG.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick.Sidekick_smt_solver.ARG.Lit)
Module ARG.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/module-type-ARG/P/Step_vec/index.html b/dev/sidekick/Sidekick_smt_solver/module-type-ARG/P/Step_vec/index.html
index 6d91751f..193442ea 100644
--- a/dev/sidekick/Sidekick_smt_solver/module-type-ARG/P/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/module-type-ARG/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_smt_solver.ARG.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_smt_solver.ARG.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/module-type-ARG/P/index.html b/dev/sidekick/Sidekick_smt_solver/module-type-ARG/P/index.html
index c47b42da..721f9226 100644
--- a/dev/sidekick/Sidekick_smt_solver/module-type-ARG/P/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/module-type-ARG/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_smt_solver.ARG.P)
Module ARG.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
+P (sidekick.Sidekick_smt_solver.ARG.P)
Module ARG.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/module-type-ARG/T/Fun/index.html b/dev/sidekick/Sidekick_smt_solver/module-type-ARG/T/Fun/index.html
index c8762676..5ed35c7e 100644
--- a/dev/sidekick/Sidekick_smt_solver/module-type-ARG/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/module-type-ARG/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_smt_solver.ARG.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_smt_solver.ARG.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/module-type-ARG/T/Term/index.html b/dev/sidekick/Sidekick_smt_solver/module-type-ARG/T/Term/index.html
index b7516c8e..f5fb7661 100644
--- a/dev/sidekick/Sidekick_smt_solver/module-type-ARG/T/Term/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/module-type-ARG/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_smt_solver.ARG.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_smt_solver.ARG.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_smt_solver/module-type-ARG/T/Ty/index.html b/dev/sidekick/Sidekick_smt_solver/module-type-ARG/T/Ty/index.html
index b9565bd6..e6513c5e 100644
--- a/dev/sidekick/Sidekick_smt_solver/module-type-ARG/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/module-type-ARG/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_smt_solver.ARG.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_smt_solver.ARG.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/module-type-ARG/T/index.html b/dev/sidekick/Sidekick_smt_solver/module-type-ARG/T/index.html
index c5750683..67bd7783 100644
--- a/dev/sidekick/Sidekick_smt_solver/module-type-ARG/T/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/module-type-ARG/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_smt_solver.ARG.T)
Module ARG.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_smt_solver.ARG.T)
Module ARG.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_smt_solver/module-type-ARG/index.html b/dev/sidekick/Sidekick_smt_solver/module-type-ARG/index.html
index db3c26fc..b3d6abc1 100644
--- a/dev/sidekick/Sidekick_smt_solver/module-type-ARG/index.html
+++ b/dev/sidekick/Sidekick_smt_solver/module-type-ARG/index.html
@@ -1,2 +1,2 @@
 
-ARG (sidekick.Sidekick_smt_solver.ARG)
Module type Sidekick_smt_solver.ARG
Argument to pass to the functor Make in order to create a new Msat-based SMT solver.
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type term = T.Term.t and type t = proof and type proof_step = proof_step and type lit = Lit.t
val is_valid_literal : T.Term.t -> bool
Is this a valid boolean literal? (e.g. is it a closed term, not inside a quantifier)

\ No newline at end of file
+ARG (sidekick.Sidekick_smt_solver.ARG)
Module type Sidekick_smt_solver.ARG
Argument to pass to the functor Make in order to create a new Msat-based SMT solver.
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type term = T.Term.t and type t = proof and type proof_step = proof_step and type lit = Lit.t
val is_valid_literal : T.Term.t -> bool
Is this a valid boolean literal? (e.g. is it a closed term, not inside a quantifier)

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_tef/index.html b/dev/sidekick/Sidekick_tef/index.html
index e2182d02..0b324a86 100644
--- a/dev/sidekick/Sidekick_tef/index.html
+++ b/dev/sidekick/Sidekick_tef/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_tef (sidekick.Sidekick_tef)
Module Sidekick_tef
Tracing Event Format
A nice profiling format based on json, useful for visualizing what goes on. It provides a backend for Sidekick_util.Profile so that profiling probes will emit TEF events.
Profiling is enabled if setup is called, and if the environment variable "TEF" is set to "1" or "true". The trace is emitted in the file "trace.json.gz" in the directory where the solver is launched; you can open it in chrome/chromium at "chrome://tracing".
Tracy can import (uncompressed) trace files with a nice native trace explorer.
See the documentation of TEF
val setup : unit -> unit
Install the TEF logger as a profiling backend.
val teardown : unit -> unit

\ No newline at end of file
+Sidekick_tef (sidekick.Sidekick_tef)
Module Sidekick_tef
Tracing Event Format
A nice profiling format based on json, useful for visualizing what goes on. It provides a backend for Sidekick_util.Profile so that profiling probes will emit TEF events.
Profiling is enabled if setup is called, and if the environment variable "TEF" is set to "1" or "true". The trace is emitted in the file "trace.json.gz" in the directory where the solver is launched; you can open it in chrome/chromium at "chrome://tracing".
Tracy can import (uncompressed) trace files with a nice native trace explorer.
See the documentation of TEF
val setup : unit -> unit
Install the TEF logger as a profiling backend.
val teardown : unit -> unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/Gensym/index.html b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/Gensym/index.html
index a9145204..72168b3d 100644
--- a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/Gensym/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/Gensym/index.html
@@ -1,2 +1,2 @@
 
-Gensym (sidekick.Sidekick_th_bool_static.Make.1-A.Gensym)
Module 1-A.Gensym
Fresh symbol generator.
The theory needs to be able to create new terms with fresh names, to be used as placeholders for complex formulas during Tseitin encoding.
type t
val create : S.T.Term.store -> t
New (stateful) generator instance.
val fresh_term : t -> pre:string -> S.T.Ty.t -> term
Make a fresh term of the given type

\ No newline at end of file
+Gensym (sidekick.Sidekick_th_bool_static.Make.1-A.Gensym)
Module 1-A.Gensym
Fresh symbol generator.
The theory needs to be able to create new terms with fresh names, to be used as placeholders for complex formulas during Tseitin encoding.
type t
val create : S.T.Term.store -> t
New (stateful) generator instance.
val fresh_term : t -> pre:string -> S.T.Ty.t -> term
Make a fresh term of the given type

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Lit/index.html b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Lit/index.html
index 86be4619..e8075d27 100644
--- a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Lit/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_th_bool_static.Make.1-A.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick.Sidekick_th_bool_static.Make.1-A.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Model/index.html b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Model/index.html
index 8fbe0c32..421729f2 100644
--- a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Model/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Model/index.html
@@ -1,2 +1,2 @@
 
-Model (sidekick.Sidekick_th_bool_static.Make.1-A.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Model (sidekick.Sidekick_th_bool_static.Make.1-A.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/P/Step_vec/index.html b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/P/Step_vec/index.html
index 8f295be3..80e24742 100644
--- a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/P/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_th_bool_static.Make.1-A.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_th_bool_static.Make.1-A.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/P/index.html b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/P/index.html
index f1db46b2..a4b14b2d 100644
--- a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/P/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_bool_static.Make.1-A.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
+P (sidekick.Sidekick_th_bool_static.Make.1-A.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/Actions/P/index.html b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/Actions/P/index.html
index 0fa1f4e0..d05fccdc 100644
--- a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/Actions/P/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_bool_static.Make.1-A.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_th_bool_static.Make.1-A.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/Actions/index.html b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/Actions/index.html
index 9bce93b8..b9329e5d 100644
--- a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/Actions/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick.Sidekick_th_bool_static.Make.1-A.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
+Actions (sidekick.Sidekick_th_bool_static.Make.1-A.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/Expl/index.html b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/Expl/index.html
index 92abec4a..be129109 100644
--- a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/Expl/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick.Sidekick_th_bool_static.Make.1-A.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick.Sidekick_th_bool_static.Make.1-A.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/N/index.html b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/N/index.html
index 424089a1..fc5a0c8a 100644
--- a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/N/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick.Sidekick_th_bool_static.Make.1-A.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
+N (sidekick.Sidekick_th_bool_static.Make.1-A.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/P/index.html b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/P/index.html
index cb04fdda..33ab50ea 100644
--- a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/P/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_bool_static.Make.1-A.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_th_bool_static.Make.1-A.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/index.html b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/index.html
index d480aa6d..6a2aa2ec 100644
--- a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/CC/index.html
@@ -1,4 +1,4 @@
 
-CC (sidekick.Sidekick_th_bool_static.Make.1-A.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+CC (sidekick.Sidekick_th_bool_static.Make.1-A.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Small | `Big ] -> term_store -> proof -> t
Create a new congruence closure.
  • parameter term_store 
    used to be able to create new terms. All terms interacting with this congruence closure must belong in this term state as well.
val allocate_bitfield : descr:string -> t -> N.bitfield
Allocate a new node field (see N.bitfield).
This field descriptor is henceforth reserved for all nodes in this congruence closure, and can be set using set_bitfield for each node individually. This can be used to efficiently store some metadata on nodes (e.g. "is there a numeric value in the class" or "is there a constructor term in the class").
There may be restrictions on how many distinct fields are allocated for a given congruence closure (e.g. at most Sys.int_size fields).
val get_bitfield : t -> N.bitfield -> N.t -> bool
Access the bit field of the given node
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
Set the bitfield for the node. This will be backtracked. See N.bitfield.
val on_pre_merge : t -> ev_on_pre_merge -> unit
Add a function to be called when two classes are merged
val on_post_merge : t -> ev_on_post_merge -> unit
Add a function to be called when two classes are merged
val on_new_term : t -> ev_on_new_term -> unit
Add a function to be called when a new node is created
val on_conflict : t -> ev_on_conflict -> unit
Called when the congruence closure finds a conflict
val on_propagate : t -> ev_on_propagate -> unit
Called when the congruence closure propagates a literal
val on_is_subterm : t -> ev_on_is_subterm -> unit
Called on terms that are subterms of function symbols
val set_as_lit : t -> N.t -> lit -> unit
map the given node to a literal.
val find_t : t -> term -> repr
Current representative of the term.
  • raises Not_found 
    if the term is not already add-ed.
val add_seq : t -> term Iter.t -> unit
Add a sequence of terms to the congruence closure
val all_classes : t -> repr Iter.t
All current classes. This is costly, only use if there is no other solution
val assert_lit : t -> lit -> unit
Given a literal, assume it in the congruence closure and propagate its consequences. Will be backtracked.
Useful for the theory combination or the SAT solver's functor
val assert_lits : t -> lit Iter.t -> unit
Addition of many literals
val explain_eq : t -> N.t -> N.t -> lit list
Explain why the two nodes are equal. Fails if they are not, in an unspecified way
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
Raise a conflict with the given explanation it must be a theory tautology that expl ==> absurd. To be used in theories.
val n_true : t -> N.t
Node for true
val n_false : t -> N.t
Node for false
val n_bool : t -> bool -> N.t
Node for either true or false
val merge : t -> N.t -> N.t -> Expl.t -> unit
Merge these two nodes given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val merge_t : t -> term -> term -> Expl.t -> unit
Shortcut for adding + merging
val check : t -> actions -> unit
Perform all pending operations done via assert_eq, assert_lit, etc. Will use the actions to propagate literals, declare conflicts, etc.
val new_merges : t -> bool
Called after check, returns true if some pairs of classes were merged.
val push_level : t -> unit
Push backtracking level
val pop_levels : t -> int -> unit
Restore to state n calls to push_level earlier. Used during backtracking.
val get_model : t -> N.t Iter.t Iter.t
get all the equivalence classes so they can be merged in the model

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/Simplify/index.html b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/Simplify/index.html
index 3fccd12e..bdf56dc2 100644
--- a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/Simplify/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/Simplify/index.html
@@ -1,2 +1,2 @@
 
-Simplify (sidekick.Sidekick_th_bool_static.Make.1-A.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
+Simplify (sidekick.Sidekick_th_bool_static.Make.1-A.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/index.html b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/index.html
index bbf97d03..71fa10be 100644
--- a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/index.html
@@ -1,3 +1,3 @@
 
-Solver_internal (sidekick.Sidekick_th_bool_static.Make.1-A.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
+Solver_internal (sidekick.Sidekick_th_bool_static.Make.1-A.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
 P.t = proof and type P.lit = lit and type Actions.t = theory_actions
Congruence closure instance
val cc : t -> CC.t
Congruence closure for this solver
Simplifiers
module Simplify : sig ... end
Simplify terms
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
Add a simplifier hook for preprocessing.
val simplify_t : t -> term -> (term * proof_step) option
Simplify input term, returns Some u if some simplification occurred.
val simp_t : t -> term -> term * proof_step option
simp_t si t returns u even if no simplification occurred (in which case t == u syntactically). It emits |- t=u. (see simplifier)
Preprocessors
These preprocessors turn mixed, raw literals (possibly simplified) into literals suitable for reasoning. Typically some clauses are also added to the solver.
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
Actions available to the preprocessor
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
Given a term, try to preprocess it. Return None if it didn't change, or Some (u) if t=u. Can also add clauses to define new terms.
Preprocessing might transform terms to make them more amenable to reasoning, e.g. by removing boolean formulas via Tseitin encoding, adding clauses that encode their meaning in the same move.
  • parameter preprocess_actions 
    actions available during preprocessing.
val on_preprocess : t -> preprocess_hook -> unit
Add a hook that will be called when terms are preprocessed
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
Obtain preprocessor actions, from theory actions
hooks for the theory
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
Give a conflict clause to the solver
val push_decision : t -> theory_actions -> lit -> unit
Ask the SAT solver to decide the given literal in an extension of the current trail. This is useful for theory combination. If the SAT solver backtracks, this (potential) decision is removed and forgotten.
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
Add local clause to the SAT solver. This clause will be removed when the solver backtracks.
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
Add toplevel clause to the SAT solver. This clause will not be backtracked.
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
Create a literal. This automatically preprocesses the term.
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
Preprocess a term.
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
Add the given literal to the SAT solver, so it gets assigned a boolean value.
  • parameter default_pol 
    default polarity for the corresponding atom
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
Add the given (signed) bool term to the SAT solver, so it gets assigned a boolean value
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
Raise a conflict with the given congruence closure explanation. it must be a theory tautology that expl ==> absurd. To be used in theories.
val cc_find : t -> CC.N.t -> CC.N.t
Find representative of the node
val cc_are_equal : t -> term -> term -> bool
Are these two terms equal in the congruence closure?
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
Merge these two nodes in the congruence closure, given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
Merge these two terms in the congruence closure, given this explanation. See cc_merge
val cc_add_term : t -> term -> CC.N.t
Add/retrieve congruence closure node for this term. To be used in theories
val cc_mem_term : t -> term -> bool
Return true if the term is explicitly in the congruence closure. To be used in theories
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called before)
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called after)
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
Callback to add data on terms when they are added to the congruence closure
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
Callback for when a term is a subterm of another term in the congruence closure
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
Callback called on every CC conflict
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
Callback called on every CC propagation
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callbacked to be called with the slice of literals newly added on the trail.
This is called very often and should be efficient. It doesn't have to be complete, only correct. It's given only the slice of the trail consisting in new literals.
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callback to be called during the final check.
Must be complete (i.e. must raise a conflict if the set of literals is not satisfiable) and can be expensive. The function is given the whole trail.
Model production
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
A model-production hook. It takes the solver, a class, and returns a term for this class. For example, an arithmetic theory might detect that a class contains a numeric constant, and return this constant as a model value.
If no hook assigns a value to a class, a fake value is created for it.
val on_model_gen : t -> model_hook -> unit
Add a hook that will be called when a model is being produced

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
index e64165e1..dba0f2bc 100644
--- a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
@@ -1,2 +1,2 @@
 
-PREPROCESS_ACTS (sidekick.Sidekick_th_bool_static.Make.1-A.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
+PREPROCESS_ACTS (sidekick.Sidekick_th_bool_static.Make.1-A.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/T/Fun/index.html b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/T/Fun/index.html
index 506baac4..c164015a 100644
--- a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_th_bool_static.Make.1-A.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_th_bool_static.Make.1-A.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/T/Term/index.html b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/T/Term/index.html
index 285448d8..aa4b49a0 100644
--- a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/T/Term/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_th_bool_static.Make.1-A.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_th_bool_static.Make.1-A.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/T/Ty/index.html b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/T/Ty/index.html
index 8686d2cc..0e22f526 100644
--- a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_th_bool_static.Make.1-A.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_th_bool_static.Make.1-A.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/T/index.html b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/T/index.html
index e707daa4..564521a2 100644
--- a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/T/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_th_bool_static.Make.1-A.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_th_bool_static.Make.1-A.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Unknown/index.html b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Unknown/index.html
index 34d4fa68..2763737e 100644
--- a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Unknown/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/Unknown/index.html
@@ -1,2 +1,2 @@
 
-Unknown (sidekick.Sidekick_th_bool_static.Make.1-A.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
+Unknown (sidekick.Sidekick_th_bool_static.Make.1-A.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/index.html b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/index.html
index b63a9853..e2536070 100644
--- a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/index.html
@@ -1,5 +1,5 @@
 
-S (sidekick.Sidekick_th_bool_static.Make.1-A.S)
Module 1-A.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
+S (sidekick.Sidekick_th_bool_static.Make.1-A.S)
Module 1-A.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
 ?push_level:('th -> unit) -> ?pop_levels:('th -> int -> unit) -> unit -> theory
Helper to create a theory.
module Model : sig ... end
Models
module Unknown : sig ... end
Main API
val stats : t -> Sidekick_util.Stat.t
val tst : t -> T.Term.store
val ty_st : t -> T.Ty.store
val proof : t -> proof
val create : ?stat:Sidekick_util.Stat.t -> ?size:[ `Big | `Tiny | `Small ] -> proof:proof -> theories:theory list ->
 T.Term.store -> T.Ty.store -> unit -> t
Create a new solver.
It needs a term state and a type state to manipulate terms and types. All terms and types interacting with this solver will need to come from these exact states.
  • parameter store_proof 
    if true, proofs from the SAT solver and theories are retained and potentially accessible after solve returns UNSAT.
  • parameter size 
    influences the size of initial allocations.
  • parameter theories 
    theories to load from the start. Other theories can be added using add_theory.
val add_theory : t -> theory -> unit
Add a theory to the solver. This should be called before any call to solve or to add_clause and the likes (otherwise the theory will have a partial view of the problem).
val add_theory_p : t -> 'a theory_p -> 'a
Add the given theory and obtain its state
val add_theory_l : t -> theory list -> unit
val mk_lit_t : t -> ?sign:bool -> term -> lit
mk_lit_t _ ~sign t returns lit', where lit' is preprocess(lit) and lit is an internal representation of ± t.
The proof of |- lit = lit' is directly added to the solver's proof.
val add_clause : t -> lit Sidekick_util.IArray.t -> proof_step -> unit
add_clause solver cs adds a boolean clause to the solver. Subsequent calls to solve will need to satisfy this clause.
val add_clause_l : t -> lit list -> proof_step -> unit
Add a clause to the solver, given as a list.
val assert_terms : t -> term list -> unit
Helper that turns each term into an atom, before adding the result to the solver as an assertion
val assert_term : t -> term -> unit
Helper that turns the term into an atom, before adding the result to the solver as a unit clause assertion
type res = 
| Sat of Model.t(*
Satisfiable
*)
| Unsat of {
unsat_core : unit -> lit Iter.t;(*
Unsat core (subset of assumptions), or empty
*)
unsat_proof_step : unit -> proof_step option;(*
Proof step for the empty clause
*)
}		(*
Unsatisfiable
*)
| Unknown of Unknown.t(*
Unknown, obtained after a timeout, memory limit, etc.
*)
Result of solving for the current set of clauses
val solve : ?on_exit:(unit -> unit) list -> ?check:bool -> ?on_progress:(t -> unit) ->
 assumptions:lit list -> t -> res
solve s checks the satisfiability of the clauses added so far to s.
  • parameter check 
    if true, the model is checked before returning.
  • parameter on_progress 
    called regularly during solving.
  • parameter assumptions 
    a set of atoms held to be true. The unsat core, if any, will be a subset of assumptions.
  • parameter on_exit 
    functions to be run before this returns
val pp_stats : t CCFormat.printer
Print some statistics. What it prints exactly is unspecified.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/module-type-THEORY/index.html b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/module-type-THEORY/index.html
index e0e519f4..f6be27c5 100644
--- a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/module-type-THEORY/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/S/module-type-THEORY/index.html
@@ -1,2 +1,2 @@
 
-THEORY (sidekick.Sidekick_th_bool_static.Make.1-A.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
+THEORY (sidekick.Sidekick_th_bool_static.Make.1-A.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/index.html b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/index.html
index 17e84de4..1e05933c 100644
--- a/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/Make/argument-1-A/index.html
@@ -1,2 +1,2 @@
 
-A (sidekick.Sidekick_th_bool_static.Make.1-A)
Parameter Make.1-A
type term = S.T.Term.t
val view_as_bool : term -> (term, term Iter.t) bool_view
Project the term into the boolean view.
Make a term from the given boolean view.
val check_congruence_classes : bool
Configuration: add final-check handler to verify if new boolean formulas are present in the congruence closure. Only enable if some theories are susceptible to create boolean formulas during the proof search.
include PROOF with type proof := S.P.t and type proof_step := S.P.proof_step and type lit := S.Lit.t and type term := S.T.Term.t
val lemma_bool_tauto : S.Lit.t Iter.t -> S.P.t -> S.P.proof_step
Boolean tautology lemma (clause)
val lemma_bool_c : string -> S.T.Term.t list -> S.P.t -> S.P.proof_step
Basic boolean logic lemma for a clause |- c. proof_bool_c b name cs is the rule designated by name.
val lemma_bool_equiv : S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
Boolean tautology lemma (equivalence)
val lemma_ite_true : ite:S.T.Term.t -> S.P.t -> S.P.proof_step
lemma a ==> ite a b c = b
val lemma_ite_false : ite:S.T.Term.t -> S.P.t -> S.P.proof_step
lemma ¬a ==> ite a b c = c
module Gensym : sig ... end
Fresh symbol generator.

\ No newline at end of file
+A (sidekick.Sidekick_th_bool_static.Make.1-A)
Parameter Make.1-A
type term = S.T.Term.t
val view_as_bool : term -> (term, term Iter.t) bool_view
Project the term into the boolean view.
Make a term from the given boolean view.
val check_congruence_classes : bool
Configuration: add final-check handler to verify if new boolean formulas are present in the congruence closure. Only enable if some theories are susceptible to create boolean formulas during the proof search.
include PROOF with type proof := S.P.t and type proof_step := S.P.proof_step and type lit := S.Lit.t and type term := S.T.Term.t
val lemma_bool_tauto : S.Lit.t Iter.t -> S.P.t -> S.P.proof_step
Boolean tautology lemma (clause)
val lemma_bool_c : string -> S.T.Term.t list -> S.P.t -> S.P.proof_step
Basic boolean logic lemma for a clause |- c. proof_bool_c b name cs is the rule designated by name.
val lemma_bool_equiv : S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
Boolean tautology lemma (equivalence)
val lemma_ite_true : ite:S.T.Term.t -> S.P.t -> S.P.proof_step
lemma a ==> ite a b c = b
val lemma_ite_false : ite:S.T.Term.t -> S.P.t -> S.P.proof_step
lemma ¬a ==> ite a b c = c
module Gensym : sig ... end
Fresh symbol generator.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/Make/index.html b/dev/sidekick/Sidekick_th_bool_static/Make/index.html
index a8419c89..fdd6d21d 100644
--- a/dev/sidekick/Sidekick_th_bool_static/Make/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/Make/index.html
@@ -1,2 +1,2 @@
 
-Make (sidekick.Sidekick_th_bool_static.Make)
Module Sidekick_th_bool_static.Make
Parameters
module A : ARG
Signature
module A = A
type state
Simplify given term
preprocesses formulas by giving them names and adding clauses to equate the name with the boolean formula.
val theory : A.S.theory
A theory that can be added to the solver A.S.
This theory does most of its work during preprocessing, turning boolean formulas into SAT clauses via the Tseitin encoding .

\ No newline at end of file
+Make (sidekick.Sidekick_th_bool_static.Make)
Module Sidekick_th_bool_static.Make
Parameters
module A : ARG
Signature
module A = A
type state
Simplify given term
preprocesses formulas by giving them names and adding clauses to equate the name with the boolean formula.
val theory : A.S.theory
A theory that can be added to the solver A.S.
This theory does most of its work during preprocessing, turning boolean formulas into SAT clauses via the Tseitin encoding .

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/index.html b/dev/sidekick/Sidekick_th_bool_static/index.html
index e28f0a78..863a5b15 100644
--- a/dev/sidekick/Sidekick_th_bool_static/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_th_bool_static (sidekick.Sidekick_th_bool_static)
Module Sidekick_th_bool_static
Theory of boolean formulas.
This handles formulas containing "and", "or", "=>", "if-then-else", etc.
type ('a, 'args) bool_view = 
| B_bool of bool
| B_not of 'a
| B_and of 'args
| B_or of 'args
| B_imply of 'args * 'a
| B_equiv of 'a * 'a
| B_xor of 'a * 'a
| B_eq of 'a * 'a
| B_neq of 'a * 'a
| B_ite of 'a * 'a * 'a
| B_opaque_bool of 'a
| B_atom of 'a
Boolean-oriented view of terms
module type PROOF = sig ... end
module type ARG = sig ... end
Argument to the theory
module type S = sig ... end
Signature
module Make (A : ARG) : S with module A = A

\ No newline at end of file
+Sidekick_th_bool_static (sidekick.Sidekick_th_bool_static)
Module Sidekick_th_bool_static
Theory of boolean formulas.
This handles formulas containing "and", "or", "=>", "if-then-else", etc.
type ('a, 'args) bool_view = 
| B_bool of bool
| B_not of 'a
| B_and of 'args
| B_or of 'args
| B_imply of 'args * 'a
| B_equiv of 'a * 'a
| B_xor of 'a * 'a
| B_eq of 'a * 'a
| B_neq of 'a * 'a
| B_ite of 'a * 'a * 'a
| B_opaque_bool of 'a
| B_atom of 'a
Boolean-oriented view of terms
module type PROOF = sig ... end
module type ARG = sig ... end
Argument to the theory
module type S = sig ... end
Signature
module Make (A : ARG) : S with module A = A

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/Gensym/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/Gensym/index.html
index a4c3139b..0bce1752 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/Gensym/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/Gensym/index.html
@@ -1,2 +1,2 @@
 
-Gensym (sidekick.Sidekick_th_bool_static.ARG.Gensym)
Module ARG.Gensym
Fresh symbol generator.
The theory needs to be able to create new terms with fresh names, to be used as placeholders for complex formulas during Tseitin encoding.
type t
val create : S.T.Term.store -> t
New (stateful) generator instance.
val fresh_term : t -> pre:string -> S.T.Ty.t -> term
Make a fresh term of the given type

\ No newline at end of file
+Gensym (sidekick.Sidekick_th_bool_static.ARG.Gensym)
Module ARG.Gensym
Fresh symbol generator.
The theory needs to be able to create new terms with fresh names, to be used as placeholders for complex formulas during Tseitin encoding.
type t
val create : S.T.Term.store -> t
New (stateful) generator instance.
val fresh_term : t -> pre:string -> S.T.Ty.t -> term
Make a fresh term of the given type

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Lit/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Lit/index.html
index 1347e76f..46401593 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Lit/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_th_bool_static.ARG.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick.Sidekick_th_bool_static.ARG.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Model/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Model/index.html
index e1eb7a3e..f9f704b5 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Model/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Model/index.html
@@ -1,2 +1,2 @@
 
-Model (sidekick.Sidekick_th_bool_static.ARG.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Model (sidekick.Sidekick_th_bool_static.ARG.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/P/Step_vec/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/P/Step_vec/index.html
index 401a01d0..c21c2866 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/P/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_th_bool_static.ARG.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_th_bool_static.ARG.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/P/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/P/index.html
index 1fdfe8ff..c9493ed2 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/P/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_bool_static.ARG.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
+P (sidekick.Sidekick_th_bool_static.ARG.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/Actions/P/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/Actions/P/index.html
index d1bc99fd..291acfd1 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/Actions/P/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_bool_static.ARG.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_th_bool_static.ARG.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/Actions/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/Actions/index.html
index 7f9e30b4..3efc3421 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/Actions/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick.Sidekick_th_bool_static.ARG.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
+Actions (sidekick.Sidekick_th_bool_static.ARG.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/Expl/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/Expl/index.html
index 1df2a311..82b86789 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/Expl/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick.Sidekick_th_bool_static.ARG.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick.Sidekick_th_bool_static.ARG.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/N/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/N/index.html
index b23d8af3..ef918c34 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/N/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick.Sidekick_th_bool_static.ARG.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
+N (sidekick.Sidekick_th_bool_static.ARG.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/P/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/P/index.html
index 9003be84..85850a4e 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/P/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_bool_static.ARG.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_th_bool_static.ARG.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/index.html
index b25c1506..be3c1bd4 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/CC/index.html
@@ -1,4 +1,4 @@
 
-CC (sidekick.Sidekick_th_bool_static.ARG.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+CC (sidekick.Sidekick_th_bool_static.ARG.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Small | `Big ] -> term_store -> proof -> t
Create a new congruence closure.
  • parameter term_store 
    used to be able to create new terms. All terms interacting with this congruence closure must belong in this term state as well.
val allocate_bitfield : descr:string -> t -> N.bitfield
Allocate a new node field (see N.bitfield).
This field descriptor is henceforth reserved for all nodes in this congruence closure, and can be set using set_bitfield for each node individually. This can be used to efficiently store some metadata on nodes (e.g. "is there a numeric value in the class" or "is there a constructor term in the class").
There may be restrictions on how many distinct fields are allocated for a given congruence closure (e.g. at most Sys.int_size fields).
val get_bitfield : t -> N.bitfield -> N.t -> bool
Access the bit field of the given node
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
Set the bitfield for the node. This will be backtracked. See N.bitfield.
val on_pre_merge : t -> ev_on_pre_merge -> unit
Add a function to be called when two classes are merged
val on_post_merge : t -> ev_on_post_merge -> unit
Add a function to be called when two classes are merged
val on_new_term : t -> ev_on_new_term -> unit
Add a function to be called when a new node is created
val on_conflict : t -> ev_on_conflict -> unit
Called when the congruence closure finds a conflict
val on_propagate : t -> ev_on_propagate -> unit
Called when the congruence closure propagates a literal
val on_is_subterm : t -> ev_on_is_subterm -> unit
Called on terms that are subterms of function symbols
val set_as_lit : t -> N.t -> lit -> unit
map the given node to a literal.
val find_t : t -> term -> repr
Current representative of the term.
  • raises Not_found 
    if the term is not already add-ed.
val add_seq : t -> term Iter.t -> unit
Add a sequence of terms to the congruence closure
val all_classes : t -> repr Iter.t
All current classes. This is costly, only use if there is no other solution
val assert_lit : t -> lit -> unit
Given a literal, assume it in the congruence closure and propagate its consequences. Will be backtracked.
Useful for the theory combination or the SAT solver's functor
val assert_lits : t -> lit Iter.t -> unit
Addition of many literals
val explain_eq : t -> N.t -> N.t -> lit list
Explain why the two nodes are equal. Fails if they are not, in an unspecified way
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
Raise a conflict with the given explanation it must be a theory tautology that expl ==> absurd. To be used in theories.
val n_true : t -> N.t
Node for true
val n_false : t -> N.t
Node for false
val n_bool : t -> bool -> N.t
Node for either true or false
val merge : t -> N.t -> N.t -> Expl.t -> unit
Merge these two nodes given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val merge_t : t -> term -> term -> Expl.t -> unit
Shortcut for adding + merging
val check : t -> actions -> unit
Perform all pending operations done via assert_eq, assert_lit, etc. Will use the actions to propagate literals, declare conflicts, etc.
val new_merges : t -> bool
Called after check, returns true if some pairs of classes were merged.
val push_level : t -> unit
Push backtracking level
val pop_levels : t -> int -> unit
Restore to state n calls to push_level earlier. Used during backtracking.
val get_model : t -> N.t Iter.t Iter.t
get all the equivalence classes so they can be merged in the model

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/Simplify/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/Simplify/index.html
index e8b6cf47..eaa1c9c8 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/Simplify/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/Simplify/index.html
@@ -1,2 +1,2 @@
 
-Simplify (sidekick.Sidekick_th_bool_static.ARG.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
+Simplify (sidekick.Sidekick_th_bool_static.ARG.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/index.html
index 0e2bd82c..8e7e3dc2 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/index.html
@@ -1,3 +1,3 @@
 
-Solver_internal (sidekick.Sidekick_th_bool_static.ARG.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
+Solver_internal (sidekick.Sidekick_th_bool_static.ARG.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
 P.t = proof and type P.lit = lit and type Actions.t = theory_actions
Congruence closure instance
val cc : t -> CC.t
Congruence closure for this solver
Simplifiers
module Simplify : sig ... end
Simplify terms
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
Add a simplifier hook for preprocessing.
val simplify_t : t -> term -> (term * proof_step) option
Simplify input term, returns Some u if some simplification occurred.
val simp_t : t -> term -> term * proof_step option
simp_t si t returns u even if no simplification occurred (in which case t == u syntactically). It emits |- t=u. (see simplifier)
Preprocessors
These preprocessors turn mixed, raw literals (possibly simplified) into literals suitable for reasoning. Typically some clauses are also added to the solver.
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
Actions available to the preprocessor
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
Given a term, try to preprocess it. Return None if it didn't change, or Some (u) if t=u. Can also add clauses to define new terms.
Preprocessing might transform terms to make them more amenable to reasoning, e.g. by removing boolean formulas via Tseitin encoding, adding clauses that encode their meaning in the same move.
  • parameter preprocess_actions 
    actions available during preprocessing.
val on_preprocess : t -> preprocess_hook -> unit
Add a hook that will be called when terms are preprocessed
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
Obtain preprocessor actions, from theory actions
hooks for the theory
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
Give a conflict clause to the solver
val push_decision : t -> theory_actions -> lit -> unit
Ask the SAT solver to decide the given literal in an extension of the current trail. This is useful for theory combination. If the SAT solver backtracks, this (potential) decision is removed and forgotten.
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
Add local clause to the SAT solver. This clause will be removed when the solver backtracks.
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
Add toplevel clause to the SAT solver. This clause will not be backtracked.
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
Create a literal. This automatically preprocesses the term.
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
Preprocess a term.
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
Add the given literal to the SAT solver, so it gets assigned a boolean value.
  • parameter default_pol 
    default polarity for the corresponding atom
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
Add the given (signed) bool term to the SAT solver, so it gets assigned a boolean value
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
Raise a conflict with the given congruence closure explanation. it must be a theory tautology that expl ==> absurd. To be used in theories.
val cc_find : t -> CC.N.t -> CC.N.t
Find representative of the node
val cc_are_equal : t -> term -> term -> bool
Are these two terms equal in the congruence closure?
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
Merge these two nodes in the congruence closure, given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
Merge these two terms in the congruence closure, given this explanation. See cc_merge
val cc_add_term : t -> term -> CC.N.t
Add/retrieve congruence closure node for this term. To be used in theories
val cc_mem_term : t -> term -> bool
Return true if the term is explicitly in the congruence closure. To be used in theories
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called before)
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called after)
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
Callback to add data on terms when they are added to the congruence closure
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
Callback for when a term is a subterm of another term in the congruence closure
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
Callback called on every CC conflict
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
Callback called on every CC propagation
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callbacked to be called with the slice of literals newly added on the trail.
This is called very often and should be efficient. It doesn't have to be complete, only correct. It's given only the slice of the trail consisting in new literals.
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callback to be called during the final check.
Must be complete (i.e. must raise a conflict if the set of literals is not satisfiable) and can be expensive. The function is given the whole trail.
Model production
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
A model-production hook. It takes the solver, a class, and returns a term for this class. For example, an arithmetic theory might detect that a class contains a numeric constant, and return this constant as a model value.
If no hook assigns a value to a class, a fake value is created for it.
val on_model_gen : t -> model_hook -> unit
Add a hook that will be called when a model is being produced

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
index 4ff60e89..c8ae6e3a 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
@@ -1,2 +1,2 @@
 
-PREPROCESS_ACTS (sidekick.Sidekick_th_bool_static.ARG.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
+PREPROCESS_ACTS (sidekick.Sidekick_th_bool_static.ARG.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/T/Fun/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/T/Fun/index.html
index 623abec3..8d605017 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_th_bool_static.ARG.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_th_bool_static.ARG.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/T/Term/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/T/Term/index.html
index 30817d94..ff2480f3 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/T/Term/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_th_bool_static.ARG.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_th_bool_static.ARG.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/T/Ty/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/T/Ty/index.html
index 783033e4..4929749d 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_th_bool_static.ARG.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_th_bool_static.ARG.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/T/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/T/index.html
index 140c4e79..15c4881e 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/T/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_th_bool_static.ARG.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_th_bool_static.ARG.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Unknown/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Unknown/index.html
index dd185441..d5a67848 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Unknown/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/Unknown/index.html
@@ -1,2 +1,2 @@
 
-Unknown (sidekick.Sidekick_th_bool_static.ARG.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
+Unknown (sidekick.Sidekick_th_bool_static.ARG.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/index.html
index 2d0c58e7..fe1a7641 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/index.html
@@ -1,5 +1,5 @@
 
-S (sidekick.Sidekick_th_bool_static.ARG.S)
Module ARG.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
+S (sidekick.Sidekick_th_bool_static.ARG.S)
Module ARG.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
 ?push_level:('th -> unit) -> ?pop_levels:('th -> int -> unit) -> unit -> theory
Helper to create a theory.
module Model : sig ... end
Models
module Unknown : sig ... end
Main API
val stats : t -> Sidekick_util.Stat.t
val tst : t -> T.Term.store
val ty_st : t -> T.Ty.store
val proof : t -> proof
val create : ?stat:Sidekick_util.Stat.t -> ?size:[ `Big | `Tiny | `Small ] -> proof:proof -> theories:theory list ->
 T.Term.store -> T.Ty.store -> unit -> t
Create a new solver.
It needs a term state and a type state to manipulate terms and types. All terms and types interacting with this solver will need to come from these exact states.
  • parameter store_proof 
    if true, proofs from the SAT solver and theories are retained and potentially accessible after solve returns UNSAT.
  • parameter size 
    influences the size of initial allocations.
  • parameter theories 
    theories to load from the start. Other theories can be added using add_theory.
val add_theory : t -> theory -> unit
Add a theory to the solver. This should be called before any call to solve or to add_clause and the likes (otherwise the theory will have a partial view of the problem).
val add_theory_p : t -> 'a theory_p -> 'a
Add the given theory and obtain its state
val add_theory_l : t -> theory list -> unit
val mk_lit_t : t -> ?sign:bool -> term -> lit
mk_lit_t _ ~sign t returns lit', where lit' is preprocess(lit) and lit is an internal representation of ± t.
The proof of |- lit = lit' is directly added to the solver's proof.
val add_clause : t -> lit Sidekick_util.IArray.t -> proof_step -> unit
add_clause solver cs adds a boolean clause to the solver. Subsequent calls to solve will need to satisfy this clause.
val add_clause_l : t -> lit list -> proof_step -> unit
Add a clause to the solver, given as a list.
val assert_terms : t -> term list -> unit
Helper that turns each term into an atom, before adding the result to the solver as an assertion
val assert_term : t -> term -> unit
Helper that turns the term into an atom, before adding the result to the solver as a unit clause assertion
type res = 
| Sat of Model.t(*
Satisfiable
*)
| Unsat of {
unsat_core : unit -> lit Iter.t;(*
Unsat core (subset of assumptions), or empty
*)
unsat_proof_step : unit -> proof_step option;(*
Proof step for the empty clause
*)
}		(*
Unsatisfiable
*)
| Unknown of Unknown.t(*
Unknown, obtained after a timeout, memory limit, etc.
*)
Result of solving for the current set of clauses
val solve : ?on_exit:(unit -> unit) list -> ?check:bool -> ?on_progress:(t -> unit) ->
 assumptions:lit list -> t -> res
solve s checks the satisfiability of the clauses added so far to s.
  • parameter check 
    if true, the model is checked before returning.
  • parameter on_progress 
    called regularly during solving.
  • parameter assumptions 
    a set of atoms held to be true. The unsat core, if any, will be a subset of assumptions.
  • parameter on_exit 
    functions to be run before this returns
val pp_stats : t CCFormat.printer
Print some statistics. What it prints exactly is unspecified.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/module-type-THEORY/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/module-type-THEORY/index.html
index 8d3462f1..5006b797 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/module-type-THEORY/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/S/module-type-THEORY/index.html
@@ -1,2 +1,2 @@
 
-THEORY (sidekick.Sidekick_th_bool_static.ARG.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
+THEORY (sidekick.Sidekick_th_bool_static.ARG.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/index.html
index 2c41c329..7d298806 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-ARG/index.html
@@ -1,2 +1,2 @@
 
-ARG (sidekick.Sidekick_th_bool_static.ARG)
Module type Sidekick_th_bool_static.ARG
Argument to the theory
type term = S.T.Term.t
val view_as_bool : term -> (term, term Iter.t) bool_view
Project the term into the boolean view.
Make a term from the given boolean view.
val check_congruence_classes : bool
Configuration: add final-check handler to verify if new boolean formulas are present in the congruence closure. Only enable if some theories are susceptible to create boolean formulas during the proof search.
include PROOF with type proof := S.P.t and type proof_step := S.P.proof_step and type lit := S.Lit.t and type term := S.T.Term.t
val lemma_bool_tauto : S.Lit.t Iter.t -> S.P.t -> S.P.proof_step
Boolean tautology lemma (clause)
val lemma_bool_c : string -> S.T.Term.t list -> S.P.t -> S.P.proof_step
Basic boolean logic lemma for a clause |- c. proof_bool_c b name cs is the rule designated by name.
val lemma_bool_equiv : S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
Boolean tautology lemma (equivalence)
val lemma_ite_true : ite:S.T.Term.t -> S.P.t -> S.P.proof_step
lemma a ==> ite a b c = b
val lemma_ite_false : ite:S.T.Term.t -> S.P.t -> S.P.proof_step
lemma ¬a ==> ite a b c = c
module Gensym : sig ... end
Fresh symbol generator.

\ No newline at end of file
+ARG (sidekick.Sidekick_th_bool_static.ARG)
Module type Sidekick_th_bool_static.ARG
Argument to the theory
type term = S.T.Term.t
val view_as_bool : term -> (term, term Iter.t) bool_view
Project the term into the boolean view.
Make a term from the given boolean view.
val check_congruence_classes : bool
Configuration: add final-check handler to verify if new boolean formulas are present in the congruence closure. Only enable if some theories are susceptible to create boolean formulas during the proof search.
include PROOF with type proof := S.P.t and type proof_step := S.P.proof_step and type lit := S.Lit.t and type term := S.T.Term.t
val lemma_bool_tauto : S.Lit.t Iter.t -> S.P.t -> S.P.proof_step
Boolean tautology lemma (clause)
val lemma_bool_c : string -> S.T.Term.t list -> S.P.t -> S.P.proof_step
Basic boolean logic lemma for a clause |- c. proof_bool_c b name cs is the rule designated by name.
val lemma_bool_equiv : S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
Boolean tautology lemma (equivalence)
val lemma_ite_true : ite:S.T.Term.t -> S.P.t -> S.P.proof_step
lemma a ==> ite a b c = b
val lemma_ite_false : ite:S.T.Term.t -> S.P.t -> S.P.proof_step
lemma ¬a ==> ite a b c = c
module Gensym : sig ... end
Fresh symbol generator.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-PROOF/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-PROOF/index.html
index 661b1461..9dabef08 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-PROOF/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-PROOF/index.html
@@ -1,2 +1,2 @@
 
-PROOF (sidekick.Sidekick_th_bool_static.PROOF)
Module type Sidekick_th_bool_static.PROOF
type proof
type proof_step
type term
type lit
val lemma_bool_tauto : lit Iter.t -> proof -> proof_step
Boolean tautology lemma (clause)
val lemma_bool_c : string -> term list -> proof -> proof_step
Basic boolean logic lemma for a clause |- c. proof_bool_c b name cs is the rule designated by name.
val lemma_bool_equiv : term -> term -> proof -> proof_step
Boolean tautology lemma (equivalence)
val lemma_ite_true : ite:term -> proof -> proof_step
lemma a ==> ite a b c = b
val lemma_ite_false : ite:term -> proof -> proof_step
lemma ¬a ==> ite a b c = c

\ No newline at end of file
+PROOF (sidekick.Sidekick_th_bool_static.PROOF)
Module type Sidekick_th_bool_static.PROOF
type proof
type proof_step
type term
type lit
val lemma_bool_tauto : lit Iter.t -> proof -> proof_step
Boolean tautology lemma (clause)
val lemma_bool_c : string -> term list -> proof -> proof_step
Basic boolean logic lemma for a clause |- c. proof_bool_c b name cs is the rule designated by name.
val lemma_bool_equiv : term -> term -> proof -> proof_step
Boolean tautology lemma (equivalence)
val lemma_ite_true : ite:term -> proof -> proof_step
lemma a ==> ite a b c = b
val lemma_ite_false : ite:term -> proof -> proof_step
lemma ¬a ==> ite a b c = c

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/Gensym/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/Gensym/index.html
index dc192cb4..780bc6a0 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/Gensym/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/Gensym/index.html
@@ -1,2 +1,2 @@
 
-Gensym (sidekick.Sidekick_th_bool_static.S.A.Gensym)
Module A.Gensym
Fresh symbol generator.
The theory needs to be able to create new terms with fresh names, to be used as placeholders for complex formulas during Tseitin encoding.
type t
val create : S.T.Term.store -> t
New (stateful) generator instance.
val fresh_term : t -> pre:string -> S.T.Ty.t -> term
Make a fresh term of the given type

\ No newline at end of file
+Gensym (sidekick.Sidekick_th_bool_static.S.A.Gensym)
Module A.Gensym
Fresh symbol generator.
The theory needs to be able to create new terms with fresh names, to be used as placeholders for complex formulas during Tseitin encoding.
type t
val create : S.T.Term.store -> t
New (stateful) generator instance.
val fresh_term : t -> pre:string -> S.T.Ty.t -> term
Make a fresh term of the given type

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Lit/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Lit/index.html
index 340086a2..db235767 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Lit/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_th_bool_static.S.A.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick.Sidekick_th_bool_static.S.A.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Model/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Model/index.html
index f2ca903d..b168002f 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Model/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Model/index.html
@@ -1,2 +1,2 @@
 
-Model (sidekick.Sidekick_th_bool_static.S.A.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Model (sidekick.Sidekick_th_bool_static.S.A.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/P/Step_vec/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/P/Step_vec/index.html
index 4bde091e..250cbb80 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/P/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_th_bool_static.S.A.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_th_bool_static.S.A.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/P/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/P/index.html
index 14eae4f4..60802655 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/P/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_bool_static.S.A.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
+P (sidekick.Sidekick_th_bool_static.S.A.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/Actions/P/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/Actions/P/index.html
index e4b4daeb..9546d294 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/Actions/P/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_bool_static.S.A.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_th_bool_static.S.A.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/Actions/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/Actions/index.html
index dd5e43b5..7e37f43a 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/Actions/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick.Sidekick_th_bool_static.S.A.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
+Actions (sidekick.Sidekick_th_bool_static.S.A.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/Expl/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/Expl/index.html
index 7e4a5675..b1913c2b 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/Expl/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick.Sidekick_th_bool_static.S.A.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick.Sidekick_th_bool_static.S.A.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/N/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/N/index.html
index fae3125c..4c153407 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/N/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick.Sidekick_th_bool_static.S.A.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
+N (sidekick.Sidekick_th_bool_static.S.A.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/P/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/P/index.html
index 513167c6..48757813 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/P/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_bool_static.S.A.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_th_bool_static.S.A.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/index.html
index cd963d0b..8a869bb4 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/CC/index.html
@@ -1,4 +1,4 @@
 
-CC (sidekick.Sidekick_th_bool_static.S.A.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+CC (sidekick.Sidekick_th_bool_static.S.A.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Small | `Big ] -> term_store -> proof -> t
Create a new congruence closure.
  • parameter term_store 
    used to be able to create new terms. All terms interacting with this congruence closure must belong in this term state as well.
val allocate_bitfield : descr:string -> t -> N.bitfield
Allocate a new node field (see N.bitfield).
This field descriptor is henceforth reserved for all nodes in this congruence closure, and can be set using set_bitfield for each node individually. This can be used to efficiently store some metadata on nodes (e.g. "is there a numeric value in the class" or "is there a constructor term in the class").
There may be restrictions on how many distinct fields are allocated for a given congruence closure (e.g. at most Sys.int_size fields).
val get_bitfield : t -> N.bitfield -> N.t -> bool
Access the bit field of the given node
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
Set the bitfield for the node. This will be backtracked. See N.bitfield.
val on_pre_merge : t -> ev_on_pre_merge -> unit
Add a function to be called when two classes are merged
val on_post_merge : t -> ev_on_post_merge -> unit
Add a function to be called when two classes are merged
val on_new_term : t -> ev_on_new_term -> unit
Add a function to be called when a new node is created
val on_conflict : t -> ev_on_conflict -> unit
Called when the congruence closure finds a conflict
val on_propagate : t -> ev_on_propagate -> unit
Called when the congruence closure propagates a literal
val on_is_subterm : t -> ev_on_is_subterm -> unit
Called on terms that are subterms of function symbols
val set_as_lit : t -> N.t -> lit -> unit
map the given node to a literal.
val find_t : t -> term -> repr
Current representative of the term.
  • raises Not_found 
    if the term is not already add-ed.
val add_seq : t -> term Iter.t -> unit
Add a sequence of terms to the congruence closure
val all_classes : t -> repr Iter.t
All current classes. This is costly, only use if there is no other solution
val assert_lit : t -> lit -> unit
Given a literal, assume it in the congruence closure and propagate its consequences. Will be backtracked.
Useful for the theory combination or the SAT solver's functor
val assert_lits : t -> lit Iter.t -> unit
Addition of many literals
val explain_eq : t -> N.t -> N.t -> lit list
Explain why the two nodes are equal. Fails if they are not, in an unspecified way
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
Raise a conflict with the given explanation it must be a theory tautology that expl ==> absurd. To be used in theories.
val n_true : t -> N.t
Node for true
val n_false : t -> N.t
Node for false
val n_bool : t -> bool -> N.t
Node for either true or false
val merge : t -> N.t -> N.t -> Expl.t -> unit
Merge these two nodes given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val merge_t : t -> term -> term -> Expl.t -> unit
Shortcut for adding + merging
val check : t -> actions -> unit
Perform all pending operations done via assert_eq, assert_lit, etc. Will use the actions to propagate literals, declare conflicts, etc.
val new_merges : t -> bool
Called after check, returns true if some pairs of classes were merged.
val push_level : t -> unit
Push backtracking level
val pop_levels : t -> int -> unit
Restore to state n calls to push_level earlier. Used during backtracking.
val get_model : t -> N.t Iter.t Iter.t
get all the equivalence classes so they can be merged in the model

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/Simplify/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/Simplify/index.html
index a91c467b..67a72a44 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/Simplify/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/Simplify/index.html
@@ -1,2 +1,2 @@
 
-Simplify (sidekick.Sidekick_th_bool_static.S.A.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
+Simplify (sidekick.Sidekick_th_bool_static.S.A.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/index.html
index b7d8d9e7..b54b1d1d 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/index.html
@@ -1,3 +1,3 @@
 
-Solver_internal (sidekick.Sidekick_th_bool_static.S.A.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
+Solver_internal (sidekick.Sidekick_th_bool_static.S.A.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
 P.t = proof and type P.lit = lit and type Actions.t = theory_actions
Congruence closure instance
val cc : t -> CC.t
Congruence closure for this solver
Simplifiers
module Simplify : sig ... end
Simplify terms
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
Add a simplifier hook for preprocessing.
val simplify_t : t -> term -> (term * proof_step) option
Simplify input term, returns Some u if some simplification occurred.
val simp_t : t -> term -> term * proof_step option
simp_t si t returns u even if no simplification occurred (in which case t == u syntactically). It emits |- t=u. (see simplifier)
Preprocessors
These preprocessors turn mixed, raw literals (possibly simplified) into literals suitable for reasoning. Typically some clauses are also added to the solver.
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
Actions available to the preprocessor
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
Given a term, try to preprocess it. Return None if it didn't change, or Some (u) if t=u. Can also add clauses to define new terms.
Preprocessing might transform terms to make them more amenable to reasoning, e.g. by removing boolean formulas via Tseitin encoding, adding clauses that encode their meaning in the same move.
  • parameter preprocess_actions 
    actions available during preprocessing.
val on_preprocess : t -> preprocess_hook -> unit
Add a hook that will be called when terms are preprocessed
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
Obtain preprocessor actions, from theory actions
hooks for the theory
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
Give a conflict clause to the solver
val push_decision : t -> theory_actions -> lit -> unit
Ask the SAT solver to decide the given literal in an extension of the current trail. This is useful for theory combination. If the SAT solver backtracks, this (potential) decision is removed and forgotten.
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
Add local clause to the SAT solver. This clause will be removed when the solver backtracks.
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
Add toplevel clause to the SAT solver. This clause will not be backtracked.
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
Create a literal. This automatically preprocesses the term.
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
Preprocess a term.
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
Add the given literal to the SAT solver, so it gets assigned a boolean value.
  • parameter default_pol 
    default polarity for the corresponding atom
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
Add the given (signed) bool term to the SAT solver, so it gets assigned a boolean value
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
Raise a conflict with the given congruence closure explanation. it must be a theory tautology that expl ==> absurd. To be used in theories.
val cc_find : t -> CC.N.t -> CC.N.t
Find representative of the node
val cc_are_equal : t -> term -> term -> bool
Are these two terms equal in the congruence closure?
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
Merge these two nodes in the congruence closure, given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
Merge these two terms in the congruence closure, given this explanation. See cc_merge
val cc_add_term : t -> term -> CC.N.t
Add/retrieve congruence closure node for this term. To be used in theories
val cc_mem_term : t -> term -> bool
Return true if the term is explicitly in the congruence closure. To be used in theories
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called before)
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called after)
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
Callback to add data on terms when they are added to the congruence closure
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
Callback for when a term is a subterm of another term in the congruence closure
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
Callback called on every CC conflict
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
Callback called on every CC propagation
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callbacked to be called with the slice of literals newly added on the trail.
This is called very often and should be efficient. It doesn't have to be complete, only correct. It's given only the slice of the trail consisting in new literals.
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callback to be called during the final check.
Must be complete (i.e. must raise a conflict if the set of literals is not satisfiable) and can be expensive. The function is given the whole trail.
Model production
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
A model-production hook. It takes the solver, a class, and returns a term for this class. For example, an arithmetic theory might detect that a class contains a numeric constant, and return this constant as a model value.
If no hook assigns a value to a class, a fake value is created for it.
val on_model_gen : t -> model_hook -> unit
Add a hook that will be called when a model is being produced

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
index 15b34f00..0ad90fe3 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
@@ -1,2 +1,2 @@
 
-PREPROCESS_ACTS (sidekick.Sidekick_th_bool_static.S.A.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
+PREPROCESS_ACTS (sidekick.Sidekick_th_bool_static.S.A.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/T/Fun/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/T/Fun/index.html
index 07d718fc..46969eae 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_th_bool_static.S.A.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_th_bool_static.S.A.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/T/Term/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/T/Term/index.html
index 122a07ff..d76b708a 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/T/Term/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_th_bool_static.S.A.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_th_bool_static.S.A.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/T/Ty/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/T/Ty/index.html
index 23c64b69..a972ab6d 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_th_bool_static.S.A.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_th_bool_static.S.A.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/T/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/T/index.html
index c650b9f8..6ed881dd 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/T/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_th_bool_static.S.A.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_th_bool_static.S.A.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Unknown/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Unknown/index.html
index 1a71ae62..8f1cb5e4 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Unknown/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/Unknown/index.html
@@ -1,2 +1,2 @@
 
-Unknown (sidekick.Sidekick_th_bool_static.S.A.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
+Unknown (sidekick.Sidekick_th_bool_static.S.A.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/index.html
index 31e40dee..aa32182b 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/index.html
@@ -1,5 +1,5 @@
 
-S (sidekick.Sidekick_th_bool_static.S.A.S)
Module A.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
+S (sidekick.Sidekick_th_bool_static.S.A.S)
Module A.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
 ?push_level:('th -> unit) -> ?pop_levels:('th -> int -> unit) -> unit -> theory
Helper to create a theory.
module Model : sig ... end
Models
module Unknown : sig ... end
Main API
val stats : t -> Sidekick_util.Stat.t
val tst : t -> T.Term.store
val ty_st : t -> T.Ty.store
val proof : t -> proof
val create : ?stat:Sidekick_util.Stat.t -> ?size:[ `Big | `Tiny | `Small ] -> proof:proof -> theories:theory list ->
 T.Term.store -> T.Ty.store -> unit -> t
Create a new solver.
It needs a term state and a type state to manipulate terms and types. All terms and types interacting with this solver will need to come from these exact states.
  • parameter store_proof 
    if true, proofs from the SAT solver and theories are retained and potentially accessible after solve returns UNSAT.
  • parameter size 
    influences the size of initial allocations.
  • parameter theories 
    theories to load from the start. Other theories can be added using add_theory.
val add_theory : t -> theory -> unit
Add a theory to the solver. This should be called before any call to solve or to add_clause and the likes (otherwise the theory will have a partial view of the problem).
val add_theory_p : t -> 'a theory_p -> 'a
Add the given theory and obtain its state
val add_theory_l : t -> theory list -> unit
val mk_lit_t : t -> ?sign:bool -> term -> lit
mk_lit_t _ ~sign t returns lit', where lit' is preprocess(lit) and lit is an internal representation of ± t.
The proof of |- lit = lit' is directly added to the solver's proof.
val add_clause : t -> lit Sidekick_util.IArray.t -> proof_step -> unit
add_clause solver cs adds a boolean clause to the solver. Subsequent calls to solve will need to satisfy this clause.
val add_clause_l : t -> lit list -> proof_step -> unit
Add a clause to the solver, given as a list.
val assert_terms : t -> term list -> unit
Helper that turns each term into an atom, before adding the result to the solver as an assertion
val assert_term : t -> term -> unit
Helper that turns the term into an atom, before adding the result to the solver as a unit clause assertion
type res = 
| Sat of Model.t(*
Satisfiable
*)
| Unsat of {
unsat_core : unit -> lit Iter.t;(*
Unsat core (subset of assumptions), or empty
*)
unsat_proof_step : unit -> proof_step option;(*
Proof step for the empty clause
*)
}		(*
Unsatisfiable
*)
| Unknown of Unknown.t(*
Unknown, obtained after a timeout, memory limit, etc.
*)
Result of solving for the current set of clauses
val solve : ?on_exit:(unit -> unit) list -> ?check:bool -> ?on_progress:(t -> unit) ->
 assumptions:lit list -> t -> res
solve s checks the satisfiability of the clauses added so far to s.
  • parameter check 
    if true, the model is checked before returning.
  • parameter on_progress 
    called regularly during solving.
  • parameter assumptions 
    a set of atoms held to be true. The unsat core, if any, will be a subset of assumptions.
  • parameter on_exit 
    functions to be run before this returns
val pp_stats : t CCFormat.printer
Print some statistics. What it prints exactly is unspecified.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/module-type-THEORY/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/module-type-THEORY/index.html
index 589167f6..d3913958 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/module-type-THEORY/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/S/module-type-THEORY/index.html
@@ -1,2 +1,2 @@
 
-THEORY (sidekick.Sidekick_th_bool_static.S.A.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
+THEORY (sidekick.Sidekick_th_bool_static.S.A.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/index.html
index 0bf887e5..52e7b311 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-S/A/index.html
@@ -1,2 +1,2 @@
 
-A (sidekick.Sidekick_th_bool_static.S.A)
Module S.A
type term = S.T.Term.t
val view_as_bool : term -> (term, term Iter.t) bool_view
Project the term into the boolean view.
Make a term from the given boolean view.
val check_congruence_classes : bool
Configuration: add final-check handler to verify if new boolean formulas are present in the congruence closure. Only enable if some theories are susceptible to create boolean formulas during the proof search.
include PROOF with type proof := S.P.t and type proof_step := S.P.proof_step and type lit := S.Lit.t and type term := S.T.Term.t
val lemma_bool_tauto : S.Lit.t Iter.t -> S.P.t -> S.P.proof_step
Boolean tautology lemma (clause)
val lemma_bool_c : string -> S.T.Term.t list -> S.P.t -> S.P.proof_step
Basic boolean logic lemma for a clause |- c. proof_bool_c b name cs is the rule designated by name.
val lemma_bool_equiv : S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
Boolean tautology lemma (equivalence)
val lemma_ite_true : ite:S.T.Term.t -> S.P.t -> S.P.proof_step
lemma a ==> ite a b c = b
val lemma_ite_false : ite:S.T.Term.t -> S.P.t -> S.P.proof_step
lemma ¬a ==> ite a b c = c
module Gensym : sig ... end
Fresh symbol generator.

\ No newline at end of file
+A (sidekick.Sidekick_th_bool_static.S.A)
Module S.A
type term = S.T.Term.t
val view_as_bool : term -> (term, term Iter.t) bool_view
Project the term into the boolean view.
Make a term from the given boolean view.
val check_congruence_classes : bool
Configuration: add final-check handler to verify if new boolean formulas are present in the congruence closure. Only enable if some theories are susceptible to create boolean formulas during the proof search.
include PROOF with type proof := S.P.t and type proof_step := S.P.proof_step and type lit := S.Lit.t and type term := S.T.Term.t
val lemma_bool_tauto : S.Lit.t Iter.t -> S.P.t -> S.P.proof_step
Boolean tautology lemma (clause)
val lemma_bool_c : string -> S.T.Term.t list -> S.P.t -> S.P.proof_step
Basic boolean logic lemma for a clause |- c. proof_bool_c b name cs is the rule designated by name.
val lemma_bool_equiv : S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
Boolean tautology lemma (equivalence)
val lemma_ite_true : ite:S.T.Term.t -> S.P.t -> S.P.proof_step
lemma a ==> ite a b c = b
val lemma_ite_false : ite:S.T.Term.t -> S.P.t -> S.P.proof_step
lemma ¬a ==> ite a b c = c
module Gensym : sig ... end
Fresh symbol generator.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_bool_static/module-type-S/index.html b/dev/sidekick/Sidekick_th_bool_static/module-type-S/index.html
index 4729ba5d..969f7224 100644
--- a/dev/sidekick/Sidekick_th_bool_static/module-type-S/index.html
+++ b/dev/sidekick/Sidekick_th_bool_static/module-type-S/index.html
@@ -1,2 +1,2 @@
 
-S (sidekick.Sidekick_th_bool_static.S)
Module type Sidekick_th_bool_static.S
Signature
module A : ARG
type state
Simplify given term
preprocesses formulas by giving them names and adding clauses to equate the name with the boolean formula.
val theory : A.S.theory
A theory that can be added to the solver A.S.
This theory does most of its work during preprocessing, turning boolean formulas into SAT clauses via the Tseitin encoding .

\ No newline at end of file
+S (sidekick.Sidekick_th_bool_static.S)
Module type Sidekick_th_bool_static.S
Signature
module A : ARG
type state
Simplify given term
preprocesses formulas by giving them names and adding clauses to equate the name with the boolean formula.
val theory : A.S.theory
A theory that can be added to the solver A.S.
This theory does most of its work during preprocessing, turning boolean formulas into SAT clauses via the Tseitin encoding .

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Lit/index.html b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Lit/index.html
index 8564b6d1..7855e876 100644
--- a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Lit/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_th_cstor.Make.1-A.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick.Sidekick_th_cstor.Make.1-A.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Model/index.html b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Model/index.html
index 75fa99f2..164d438f 100644
--- a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Model/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Model/index.html
@@ -1,2 +1,2 @@
 
-Model (sidekick.Sidekick_th_cstor.Make.1-A.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Model (sidekick.Sidekick_th_cstor.Make.1-A.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/P/Step_vec/index.html b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/P/Step_vec/index.html
index 708af825..d056a8af 100644
--- a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/P/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_th_cstor.Make.1-A.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_th_cstor.Make.1-A.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/P/index.html b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/P/index.html
index d0f5c45f..db5a13d5 100644
--- a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/P/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_cstor.Make.1-A.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
+P (sidekick.Sidekick_th_cstor.Make.1-A.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/Actions/P/index.html b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/Actions/P/index.html
index 6a2413e6..7bf167a5 100644
--- a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/Actions/P/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_cstor.Make.1-A.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_th_cstor.Make.1-A.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/Actions/index.html b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/Actions/index.html
index 1bf2320a..e6eed9d5 100644
--- a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/Actions/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick.Sidekick_th_cstor.Make.1-A.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
+Actions (sidekick.Sidekick_th_cstor.Make.1-A.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/Expl/index.html b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/Expl/index.html
index 63c4d3b1..aefbc99b 100644
--- a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/Expl/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick.Sidekick_th_cstor.Make.1-A.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick.Sidekick_th_cstor.Make.1-A.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/N/index.html b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/N/index.html
index b1aca3e4..d9643586 100644
--- a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/N/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick.Sidekick_th_cstor.Make.1-A.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
+N (sidekick.Sidekick_th_cstor.Make.1-A.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/P/index.html b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/P/index.html
index aca64990..27d3caa5 100644
--- a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/P/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_cstor.Make.1-A.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_th_cstor.Make.1-A.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/index.html b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/index.html
index 39ec33aa..d11ed17e 100644
--- a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/CC/index.html
@@ -1,4 +1,4 @@
 
-CC (sidekick.Sidekick_th_cstor.Make.1-A.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+CC (sidekick.Sidekick_th_cstor.Make.1-A.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Small | `Big ] -> term_store -> proof -> t
Create a new congruence closure.
  • parameter term_store 
    used to be able to create new terms. All terms interacting with this congruence closure must belong in this term state as well.
val allocate_bitfield : descr:string -> t -> N.bitfield
Allocate a new node field (see N.bitfield).
This field descriptor is henceforth reserved for all nodes in this congruence closure, and can be set using set_bitfield for each node individually. This can be used to efficiently store some metadata on nodes (e.g. "is there a numeric value in the class" or "is there a constructor term in the class").
There may be restrictions on how many distinct fields are allocated for a given congruence closure (e.g. at most Sys.int_size fields).
val get_bitfield : t -> N.bitfield -> N.t -> bool
Access the bit field of the given node
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
Set the bitfield for the node. This will be backtracked. See N.bitfield.
val on_pre_merge : t -> ev_on_pre_merge -> unit
Add a function to be called when two classes are merged
val on_post_merge : t -> ev_on_post_merge -> unit
Add a function to be called when two classes are merged
val on_new_term : t -> ev_on_new_term -> unit
Add a function to be called when a new node is created
val on_conflict : t -> ev_on_conflict -> unit
Called when the congruence closure finds a conflict
val on_propagate : t -> ev_on_propagate -> unit
Called when the congruence closure propagates a literal
val on_is_subterm : t -> ev_on_is_subterm -> unit
Called on terms that are subterms of function symbols
val set_as_lit : t -> N.t -> lit -> unit
map the given node to a literal.
val find_t : t -> term -> repr
Current representative of the term.
  • raises Not_found 
    if the term is not already add-ed.
val add_seq : t -> term Iter.t -> unit
Add a sequence of terms to the congruence closure
val all_classes : t -> repr Iter.t
All current classes. This is costly, only use if there is no other solution
val assert_lit : t -> lit -> unit
Given a literal, assume it in the congruence closure and propagate its consequences. Will be backtracked.
Useful for the theory combination or the SAT solver's functor
val assert_lits : t -> lit Iter.t -> unit
Addition of many literals
val explain_eq : t -> N.t -> N.t -> lit list
Explain why the two nodes are equal. Fails if they are not, in an unspecified way
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
Raise a conflict with the given explanation it must be a theory tautology that expl ==> absurd. To be used in theories.
val n_true : t -> N.t
Node for true
val n_false : t -> N.t
Node for false
val n_bool : t -> bool -> N.t
Node for either true or false
val merge : t -> N.t -> N.t -> Expl.t -> unit
Merge these two nodes given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val merge_t : t -> term -> term -> Expl.t -> unit
Shortcut for adding + merging
val check : t -> actions -> unit
Perform all pending operations done via assert_eq, assert_lit, etc. Will use the actions to propagate literals, declare conflicts, etc.
val new_merges : t -> bool
Called after check, returns true if some pairs of classes were merged.
val push_level : t -> unit
Push backtracking level
val pop_levels : t -> int -> unit
Restore to state n calls to push_level earlier. Used during backtracking.
val get_model : t -> N.t Iter.t Iter.t
get all the equivalence classes so they can be merged in the model

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/Simplify/index.html b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/Simplify/index.html
index edc3d88f..1137c630 100644
--- a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/Simplify/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/Simplify/index.html
@@ -1,2 +1,2 @@
 
-Simplify (sidekick.Sidekick_th_cstor.Make.1-A.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
+Simplify (sidekick.Sidekick_th_cstor.Make.1-A.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/index.html b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/index.html
index 069aaef4..754567fb 100644
--- a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/index.html
@@ -1,3 +1,3 @@
 
-Solver_internal (sidekick.Sidekick_th_cstor.Make.1-A.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
+Solver_internal (sidekick.Sidekick_th_cstor.Make.1-A.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
 P.t = proof and type P.lit = lit and type Actions.t = theory_actions
Congruence closure instance
val cc : t -> CC.t
Congruence closure for this solver
Simplifiers
module Simplify : sig ... end
Simplify terms
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
Add a simplifier hook for preprocessing.
val simplify_t : t -> term -> (term * proof_step) option
Simplify input term, returns Some u if some simplification occurred.
val simp_t : t -> term -> term * proof_step option
simp_t si t returns u even if no simplification occurred (in which case t == u syntactically). It emits |- t=u. (see simplifier)
Preprocessors
These preprocessors turn mixed, raw literals (possibly simplified) into literals suitable for reasoning. Typically some clauses are also added to the solver.
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
Actions available to the preprocessor
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
Given a term, try to preprocess it. Return None if it didn't change, or Some (u) if t=u. Can also add clauses to define new terms.
Preprocessing might transform terms to make them more amenable to reasoning, e.g. by removing boolean formulas via Tseitin encoding, adding clauses that encode their meaning in the same move.
  • parameter preprocess_actions 
    actions available during preprocessing.
val on_preprocess : t -> preprocess_hook -> unit
Add a hook that will be called when terms are preprocessed
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
Obtain preprocessor actions, from theory actions
hooks for the theory
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
Give a conflict clause to the solver
val push_decision : t -> theory_actions -> lit -> unit
Ask the SAT solver to decide the given literal in an extension of the current trail. This is useful for theory combination. If the SAT solver backtracks, this (potential) decision is removed and forgotten.
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
Add local clause to the SAT solver. This clause will be removed when the solver backtracks.
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
Add toplevel clause to the SAT solver. This clause will not be backtracked.
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
Create a literal. This automatically preprocesses the term.
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
Preprocess a term.
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
Add the given literal to the SAT solver, so it gets assigned a boolean value.
  • parameter default_pol 
    default polarity for the corresponding atom
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
Add the given (signed) bool term to the SAT solver, so it gets assigned a boolean value
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
Raise a conflict with the given congruence closure explanation. it must be a theory tautology that expl ==> absurd. To be used in theories.
val cc_find : t -> CC.N.t -> CC.N.t
Find representative of the node
val cc_are_equal : t -> term -> term -> bool
Are these two terms equal in the congruence closure?
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
Merge these two nodes in the congruence closure, given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
Merge these two terms in the congruence closure, given this explanation. See cc_merge
val cc_add_term : t -> term -> CC.N.t
Add/retrieve congruence closure node for this term. To be used in theories
val cc_mem_term : t -> term -> bool
Return true if the term is explicitly in the congruence closure. To be used in theories
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called before)
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called after)
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
Callback to add data on terms when they are added to the congruence closure
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
Callback for when a term is a subterm of another term in the congruence closure
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
Callback called on every CC conflict
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
Callback called on every CC propagation
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callbacked to be called with the slice of literals newly added on the trail.
This is called very often and should be efficient. It doesn't have to be complete, only correct. It's given only the slice of the trail consisting in new literals.
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callback to be called during the final check.
Must be complete (i.e. must raise a conflict if the set of literals is not satisfiable) and can be expensive. The function is given the whole trail.
Model production
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
A model-production hook. It takes the solver, a class, and returns a term for this class. For example, an arithmetic theory might detect that a class contains a numeric constant, and return this constant as a model value.
If no hook assigns a value to a class, a fake value is created for it.
val on_model_gen : t -> model_hook -> unit
Add a hook that will be called when a model is being produced

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
index ce8ec20e..c742a8af 100644
--- a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
@@ -1,2 +1,2 @@
 
-PREPROCESS_ACTS (sidekick.Sidekick_th_cstor.Make.1-A.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
+PREPROCESS_ACTS (sidekick.Sidekick_th_cstor.Make.1-A.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/T/Fun/index.html b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/T/Fun/index.html
index 950b07a2..b897d364 100644
--- a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_th_cstor.Make.1-A.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_th_cstor.Make.1-A.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/T/Term/index.html b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/T/Term/index.html
index a8a44b8b..d26c6a00 100644
--- a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/T/Term/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_th_cstor.Make.1-A.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_th_cstor.Make.1-A.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/T/Ty/index.html b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/T/Ty/index.html
index 9dfa58d3..7c3c2c21 100644
--- a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_th_cstor.Make.1-A.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_th_cstor.Make.1-A.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/T/index.html b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/T/index.html
index ff8bc1a9..0f74c43f 100644
--- a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/T/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_th_cstor.Make.1-A.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_th_cstor.Make.1-A.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Unknown/index.html b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Unknown/index.html
index cbe61296..baf64573 100644
--- a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Unknown/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/Unknown/index.html
@@ -1,2 +1,2 @@
 
-Unknown (sidekick.Sidekick_th_cstor.Make.1-A.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
+Unknown (sidekick.Sidekick_th_cstor.Make.1-A.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/index.html b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/index.html
index 8e5f1e5a..32957f50 100644
--- a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/index.html
@@ -1,5 +1,5 @@
 
-S (sidekick.Sidekick_th_cstor.Make.1-A.S)
Module 1-A.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
+S (sidekick.Sidekick_th_cstor.Make.1-A.S)
Module 1-A.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
 ?push_level:('th -> unit) -> ?pop_levels:('th -> int -> unit) -> unit -> theory
Helper to create a theory.
module Model : sig ... end
Models
module Unknown : sig ... end
Main API
val stats : t -> Sidekick_util.Stat.t
val tst : t -> T.Term.store
val ty_st : t -> T.Ty.store
val proof : t -> proof
val create : ?stat:Sidekick_util.Stat.t -> ?size:[ `Big | `Tiny | `Small ] -> proof:proof -> theories:theory list ->
 T.Term.store -> T.Ty.store -> unit -> t
Create a new solver.
It needs a term state and a type state to manipulate terms and types. All terms and types interacting with this solver will need to come from these exact states.
  • parameter store_proof 
    if true, proofs from the SAT solver and theories are retained and potentially accessible after solve returns UNSAT.
  • parameter size 
    influences the size of initial allocations.
  • parameter theories 
    theories to load from the start. Other theories can be added using add_theory.
val add_theory : t -> theory -> unit
Add a theory to the solver. This should be called before any call to solve or to add_clause and the likes (otherwise the theory will have a partial view of the problem).
val add_theory_p : t -> 'a theory_p -> 'a
Add the given theory and obtain its state
val add_theory_l : t -> theory list -> unit
val mk_lit_t : t -> ?sign:bool -> term -> lit
mk_lit_t _ ~sign t returns lit', where lit' is preprocess(lit) and lit is an internal representation of ± t.
The proof of |- lit = lit' is directly added to the solver's proof.
val add_clause : t -> lit Sidekick_util.IArray.t -> proof_step -> unit
add_clause solver cs adds a boolean clause to the solver. Subsequent calls to solve will need to satisfy this clause.
val add_clause_l : t -> lit list -> proof_step -> unit
Add a clause to the solver, given as a list.
val assert_terms : t -> term list -> unit
Helper that turns each term into an atom, before adding the result to the solver as an assertion
val assert_term : t -> term -> unit
Helper that turns the term into an atom, before adding the result to the solver as a unit clause assertion
type res = 
| Sat of Model.t(*
Satisfiable
*)
| Unsat of {
unsat_core : unit -> lit Iter.t;(*
Unsat core (subset of assumptions), or empty
*)
unsat_proof_step : unit -> proof_step option;(*
Proof step for the empty clause
*)
}		(*
Unsatisfiable
*)
| Unknown of Unknown.t(*
Unknown, obtained after a timeout, memory limit, etc.
*)
Result of solving for the current set of clauses
val solve : ?on_exit:(unit -> unit) list -> ?check:bool -> ?on_progress:(t -> unit) ->
 assumptions:lit list -> t -> res
solve s checks the satisfiability of the clauses added so far to s.
  • parameter check 
    if true, the model is checked before returning.
  • parameter on_progress 
    called regularly during solving.
  • parameter assumptions 
    a set of atoms held to be true. The unsat core, if any, will be a subset of assumptions.
  • parameter on_exit 
    functions to be run before this returns
val pp_stats : t CCFormat.printer
Print some statistics. What it prints exactly is unspecified.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/module-type-THEORY/index.html b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/module-type-THEORY/index.html
index a14891b1..a94998df 100644
--- a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/module-type-THEORY/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/S/module-type-THEORY/index.html
@@ -1,2 +1,2 @@
 
-THEORY (sidekick.Sidekick_th_cstor.Make.1-A.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
+THEORY (sidekick.Sidekick_th_cstor.Make.1-A.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/index.html b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/index.html
index db580cad..cdf141a1 100644
--- a/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/Make/argument-1-A/index.html
@@ -1,2 +1,2 @@
 
-A (sidekick.Sidekick_th_cstor.Make.1-A)
Parameter Make.1-A
val view_as_cstor : S.T.Term.t -> (S.T.Fun.t, S.T.Term.t) cstor_view
val lemma_cstor : S.proof -> S.Lit.t Iter.t -> unit

\ No newline at end of file
+A (sidekick.Sidekick_th_cstor.Make.1-A)
Parameter Make.1-A
val view_as_cstor : S.T.Term.t -> (S.T.Fun.t, S.T.Term.t) cstor_view
val lemma_cstor : S.proof -> S.Lit.t Iter.t -> unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/Make/index.html b/dev/sidekick/Sidekick_th_cstor/Make/index.html
index c96e1485..abd2cc07 100644
--- a/dev/sidekick/Sidekick_th_cstor/Make/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/Make/index.html
@@ -1,2 +1,2 @@
 
-Make (sidekick.Sidekick_th_cstor.Make)
Module Sidekick_th_cstor.Make
Parameters
module A : ARG
Signature
module A = A
val theory : A.S.theory

\ No newline at end of file
+Make (sidekick.Sidekick_th_cstor.Make)
Module Sidekick_th_cstor.Make
Parameters
module A : ARG
Signature
module A = A
val theory : A.S.theory

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/index.html b/dev/sidekick/Sidekick_th_cstor/index.html
index 11297fd1..b417b962 100644
--- a/dev/sidekick/Sidekick_th_cstor/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_th_cstor (sidekick.Sidekick_th_cstor)
Module Sidekick_th_cstor
Theory for constructors
type ('c, 't) cstor_view = 
| T_cstor of 'c * 't Sidekick_util.IArray.t
| T_other of 't
val name : string
module type ARG = sig ... end
module type S = sig ... end
module Make (A : ARG) : S with module A = A

\ No newline at end of file
+Sidekick_th_cstor (sidekick.Sidekick_th_cstor)
Module Sidekick_th_cstor
Theory for constructors
type ('c, 't) cstor_view = 
| T_cstor of 'c * 't Sidekick_util.IArray.t
| T_other of 't
val name : string
module type ARG = sig ... end
module type S = sig ... end
module Make (A : ARG) : S with module A = A

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Lit/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Lit/index.html
index e3605554..59f4c669 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Lit/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_th_cstor.ARG.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick.Sidekick_th_cstor.ARG.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Model/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Model/index.html
index 1927c48a..b2822040 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Model/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Model/index.html
@@ -1,2 +1,2 @@
 
-Model (sidekick.Sidekick_th_cstor.ARG.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Model (sidekick.Sidekick_th_cstor.ARG.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/P/Step_vec/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/P/Step_vec/index.html
index 020db1d9..850aee0f 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/P/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_th_cstor.ARG.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_th_cstor.ARG.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/P/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/P/index.html
index e5d09818..9208209f 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/P/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_cstor.ARG.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
+P (sidekick.Sidekick_th_cstor.ARG.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/Actions/P/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/Actions/P/index.html
index 2ea9b6d4..615dcf20 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/Actions/P/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_cstor.ARG.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_th_cstor.ARG.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/Actions/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/Actions/index.html
index 56a4e33e..623558df 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/Actions/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick.Sidekick_th_cstor.ARG.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
+Actions (sidekick.Sidekick_th_cstor.ARG.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/Expl/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/Expl/index.html
index 40b894f1..242b5bc4 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/Expl/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick.Sidekick_th_cstor.ARG.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick.Sidekick_th_cstor.ARG.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/N/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/N/index.html
index 20d26366..3a40219c 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/N/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick.Sidekick_th_cstor.ARG.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
+N (sidekick.Sidekick_th_cstor.ARG.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/P/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/P/index.html
index c2893682..39975cf6 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/P/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_cstor.ARG.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_th_cstor.ARG.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/index.html
index de458066..01d8293b 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/CC/index.html
@@ -1,4 +1,4 @@
 
-CC (sidekick.Sidekick_th_cstor.ARG.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+CC (sidekick.Sidekick_th_cstor.ARG.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Small | `Big ] -> term_store -> proof -> t
Create a new congruence closure.
  • parameter term_store 
    used to be able to create new terms. All terms interacting with this congruence closure must belong in this term state as well.
val allocate_bitfield : descr:string -> t -> N.bitfield
Allocate a new node field (see N.bitfield).
This field descriptor is henceforth reserved for all nodes in this congruence closure, and can be set using set_bitfield for each node individually. This can be used to efficiently store some metadata on nodes (e.g. "is there a numeric value in the class" or "is there a constructor term in the class").
There may be restrictions on how many distinct fields are allocated for a given congruence closure (e.g. at most Sys.int_size fields).
val get_bitfield : t -> N.bitfield -> N.t -> bool
Access the bit field of the given node
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
Set the bitfield for the node. This will be backtracked. See N.bitfield.
val on_pre_merge : t -> ev_on_pre_merge -> unit
Add a function to be called when two classes are merged
val on_post_merge : t -> ev_on_post_merge -> unit
Add a function to be called when two classes are merged
val on_new_term : t -> ev_on_new_term -> unit
Add a function to be called when a new node is created
val on_conflict : t -> ev_on_conflict -> unit
Called when the congruence closure finds a conflict
val on_propagate : t -> ev_on_propagate -> unit
Called when the congruence closure propagates a literal
val on_is_subterm : t -> ev_on_is_subterm -> unit
Called on terms that are subterms of function symbols
val set_as_lit : t -> N.t -> lit -> unit
map the given node to a literal.
val find_t : t -> term -> repr
Current representative of the term.
  • raises Not_found 
    if the term is not already add-ed.
val add_seq : t -> term Iter.t -> unit
Add a sequence of terms to the congruence closure
val all_classes : t -> repr Iter.t
All current classes. This is costly, only use if there is no other solution
val assert_lit : t -> lit -> unit
Given a literal, assume it in the congruence closure and propagate its consequences. Will be backtracked.
Useful for the theory combination or the SAT solver's functor
val assert_lits : t -> lit Iter.t -> unit
Addition of many literals
val explain_eq : t -> N.t -> N.t -> lit list
Explain why the two nodes are equal. Fails if they are not, in an unspecified way
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
Raise a conflict with the given explanation it must be a theory tautology that expl ==> absurd. To be used in theories.
val n_true : t -> N.t
Node for true
val n_false : t -> N.t
Node for false
val n_bool : t -> bool -> N.t
Node for either true or false
val merge : t -> N.t -> N.t -> Expl.t -> unit
Merge these two nodes given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val merge_t : t -> term -> term -> Expl.t -> unit
Shortcut for adding + merging
val check : t -> actions -> unit
Perform all pending operations done via assert_eq, assert_lit, etc. Will use the actions to propagate literals, declare conflicts, etc.
val new_merges : t -> bool
Called after check, returns true if some pairs of classes were merged.
val push_level : t -> unit
Push backtracking level
val pop_levels : t -> int -> unit
Restore to state n calls to push_level earlier. Used during backtracking.
val get_model : t -> N.t Iter.t Iter.t
get all the equivalence classes so they can be merged in the model

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/Simplify/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/Simplify/index.html
index 907867e8..869e6ee1 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/Simplify/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/Simplify/index.html
@@ -1,2 +1,2 @@
 
-Simplify (sidekick.Sidekick_th_cstor.ARG.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
+Simplify (sidekick.Sidekick_th_cstor.ARG.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/index.html
index 5d97a1fb..58d1bd26 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/index.html
@@ -1,3 +1,3 @@
 
-Solver_internal (sidekick.Sidekick_th_cstor.ARG.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
+Solver_internal (sidekick.Sidekick_th_cstor.ARG.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
 P.t = proof and type P.lit = lit and type Actions.t = theory_actions
Congruence closure instance
val cc : t -> CC.t
Congruence closure for this solver
Simplifiers
module Simplify : sig ... end
Simplify terms
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
Add a simplifier hook for preprocessing.
val simplify_t : t -> term -> (term * proof_step) option
Simplify input term, returns Some u if some simplification occurred.
val simp_t : t -> term -> term * proof_step option
simp_t si t returns u even if no simplification occurred (in which case t == u syntactically). It emits |- t=u. (see simplifier)
Preprocessors
These preprocessors turn mixed, raw literals (possibly simplified) into literals suitable for reasoning. Typically some clauses are also added to the solver.
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
Actions available to the preprocessor
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
Given a term, try to preprocess it. Return None if it didn't change, or Some (u) if t=u. Can also add clauses to define new terms.
Preprocessing might transform terms to make them more amenable to reasoning, e.g. by removing boolean formulas via Tseitin encoding, adding clauses that encode their meaning in the same move.
  • parameter preprocess_actions 
    actions available during preprocessing.
val on_preprocess : t -> preprocess_hook -> unit
Add a hook that will be called when terms are preprocessed
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
Obtain preprocessor actions, from theory actions
hooks for the theory
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
Give a conflict clause to the solver
val push_decision : t -> theory_actions -> lit -> unit
Ask the SAT solver to decide the given literal in an extension of the current trail. This is useful for theory combination. If the SAT solver backtracks, this (potential) decision is removed and forgotten.
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
Add local clause to the SAT solver. This clause will be removed when the solver backtracks.
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
Add toplevel clause to the SAT solver. This clause will not be backtracked.
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
Create a literal. This automatically preprocesses the term.
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
Preprocess a term.
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
Add the given literal to the SAT solver, so it gets assigned a boolean value.
  • parameter default_pol 
    default polarity for the corresponding atom
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
Add the given (signed) bool term to the SAT solver, so it gets assigned a boolean value
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
Raise a conflict with the given congruence closure explanation. it must be a theory tautology that expl ==> absurd. To be used in theories.
val cc_find : t -> CC.N.t -> CC.N.t
Find representative of the node
val cc_are_equal : t -> term -> term -> bool
Are these two terms equal in the congruence closure?
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
Merge these two nodes in the congruence closure, given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
Merge these two terms in the congruence closure, given this explanation. See cc_merge
val cc_add_term : t -> term -> CC.N.t
Add/retrieve congruence closure node for this term. To be used in theories
val cc_mem_term : t -> term -> bool
Return true if the term is explicitly in the congruence closure. To be used in theories
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called before)
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called after)
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
Callback to add data on terms when they are added to the congruence closure
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
Callback for when a term is a subterm of another term in the congruence closure
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
Callback called on every CC conflict
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
Callback called on every CC propagation
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callbacked to be called with the slice of literals newly added on the trail.
This is called very often and should be efficient. It doesn't have to be complete, only correct. It's given only the slice of the trail consisting in new literals.
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callback to be called during the final check.
Must be complete (i.e. must raise a conflict if the set of literals is not satisfiable) and can be expensive. The function is given the whole trail.
Model production
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
A model-production hook. It takes the solver, a class, and returns a term for this class. For example, an arithmetic theory might detect that a class contains a numeric constant, and return this constant as a model value.
If no hook assigns a value to a class, a fake value is created for it.
val on_model_gen : t -> model_hook -> unit
Add a hook that will be called when a model is being produced

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
index 92e288b6..0c845f16 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
@@ -1,2 +1,2 @@
 
-PREPROCESS_ACTS (sidekick.Sidekick_th_cstor.ARG.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
+PREPROCESS_ACTS (sidekick.Sidekick_th_cstor.ARG.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/T/Fun/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/T/Fun/index.html
index f8fcec68..287cb30a 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_th_cstor.ARG.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_th_cstor.ARG.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/T/Term/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/T/Term/index.html
index dfc39624..d2f14526 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/T/Term/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_th_cstor.ARG.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_th_cstor.ARG.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/T/Ty/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/T/Ty/index.html
index 91c7589c..9c4f4859 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_th_cstor.ARG.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_th_cstor.ARG.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/T/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/T/index.html
index 286e91c4..ab97f5fe 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/T/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_th_cstor.ARG.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_th_cstor.ARG.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Unknown/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Unknown/index.html
index 680538bc..fd339cef 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Unknown/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/Unknown/index.html
@@ -1,2 +1,2 @@
 
-Unknown (sidekick.Sidekick_th_cstor.ARG.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
+Unknown (sidekick.Sidekick_th_cstor.ARG.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/index.html
index 533449fe..36388c19 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/index.html
@@ -1,5 +1,5 @@
 
-S (sidekick.Sidekick_th_cstor.ARG.S)
Module ARG.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
+S (sidekick.Sidekick_th_cstor.ARG.S)
Module ARG.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
 ?push_level:('th -> unit) -> ?pop_levels:('th -> int -> unit) -> unit -> theory
Helper to create a theory.
module Model : sig ... end
Models
module Unknown : sig ... end
Main API
val stats : t -> Sidekick_util.Stat.t
val tst : t -> T.Term.store
val ty_st : t -> T.Ty.store
val proof : t -> proof
val create : ?stat:Sidekick_util.Stat.t -> ?size:[ `Big | `Tiny | `Small ] -> proof:proof -> theories:theory list ->
 T.Term.store -> T.Ty.store -> unit -> t
Create a new solver.
It needs a term state and a type state to manipulate terms and types. All terms and types interacting with this solver will need to come from these exact states.
  • parameter store_proof 
    if true, proofs from the SAT solver and theories are retained and potentially accessible after solve returns UNSAT.
  • parameter size 
    influences the size of initial allocations.
  • parameter theories 
    theories to load from the start. Other theories can be added using add_theory.
val add_theory : t -> theory -> unit
Add a theory to the solver. This should be called before any call to solve or to add_clause and the likes (otherwise the theory will have a partial view of the problem).
val add_theory_p : t -> 'a theory_p -> 'a
Add the given theory and obtain its state
val add_theory_l : t -> theory list -> unit
val mk_lit_t : t -> ?sign:bool -> term -> lit
mk_lit_t _ ~sign t returns lit', where lit' is preprocess(lit) and lit is an internal representation of ± t.
The proof of |- lit = lit' is directly added to the solver's proof.
val add_clause : t -> lit Sidekick_util.IArray.t -> proof_step -> unit
add_clause solver cs adds a boolean clause to the solver. Subsequent calls to solve will need to satisfy this clause.
val add_clause_l : t -> lit list -> proof_step -> unit
Add a clause to the solver, given as a list.
val assert_terms : t -> term list -> unit
Helper that turns each term into an atom, before adding the result to the solver as an assertion
val assert_term : t -> term -> unit
Helper that turns the term into an atom, before adding the result to the solver as a unit clause assertion
type res = 
| Sat of Model.t(*
Satisfiable
*)
| Unsat of {
unsat_core : unit -> lit Iter.t;(*
Unsat core (subset of assumptions), or empty
*)
unsat_proof_step : unit -> proof_step option;(*
Proof step for the empty clause
*)
}		(*
Unsatisfiable
*)
| Unknown of Unknown.t(*
Unknown, obtained after a timeout, memory limit, etc.
*)
Result of solving for the current set of clauses
val solve : ?on_exit:(unit -> unit) list -> ?check:bool -> ?on_progress:(t -> unit) ->
 assumptions:lit list -> t -> res
solve s checks the satisfiability of the clauses added so far to s.
  • parameter check 
    if true, the model is checked before returning.
  • parameter on_progress 
    called regularly during solving.
  • parameter assumptions 
    a set of atoms held to be true. The unsat core, if any, will be a subset of assumptions.
  • parameter on_exit 
    functions to be run before this returns
val pp_stats : t CCFormat.printer
Print some statistics. What it prints exactly is unspecified.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/module-type-THEORY/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/module-type-THEORY/index.html
index ec64e6df..af5d4ade 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/module-type-THEORY/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/S/module-type-THEORY/index.html
@@ -1,2 +1,2 @@
 
-THEORY (sidekick.Sidekick_th_cstor.ARG.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
+THEORY (sidekick.Sidekick_th_cstor.ARG.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/index.html
index a4b788fb..04898d0d 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-ARG/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-ARG/index.html
@@ -1,2 +1,2 @@
 
-ARG (sidekick.Sidekick_th_cstor.ARG)
Module type Sidekick_th_cstor.ARG
val view_as_cstor : S.T.Term.t -> (S.T.Fun.t, S.T.Term.t) cstor_view
val lemma_cstor : S.proof -> S.Lit.t Iter.t -> unit

\ No newline at end of file
+ARG (sidekick.Sidekick_th_cstor.ARG)
Module type Sidekick_th_cstor.ARG
val view_as_cstor : S.T.Term.t -> (S.T.Fun.t, S.T.Term.t) cstor_view
val lemma_cstor : S.proof -> S.Lit.t Iter.t -> unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Lit/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Lit/index.html
index 0ba4e672..4f7b2ef6 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Lit/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_th_cstor.S.A.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick.Sidekick_th_cstor.S.A.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Model/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Model/index.html
index 01d2a2a5..e69fafb8 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Model/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Model/index.html
@@ -1,2 +1,2 @@
 
-Model (sidekick.Sidekick_th_cstor.S.A.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Model (sidekick.Sidekick_th_cstor.S.A.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/P/Step_vec/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/P/Step_vec/index.html
index 0f056a7b..e50853fd 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/P/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_th_cstor.S.A.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_th_cstor.S.A.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/P/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/P/index.html
index d1ecf1db..aa1dd1fa 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/P/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_cstor.S.A.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
+P (sidekick.Sidekick_th_cstor.S.A.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/Actions/P/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/Actions/P/index.html
index 9282e8a7..6425eb70 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/Actions/P/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_cstor.S.A.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_th_cstor.S.A.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/Actions/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/Actions/index.html
index 62bd016b..4d158d6e 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/Actions/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick.Sidekick_th_cstor.S.A.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
+Actions (sidekick.Sidekick_th_cstor.S.A.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/Expl/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/Expl/index.html
index e8366365..e0e3f910 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/Expl/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick.Sidekick_th_cstor.S.A.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick.Sidekick_th_cstor.S.A.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/N/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/N/index.html
index 1d3f5b9a..1b1010b8 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/N/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick.Sidekick_th_cstor.S.A.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
+N (sidekick.Sidekick_th_cstor.S.A.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/P/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/P/index.html
index 52555d1b..c8924942 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/P/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_cstor.S.A.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_th_cstor.S.A.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/index.html
index b7293af4..f65e96c2 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/CC/index.html
@@ -1,4 +1,4 @@
 
-CC (sidekick.Sidekick_th_cstor.S.A.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+CC (sidekick.Sidekick_th_cstor.S.A.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Small | `Big ] -> term_store -> proof -> t
Create a new congruence closure.
  • parameter term_store 
    used to be able to create new terms. All terms interacting with this congruence closure must belong in this term state as well.
val allocate_bitfield : descr:string -> t -> N.bitfield
Allocate a new node field (see N.bitfield).
This field descriptor is henceforth reserved for all nodes in this congruence closure, and can be set using set_bitfield for each node individually. This can be used to efficiently store some metadata on nodes (e.g. "is there a numeric value in the class" or "is there a constructor term in the class").
There may be restrictions on how many distinct fields are allocated for a given congruence closure (e.g. at most Sys.int_size fields).
val get_bitfield : t -> N.bitfield -> N.t -> bool
Access the bit field of the given node
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
Set the bitfield for the node. This will be backtracked. See N.bitfield.
val on_pre_merge : t -> ev_on_pre_merge -> unit
Add a function to be called when two classes are merged
val on_post_merge : t -> ev_on_post_merge -> unit
Add a function to be called when two classes are merged
val on_new_term : t -> ev_on_new_term -> unit
Add a function to be called when a new node is created
val on_conflict : t -> ev_on_conflict -> unit
Called when the congruence closure finds a conflict
val on_propagate : t -> ev_on_propagate -> unit
Called when the congruence closure propagates a literal
val on_is_subterm : t -> ev_on_is_subterm -> unit
Called on terms that are subterms of function symbols
val set_as_lit : t -> N.t -> lit -> unit
map the given node to a literal.
val find_t : t -> term -> repr
Current representative of the term.
  • raises Not_found 
    if the term is not already add-ed.
val add_seq : t -> term Iter.t -> unit
Add a sequence of terms to the congruence closure
val all_classes : t -> repr Iter.t
All current classes. This is costly, only use if there is no other solution
val assert_lit : t -> lit -> unit
Given a literal, assume it in the congruence closure and propagate its consequences. Will be backtracked.
Useful for the theory combination or the SAT solver's functor
val assert_lits : t -> lit Iter.t -> unit
Addition of many literals
val explain_eq : t -> N.t -> N.t -> lit list
Explain why the two nodes are equal. Fails if they are not, in an unspecified way
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
Raise a conflict with the given explanation it must be a theory tautology that expl ==> absurd. To be used in theories.
val n_true : t -> N.t
Node for true
val n_false : t -> N.t
Node for false
val n_bool : t -> bool -> N.t
Node for either true or false
val merge : t -> N.t -> N.t -> Expl.t -> unit
Merge these two nodes given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val merge_t : t -> term -> term -> Expl.t -> unit
Shortcut for adding + merging
val check : t -> actions -> unit
Perform all pending operations done via assert_eq, assert_lit, etc. Will use the actions to propagate literals, declare conflicts, etc.
val new_merges : t -> bool
Called after check, returns true if some pairs of classes were merged.
val push_level : t -> unit
Push backtracking level
val pop_levels : t -> int -> unit
Restore to state n calls to push_level earlier. Used during backtracking.
val get_model : t -> N.t Iter.t Iter.t
get all the equivalence classes so they can be merged in the model

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/Simplify/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/Simplify/index.html
index de67d319..62600609 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/Simplify/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/Simplify/index.html
@@ -1,2 +1,2 @@
 
-Simplify (sidekick.Sidekick_th_cstor.S.A.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
+Simplify (sidekick.Sidekick_th_cstor.S.A.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/index.html
index a27ce843..adbc62cd 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/index.html
@@ -1,3 +1,3 @@
 
-Solver_internal (sidekick.Sidekick_th_cstor.S.A.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
+Solver_internal (sidekick.Sidekick_th_cstor.S.A.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
 P.t = proof and type P.lit = lit and type Actions.t = theory_actions
Congruence closure instance
val cc : t -> CC.t
Congruence closure for this solver
Simplifiers
module Simplify : sig ... end
Simplify terms
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
Add a simplifier hook for preprocessing.
val simplify_t : t -> term -> (term * proof_step) option
Simplify input term, returns Some u if some simplification occurred.
val simp_t : t -> term -> term * proof_step option
simp_t si t returns u even if no simplification occurred (in which case t == u syntactically). It emits |- t=u. (see simplifier)
Preprocessors
These preprocessors turn mixed, raw literals (possibly simplified) into literals suitable for reasoning. Typically some clauses are also added to the solver.
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
Actions available to the preprocessor
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
Given a term, try to preprocess it. Return None if it didn't change, or Some (u) if t=u. Can also add clauses to define new terms.
Preprocessing might transform terms to make them more amenable to reasoning, e.g. by removing boolean formulas via Tseitin encoding, adding clauses that encode their meaning in the same move.
  • parameter preprocess_actions 
    actions available during preprocessing.
val on_preprocess : t -> preprocess_hook -> unit
Add a hook that will be called when terms are preprocessed
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
Obtain preprocessor actions, from theory actions
hooks for the theory
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
Give a conflict clause to the solver
val push_decision : t -> theory_actions -> lit -> unit
Ask the SAT solver to decide the given literal in an extension of the current trail. This is useful for theory combination. If the SAT solver backtracks, this (potential) decision is removed and forgotten.
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
Add local clause to the SAT solver. This clause will be removed when the solver backtracks.
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
Add toplevel clause to the SAT solver. This clause will not be backtracked.
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
Create a literal. This automatically preprocesses the term.
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
Preprocess a term.
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
Add the given literal to the SAT solver, so it gets assigned a boolean value.
  • parameter default_pol 
    default polarity for the corresponding atom
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
Add the given (signed) bool term to the SAT solver, so it gets assigned a boolean value
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
Raise a conflict with the given congruence closure explanation. it must be a theory tautology that expl ==> absurd. To be used in theories.
val cc_find : t -> CC.N.t -> CC.N.t
Find representative of the node
val cc_are_equal : t -> term -> term -> bool
Are these two terms equal in the congruence closure?
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
Merge these two nodes in the congruence closure, given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
Merge these two terms in the congruence closure, given this explanation. See cc_merge
val cc_add_term : t -> term -> CC.N.t
Add/retrieve congruence closure node for this term. To be used in theories
val cc_mem_term : t -> term -> bool
Return true if the term is explicitly in the congruence closure. To be used in theories
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called before)
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called after)
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
Callback to add data on terms when they are added to the congruence closure
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
Callback for when a term is a subterm of another term in the congruence closure
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
Callback called on every CC conflict
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
Callback called on every CC propagation
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callbacked to be called with the slice of literals newly added on the trail.
This is called very often and should be efficient. It doesn't have to be complete, only correct. It's given only the slice of the trail consisting in new literals.
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callback to be called during the final check.
Must be complete (i.e. must raise a conflict if the set of literals is not satisfiable) and can be expensive. The function is given the whole trail.
Model production
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
A model-production hook. It takes the solver, a class, and returns a term for this class. For example, an arithmetic theory might detect that a class contains a numeric constant, and return this constant as a model value.
If no hook assigns a value to a class, a fake value is created for it.
val on_model_gen : t -> model_hook -> unit
Add a hook that will be called when a model is being produced

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
index 5ebb7361..8a901abb 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
@@ -1,2 +1,2 @@
 
-PREPROCESS_ACTS (sidekick.Sidekick_th_cstor.S.A.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
+PREPROCESS_ACTS (sidekick.Sidekick_th_cstor.S.A.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/T/Fun/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/T/Fun/index.html
index 09740b2e..950e3ca7 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_th_cstor.S.A.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_th_cstor.S.A.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/T/Term/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/T/Term/index.html
index 240347f3..f02703ae 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/T/Term/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_th_cstor.S.A.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_th_cstor.S.A.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/T/Ty/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/T/Ty/index.html
index 86b8ae74..f00587b2 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_th_cstor.S.A.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_th_cstor.S.A.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/T/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/T/index.html
index d4f54612..9ea0553f 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/T/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_th_cstor.S.A.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_th_cstor.S.A.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Unknown/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Unknown/index.html
index a1431b73..a89cc549 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Unknown/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/Unknown/index.html
@@ -1,2 +1,2 @@
 
-Unknown (sidekick.Sidekick_th_cstor.S.A.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
+Unknown (sidekick.Sidekick_th_cstor.S.A.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/index.html
index 8255d856..22c4d837 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/index.html
@@ -1,5 +1,5 @@
 
-S (sidekick.Sidekick_th_cstor.S.A.S)
Module A.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
+S (sidekick.Sidekick_th_cstor.S.A.S)
Module A.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
 ?push_level:('th -> unit) -> ?pop_levels:('th -> int -> unit) -> unit -> theory
Helper to create a theory.
module Model : sig ... end
Models
module Unknown : sig ... end
Main API
val stats : t -> Sidekick_util.Stat.t
val tst : t -> T.Term.store
val ty_st : t -> T.Ty.store
val proof : t -> proof
val create : ?stat:Sidekick_util.Stat.t -> ?size:[ `Big | `Tiny | `Small ] -> proof:proof -> theories:theory list ->
 T.Term.store -> T.Ty.store -> unit -> t
Create a new solver.
It needs a term state and a type state to manipulate terms and types. All terms and types interacting with this solver will need to come from these exact states.
  • parameter store_proof 
    if true, proofs from the SAT solver and theories are retained and potentially accessible after solve returns UNSAT.
  • parameter size 
    influences the size of initial allocations.
  • parameter theories 
    theories to load from the start. Other theories can be added using add_theory.
val add_theory : t -> theory -> unit
Add a theory to the solver. This should be called before any call to solve or to add_clause and the likes (otherwise the theory will have a partial view of the problem).
val add_theory_p : t -> 'a theory_p -> 'a
Add the given theory and obtain its state
val add_theory_l : t -> theory list -> unit
val mk_lit_t : t -> ?sign:bool -> term -> lit
mk_lit_t _ ~sign t returns lit', where lit' is preprocess(lit) and lit is an internal representation of ± t.
The proof of |- lit = lit' is directly added to the solver's proof.
val add_clause : t -> lit Sidekick_util.IArray.t -> proof_step -> unit
add_clause solver cs adds a boolean clause to the solver. Subsequent calls to solve will need to satisfy this clause.
val add_clause_l : t -> lit list -> proof_step -> unit
Add a clause to the solver, given as a list.
val assert_terms : t -> term list -> unit
Helper that turns each term into an atom, before adding the result to the solver as an assertion
val assert_term : t -> term -> unit
Helper that turns the term into an atom, before adding the result to the solver as a unit clause assertion
type res = 
| Sat of Model.t(*
Satisfiable
*)
| Unsat of {
unsat_core : unit -> lit Iter.t;(*
Unsat core (subset of assumptions), or empty
*)
unsat_proof_step : unit -> proof_step option;(*
Proof step for the empty clause
*)
}		(*
Unsatisfiable
*)
| Unknown of Unknown.t(*
Unknown, obtained after a timeout, memory limit, etc.
*)
Result of solving for the current set of clauses
val solve : ?on_exit:(unit -> unit) list -> ?check:bool -> ?on_progress:(t -> unit) ->
 assumptions:lit list -> t -> res
solve s checks the satisfiability of the clauses added so far to s.
  • parameter check 
    if true, the model is checked before returning.
  • parameter on_progress 
    called regularly during solving.
  • parameter assumptions 
    a set of atoms held to be true. The unsat core, if any, will be a subset of assumptions.
  • parameter on_exit 
    functions to be run before this returns
val pp_stats : t CCFormat.printer
Print some statistics. What it prints exactly is unspecified.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/module-type-THEORY/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/module-type-THEORY/index.html
index 64dd8ea5..c0d6a699 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/module-type-THEORY/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/S/module-type-THEORY/index.html
@@ -1,2 +1,2 @@
 
-THEORY (sidekick.Sidekick_th_cstor.S.A.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
+THEORY (sidekick.Sidekick_th_cstor.S.A.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/index.html
index e1ff154e..c6186650 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-S/A/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-S/A/index.html
@@ -1,2 +1,2 @@
 
-A (sidekick.Sidekick_th_cstor.S.A)
Module S.A
val view_as_cstor : S.T.Term.t -> (S.T.Fun.t, S.T.Term.t) cstor_view
val lemma_cstor : S.proof -> S.Lit.t Iter.t -> unit

\ No newline at end of file
+A (sidekick.Sidekick_th_cstor.S.A)
Module S.A
val view_as_cstor : S.T.Term.t -> (S.T.Fun.t, S.T.Term.t) cstor_view
val lemma_cstor : S.proof -> S.Lit.t Iter.t -> unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_cstor/module-type-S/index.html b/dev/sidekick/Sidekick_th_cstor/module-type-S/index.html
index f2857a10..b3b1d17a 100644
--- a/dev/sidekick/Sidekick_th_cstor/module-type-S/index.html
+++ b/dev/sidekick/Sidekick_th_cstor/module-type-S/index.html
@@ -1,2 +1,2 @@
 
-S (sidekick.Sidekick_th_cstor.S)
Module type Sidekick_th_cstor.S
module A : ARG
val theory : A.S.theory

\ No newline at end of file
+S (sidekick.Sidekick_th_cstor.S)
Module type Sidekick_th_cstor.S
module A : ARG
val theory : A.S.theory

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/Cstor/index.html b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/Cstor/index.html
index 36f2c178..492aa1ab 100644
--- a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/Cstor/index.html
+++ b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/Cstor/index.html
@@ -1,2 +1,2 @@
 
-Cstor (sidekick.Sidekick_th_data.Make.1-A.Cstor)
Module 1-A.Cstor
type t
val ty_args : t -> S.T.Ty.t Iter.t
val pp : t Sidekick_util.Fmt.printer
val equal : t -> t -> bool

\ No newline at end of file
+Cstor (sidekick.Sidekick_th_data.Make.1-A.Cstor)
Module 1-A.Cstor
Constructor symbols.
A constructor is an injective symbol, part of a datatype (or "sum type"). For example, in type option a = Some a | None, the constructors are Some and None.
type t
Constructor
val ty_args : t -> S.T.Ty.t Iter.t
Type arguments, for a polymorphic constructor
val pp : t Sidekick_util.Fmt.printer
val equal : t -> t -> bool
Comparison

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Lit/index.html b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Lit/index.html
index 348de203..3625d5ab 100644
--- a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Lit/index.html
+++ b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_th_data.Make.1-A.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick.Sidekick_th_data.Make.1-A.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Model/index.html b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Model/index.html
index b5470000..254a1c86 100644
--- a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Model/index.html
+++ b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Model/index.html
@@ -1,2 +1,2 @@
 
-Model (sidekick.Sidekick_th_data.Make.1-A.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Model (sidekick.Sidekick_th_data.Make.1-A.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/P/Step_vec/index.html b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/P/Step_vec/index.html
index f678b40e..b41ff406 100644
--- a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/P/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_th_data.Make.1-A.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_th_data.Make.1-A.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/P/index.html b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/P/index.html
index 0f81ff0f..ba56c15d 100644
--- a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/P/index.html
+++ b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_data.Make.1-A.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
+P (sidekick.Sidekick_th_data.Make.1-A.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/Actions/P/index.html b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/Actions/P/index.html
index 8370eb68..4dc260e0 100644
--- a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/Actions/P/index.html
+++ b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_data.Make.1-A.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_th_data.Make.1-A.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/Actions/index.html b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/Actions/index.html
index b723c50f..a87e485b 100644
--- a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/Actions/index.html
+++ b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick.Sidekick_th_data.Make.1-A.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
+Actions (sidekick.Sidekick_th_data.Make.1-A.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/Expl/index.html b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/Expl/index.html
index ccbc7f0d..98310dcc 100644
--- a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/Expl/index.html
+++ b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick.Sidekick_th_data.Make.1-A.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick.Sidekick_th_data.Make.1-A.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/N/index.html b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/N/index.html
index e0caafc0..7a775260 100644
--- a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/N/index.html
+++ b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick.Sidekick_th_data.Make.1-A.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
+N (sidekick.Sidekick_th_data.Make.1-A.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/P/index.html b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/P/index.html
index 815790d4..e39927e8 100644
--- a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/P/index.html
+++ b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_data.Make.1-A.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_th_data.Make.1-A.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/index.html b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/index.html
index eccc5d9c..8822c776 100644
--- a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/index.html
+++ b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/CC/index.html
@@ -1,4 +1,4 @@
 
-CC (sidekick.Sidekick_th_data.Make.1-A.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+CC (sidekick.Sidekick_th_data.Make.1-A.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Small | `Big ] -> term_store -> proof -> t
Create a new congruence closure.
  • parameter term_store 
    used to be able to create new terms. All terms interacting with this congruence closure must belong in this term state as well.
val allocate_bitfield : descr:string -> t -> N.bitfield
Allocate a new node field (see N.bitfield).
This field descriptor is henceforth reserved for all nodes in this congruence closure, and can be set using set_bitfield for each node individually. This can be used to efficiently store some metadata on nodes (e.g. "is there a numeric value in the class" or "is there a constructor term in the class").
There may be restrictions on how many distinct fields are allocated for a given congruence closure (e.g. at most Sys.int_size fields).
val get_bitfield : t -> N.bitfield -> N.t -> bool
Access the bit field of the given node
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
Set the bitfield for the node. This will be backtracked. See N.bitfield.
val on_pre_merge : t -> ev_on_pre_merge -> unit
Add a function to be called when two classes are merged
val on_post_merge : t -> ev_on_post_merge -> unit
Add a function to be called when two classes are merged
val on_new_term : t -> ev_on_new_term -> unit
Add a function to be called when a new node is created
val on_conflict : t -> ev_on_conflict -> unit
Called when the congruence closure finds a conflict
val on_propagate : t -> ev_on_propagate -> unit
Called when the congruence closure propagates a literal
val on_is_subterm : t -> ev_on_is_subterm -> unit
Called on terms that are subterms of function symbols
val set_as_lit : t -> N.t -> lit -> unit
map the given node to a literal.
val find_t : t -> term -> repr
Current representative of the term.
  • raises Not_found 
    if the term is not already add-ed.
val add_seq : t -> term Iter.t -> unit
Add a sequence of terms to the congruence closure
val all_classes : t -> repr Iter.t
All current classes. This is costly, only use if there is no other solution
val assert_lit : t -> lit -> unit
Given a literal, assume it in the congruence closure and propagate its consequences. Will be backtracked.
Useful for the theory combination or the SAT solver's functor
val assert_lits : t -> lit Iter.t -> unit
Addition of many literals
val explain_eq : t -> N.t -> N.t -> lit list
Explain why the two nodes are equal. Fails if they are not, in an unspecified way
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
Raise a conflict with the given explanation it must be a theory tautology that expl ==> absurd. To be used in theories.
val n_true : t -> N.t
Node for true
val n_false : t -> N.t
Node for false
val n_bool : t -> bool -> N.t
Node for either true or false
val merge : t -> N.t -> N.t -> Expl.t -> unit
Merge these two nodes given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val merge_t : t -> term -> term -> Expl.t -> unit
Shortcut for adding + merging
val check : t -> actions -> unit
Perform all pending operations done via assert_eq, assert_lit, etc. Will use the actions to propagate literals, declare conflicts, etc.
val new_merges : t -> bool
Called after check, returns true if some pairs of classes were merged.
val push_level : t -> unit
Push backtracking level
val pop_levels : t -> int -> unit
Restore to state n calls to push_level earlier. Used during backtracking.
val get_model : t -> N.t Iter.t Iter.t
get all the equivalence classes so they can be merged in the model

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/Simplify/index.html b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/Simplify/index.html
index 07dc7676..82744df6 100644
--- a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/Simplify/index.html
+++ b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/Simplify/index.html
@@ -1,2 +1,2 @@
 
-Simplify (sidekick.Sidekick_th_data.Make.1-A.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
+Simplify (sidekick.Sidekick_th_data.Make.1-A.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/index.html b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/index.html
index cbc77854..c4813c4c 100644
--- a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/index.html
+++ b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/index.html
@@ -1,3 +1,3 @@
 
-Solver_internal (sidekick.Sidekick_th_data.Make.1-A.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
+Solver_internal (sidekick.Sidekick_th_data.Make.1-A.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
 P.t = proof and type P.lit = lit and type Actions.t = theory_actions
Congruence closure instance
val cc : t -> CC.t
Congruence closure for this solver
Simplifiers
module Simplify : sig ... end
Simplify terms
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
Add a simplifier hook for preprocessing.
val simplify_t : t -> term -> (term * proof_step) option
Simplify input term, returns Some u if some simplification occurred.
val simp_t : t -> term -> term * proof_step option
simp_t si t returns u even if no simplification occurred (in which case t == u syntactically). It emits |- t=u. (see simplifier)
Preprocessors
These preprocessors turn mixed, raw literals (possibly simplified) into literals suitable for reasoning. Typically some clauses are also added to the solver.
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
Actions available to the preprocessor
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
Given a term, try to preprocess it. Return None if it didn't change, or Some (u) if t=u. Can also add clauses to define new terms.
Preprocessing might transform terms to make them more amenable to reasoning, e.g. by removing boolean formulas via Tseitin encoding, adding clauses that encode their meaning in the same move.
  • parameter preprocess_actions 
    actions available during preprocessing.
val on_preprocess : t -> preprocess_hook -> unit
Add a hook that will be called when terms are preprocessed
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
Obtain preprocessor actions, from theory actions
hooks for the theory
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
Give a conflict clause to the solver
val push_decision : t -> theory_actions -> lit -> unit
Ask the SAT solver to decide the given literal in an extension of the current trail. This is useful for theory combination. If the SAT solver backtracks, this (potential) decision is removed and forgotten.
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
Add local clause to the SAT solver. This clause will be removed when the solver backtracks.
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
Add toplevel clause to the SAT solver. This clause will not be backtracked.
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
Create a literal. This automatically preprocesses the term.
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
Preprocess a term.
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
Add the given literal to the SAT solver, so it gets assigned a boolean value.
  • parameter default_pol 
    default polarity for the corresponding atom
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
Add the given (signed) bool term to the SAT solver, so it gets assigned a boolean value
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
Raise a conflict with the given congruence closure explanation. it must be a theory tautology that expl ==> absurd. To be used in theories.
val cc_find : t -> CC.N.t -> CC.N.t
Find representative of the node
val cc_are_equal : t -> term -> term -> bool
Are these two terms equal in the congruence closure?
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
Merge these two nodes in the congruence closure, given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
Merge these two terms in the congruence closure, given this explanation. See cc_merge
val cc_add_term : t -> term -> CC.N.t
Add/retrieve congruence closure node for this term. To be used in theories
val cc_mem_term : t -> term -> bool
Return true if the term is explicitly in the congruence closure. To be used in theories
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called before)
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called after)
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
Callback to add data on terms when they are added to the congruence closure
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
Callback for when a term is a subterm of another term in the congruence closure
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
Callback called on every CC conflict
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
Callback called on every CC propagation
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callbacked to be called with the slice of literals newly added on the trail.
This is called very often and should be efficient. It doesn't have to be complete, only correct. It's given only the slice of the trail consisting in new literals.
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callback to be called during the final check.
Must be complete (i.e. must raise a conflict if the set of literals is not satisfiable) and can be expensive. The function is given the whole trail.
Model production
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
A model-production hook. It takes the solver, a class, and returns a term for this class. For example, an arithmetic theory might detect that a class contains a numeric constant, and return this constant as a model value.
If no hook assigns a value to a class, a fake value is created for it.
val on_model_gen : t -> model_hook -> unit
Add a hook that will be called when a model is being produced

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
index 6c5e93ea..e84c7431 100644
--- a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
+++ b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
@@ -1,2 +1,2 @@
 
-PREPROCESS_ACTS (sidekick.Sidekick_th_data.Make.1-A.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
+PREPROCESS_ACTS (sidekick.Sidekick_th_data.Make.1-A.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/T/Fun/index.html b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/T/Fun/index.html
index 9a9d5749..fecde1c2 100644
--- a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_th_data.Make.1-A.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_th_data.Make.1-A.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/T/Term/index.html b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/T/Term/index.html
index 7ed9c5ae..6b8db235 100644
--- a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/T/Term/index.html
+++ b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_th_data.Make.1-A.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_th_data.Make.1-A.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/T/Ty/index.html b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/T/Ty/index.html
index 4fac8116..5af24bae 100644
--- a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_th_data.Make.1-A.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_th_data.Make.1-A.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/T/index.html b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/T/index.html
index 06b21798..d01a58b5 100644
--- a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/T/index.html
+++ b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_th_data.Make.1-A.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_th_data.Make.1-A.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Unknown/index.html b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Unknown/index.html
index 17818f30..62f1c9fc 100644
--- a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Unknown/index.html
+++ b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/Unknown/index.html
@@ -1,2 +1,2 @@
 
-Unknown (sidekick.Sidekick_th_data.Make.1-A.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
+Unknown (sidekick.Sidekick_th_data.Make.1-A.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/index.html b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/index.html
index 6a015617..d0f1de1d 100644
--- a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/index.html
+++ b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/index.html
@@ -1,5 +1,5 @@
 
-S (sidekick.Sidekick_th_data.Make.1-A.S)
Module 1-A.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
+S (sidekick.Sidekick_th_data.Make.1-A.S)
Module 1-A.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
 ?push_level:('th -> unit) -> ?pop_levels:('th -> int -> unit) -> unit -> theory
Helper to create a theory.
module Model : sig ... end
Models
module Unknown : sig ... end
Main API
val stats : t -> Sidekick_util.Stat.t
val tst : t -> T.Term.store
val ty_st : t -> T.Ty.store
val proof : t -> proof
val create : ?stat:Sidekick_util.Stat.t -> ?size:[ `Big | `Tiny | `Small ] -> proof:proof -> theories:theory list ->
 T.Term.store -> T.Ty.store -> unit -> t
Create a new solver.
It needs a term state and a type state to manipulate terms and types. All terms and types interacting with this solver will need to come from these exact states.
  • parameter store_proof 
    if true, proofs from the SAT solver and theories are retained and potentially accessible after solve returns UNSAT.
  • parameter size 
    influences the size of initial allocations.
  • parameter theories 
    theories to load from the start. Other theories can be added using add_theory.
val add_theory : t -> theory -> unit
Add a theory to the solver. This should be called before any call to solve or to add_clause and the likes (otherwise the theory will have a partial view of the problem).
val add_theory_p : t -> 'a theory_p -> 'a
Add the given theory and obtain its state
val add_theory_l : t -> theory list -> unit
val mk_lit_t : t -> ?sign:bool -> term -> lit
mk_lit_t _ ~sign t returns lit', where lit' is preprocess(lit) and lit is an internal representation of ± t.
The proof of |- lit = lit' is directly added to the solver's proof.
val add_clause : t -> lit Sidekick_util.IArray.t -> proof_step -> unit
add_clause solver cs adds a boolean clause to the solver. Subsequent calls to solve will need to satisfy this clause.
val add_clause_l : t -> lit list -> proof_step -> unit
Add a clause to the solver, given as a list.
val assert_terms : t -> term list -> unit
Helper that turns each term into an atom, before adding the result to the solver as an assertion
val assert_term : t -> term -> unit
Helper that turns the term into an atom, before adding the result to the solver as a unit clause assertion
type res = 
| Sat of Model.t(*
Satisfiable
*)
| Unsat of {
unsat_core : unit -> lit Iter.t;(*
Unsat core (subset of assumptions), or empty
*)
unsat_proof_step : unit -> proof_step option;(*
Proof step for the empty clause
*)
}		(*
Unsatisfiable
*)
| Unknown of Unknown.t(*
Unknown, obtained after a timeout, memory limit, etc.
*)
Result of solving for the current set of clauses
val solve : ?on_exit:(unit -> unit) list -> ?check:bool -> ?on_progress:(t -> unit) ->
 assumptions:lit list -> t -> res
solve s checks the satisfiability of the clauses added so far to s.
  • parameter check 
    if true, the model is checked before returning.
  • parameter on_progress 
    called regularly during solving.
  • parameter assumptions 
    a set of atoms held to be true. The unsat core, if any, will be a subset of assumptions.
  • parameter on_exit 
    functions to be run before this returns
val pp_stats : t CCFormat.printer
Print some statistics. What it prints exactly is unspecified.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/module-type-THEORY/index.html b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/module-type-THEORY/index.html
index 492e1ae4..19f043a3 100644
--- a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/module-type-THEORY/index.html
+++ b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/S/module-type-THEORY/index.html
@@ -1,2 +1,2 @@
 
-THEORY (sidekick.Sidekick_th_data.Make.1-A.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
+THEORY (sidekick.Sidekick_th_data.Make.1-A.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/index.html b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/index.html
index a38aa94c..9aa53dfd 100644
--- a/dev/sidekick/Sidekick_th_data/Make/argument-1-A/index.html
+++ b/dev/sidekick/Sidekick_th_data/Make/argument-1-A/index.html
@@ -1,2 +1,2 @@
 
-A (sidekick.Sidekick_th_data.Make.1-A)
Parameter Make.1-A
module Cstor : sig ... end
val as_datatype : S.T.Ty.t -> (Cstor.t Iter.t, S.T.Ty.t) data_ty_view
val view_as_data : S.T.Term.t -> (Cstor.t, S.T.Term.t) data_view
val mk_sel : S.T.Term.store -> Cstor.t -> int -> S.T.Term.t -> S.T.Term.t
val ty_is_finite : S.T.Ty.t -> bool
val ty_set_is_finite : S.T.Ty.t -> bool -> unit
val lemma_isa_cstor : cstor_t:S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
val lemma_select_cstor : cstor_t:S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
val lemma_isa_split : S.T.Term.t -> S.Lit.t Iter.t -> S.P.t -> S.P.proof_step
val lemma_isa_sel : S.T.Term.t -> S.P.t -> S.P.proof_step
val lemma_isa_disj : S.Lit.t -> S.Lit.t -> S.P.t -> S.P.proof_step
val lemma_cstor_inj : S.T.Term.t -> S.T.Term.t -> int -> S.P.t -> S.P.proof_step
val lemma_cstor_distinct : S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
val lemma_acyclicity : (S.T.Term.t * S.T.Term.t) Iter.t -> S.P.t -> S.P.proof_step

\ No newline at end of file
+A (sidekick.Sidekick_th_data.Make.1-A)
Parameter Make.1-A
module Cstor : sig ... end
Constructor symbols.
val as_datatype : S.T.Ty.t -> (Cstor.t Iter.t, S.T.Ty.t) data_ty_view
Try to view type as a datatype (with its constructors)
val view_as_data : S.T.Term.t -> (Cstor.t, S.T.Term.t) data_view
Try to view term as a datatype term
Make a constructor application term
Make a is-a term
val mk_sel : S.T.Term.store -> Cstor.t -> int -> S.T.Term.t -> S.T.Term.t
Make a selector term
Make a term equality
val ty_is_finite : S.T.Ty.t -> bool
Is the given type known to be finite? For example a finite datatype (an "enum" in C parlance), or Bool, or Array Bool Bool.
val ty_set_is_finite : S.T.Ty.t -> bool -> unit
Modify the "finite" field (see ty_is_finite)
include PROOF with type proof := S.P.t and type proof_step := S.P.proof_step and type term := S.T.Term.t and type lit := S.Lit.t
val lemma_isa_cstor : cstor_t:S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
lemma_isa_cstor (d …) (is-c t) returns the clause (c …) = t |- is-c t or (d …) = t |- ¬ (is-c t)
val lemma_select_cstor : cstor_t:S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
lemma_select_cstor (c t1…tn) (sel-c-i t) returns a proof of t = c t1…tn |- (sel-c-i t) = ti
val lemma_isa_split : S.T.Term.t -> S.Lit.t Iter.t -> S.P.t -> S.P.proof_step
lemma_isa_split t lits is the proof of is-c1 t \/ is-c2 t \/ … \/ is-c_n t
val lemma_isa_sel : S.T.Term.t -> S.P.t -> S.P.proof_step
lemma_isa_sel (is-c t) is the proof of is-c t |- t = c (sel-c-1 t)…(sel-c-n t)
val lemma_isa_disj : S.Lit.t -> S.Lit.t -> S.P.t -> S.P.proof_step
lemma_isa_disj (is-c t) (is-d t) is the proof of ¬ (is-c t) \/ ¬ (is-c t)
val lemma_cstor_inj : S.T.Term.t -> S.T.Term.t -> int -> S.P.t -> S.P.proof_step
lemma_cstor_inj (c t1…tn) (c u1…un) i is the proof of c t1…tn = c u1…un |- ti = ui
val lemma_cstor_distinct : S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
lemma_isa_distinct (c …) (d …) is the proof of the unit clause |- (c …) ≠ (d …)
val lemma_acyclicity : (S.T.Term.t * S.T.Term.t) Iter.t -> S.P.t -> S.P.proof_step
lemma_acyclicity pairs is a proof of t1=u1, …, tn=un |- false by acyclicity.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/Make/index.html b/dev/sidekick/Sidekick_th_data/Make/index.html
index 44afcc5a..87569d1d 100644
--- a/dev/sidekick/Sidekick_th_data/Make/index.html
+++ b/dev/sidekick/Sidekick_th_data/Make/index.html
@@ -1,2 +1,2 @@
 
-Make (sidekick.Sidekick_th_data.Make)
Module Sidekick_th_data.Make
Parameters
module A : ARG
Signature
module A = A
val theory : A.S.theory
A theory that can be added to A.S to perform datatype reasoning.

\ No newline at end of file
+Make (sidekick.Sidekick_th_data.Make)
Module Sidekick_th_data.Make
Parameters
module A : ARG
Signature
module A = A
val theory : A.S.theory
A theory that can be added to A.S to perform datatype reasoning.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/index.html b/dev/sidekick/Sidekick_th_data/index.html
index 862f1c38..dbd339fa 100644
--- a/dev/sidekick/Sidekick_th_data/index.html
+++ b/dev/sidekick/Sidekick_th_data/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_th_data (sidekick.Sidekick_th_data)
Module Sidekick_th_data
Theory for datatypes.
type ('c, 't) data_view = 
| T_cstor of 'c * 't Sidekick_util.IArray.t
| T_select of 'c * int * 't
| T_is_a of 'c * 't
| T_other of 't
Datatype-oriented view of terms.
  • 'c is the representation of constructors
  • 't is the representation of terms
type ('c, 'ty) data_ty_view = 
| Ty_arrow of 'ty Iter.t * 'ty
| Ty_app of {
args : 'ty Iter.t;
}
| Ty_data of {
cstors : 'c;
}
| Ty_other
View of types in a way that is directly useful for the theory of datatypes
module type PROOF = sig ... end
module type ARG = sig ... end
module type S = sig ... end
module Make (A : ARG) : S with module A = A

\ No newline at end of file
+Sidekick_th_data (sidekick.Sidekick_th_data)
Module Sidekick_th_data
Theory for datatypes.
type ('c, 't) data_view = 
| T_cstor of 'c * 't Sidekick_util.IArray.t
| T_select of 'c * int * 't
| T_is_a of 'c * 't
| T_other of 't
Datatype-oriented view of terms.
  • 'c is the representation of constructors
  • 't is the representation of terms
type ('c, 'ty) data_ty_view = 
| Ty_arrow of 'ty Iter.t * 'ty
| Ty_app of {
args : 'ty Iter.t;
}
| Ty_data of {
cstors : 'c;
}
| Ty_other
View of types in a way that is directly useful for the theory of datatypes
module type PROOF = sig ... end
module type ARG = sig ... end
module type S = sig ... end
module Make (A : ARG) : S with module A = A

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-ARG/Cstor/index.html b/dev/sidekick/Sidekick_th_data/module-type-ARG/Cstor/index.html
index 5f374e4b..33cdada8 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-ARG/Cstor/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-ARG/Cstor/index.html
@@ -1,2 +1,2 @@
 
-Cstor (sidekick.Sidekick_th_data.ARG.Cstor)
Module ARG.Cstor
Constructor symbols.
A constructor is an injective symbol, part of a datatype (or "sum type"). For example, in type option a = Some a | None, the constructors are Some and None.
type t
Constructor
val ty_args : t -> S.T.Ty.t Iter.t
Type arguments, for a polymorphic constructor
val pp : t Sidekick_util.Fmt.printer
val equal : t -> t -> bool
Comparison

\ No newline at end of file
+Cstor (sidekick.Sidekick_th_data.ARG.Cstor)
Module ARG.Cstor
Constructor symbols.
A constructor is an injective symbol, part of a datatype (or "sum type"). For example, in type option a = Some a | None, the constructors are Some and None.
type t
Constructor
val ty_args : t -> S.T.Ty.t Iter.t
Type arguments, for a polymorphic constructor
val pp : t Sidekick_util.Fmt.printer
val equal : t -> t -> bool
Comparison

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Lit/index.html b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Lit/index.html
index a673226e..49541c27 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Lit/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_th_data.ARG.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick.Sidekick_th_data.ARG.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Model/index.html b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Model/index.html
index 5580e23c..58a4b9ab 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Model/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Model/index.html
@@ -1,2 +1,2 @@
 
-Model (sidekick.Sidekick_th_data.ARG.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Model (sidekick.Sidekick_th_data.ARG.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/P/Step_vec/index.html b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/P/Step_vec/index.html
index 1c08a908..f43604e5 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/P/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_th_data.ARG.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_th_data.ARG.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/P/index.html b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/P/index.html
index 6589e3ac..d04222e1 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/P/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_data.ARG.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
+P (sidekick.Sidekick_th_data.ARG.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/Actions/P/index.html b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/Actions/P/index.html
index 43651991..8541226c 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/Actions/P/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_data.ARG.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_th_data.ARG.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/Actions/index.html b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/Actions/index.html
index 8ba56195..0630089e 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/Actions/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick.Sidekick_th_data.ARG.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
+Actions (sidekick.Sidekick_th_data.ARG.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/Expl/index.html b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/Expl/index.html
index 1608b7c9..1f735081 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/Expl/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick.Sidekick_th_data.ARG.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick.Sidekick_th_data.ARG.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/N/index.html b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/N/index.html
index eae06a4d..050ace7b 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/N/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick.Sidekick_th_data.ARG.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
+N (sidekick.Sidekick_th_data.ARG.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/P/index.html b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/P/index.html
index 24fefc5c..f1b9f376 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/P/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_data.ARG.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_th_data.ARG.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/index.html b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/index.html
index c2575e9a..2f82b59d 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/CC/index.html
@@ -1,4 +1,4 @@
 
-CC (sidekick.Sidekick_th_data.ARG.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+CC (sidekick.Sidekick_th_data.ARG.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Small | `Big ] -> term_store -> proof -> t
Create a new congruence closure.
  • parameter term_store 
    used to be able to create new terms. All terms interacting with this congruence closure must belong in this term state as well.
val allocate_bitfield : descr:string -> t -> N.bitfield
Allocate a new node field (see N.bitfield).
This field descriptor is henceforth reserved for all nodes in this congruence closure, and can be set using set_bitfield for each node individually. This can be used to efficiently store some metadata on nodes (e.g. "is there a numeric value in the class" or "is there a constructor term in the class").
There may be restrictions on how many distinct fields are allocated for a given congruence closure (e.g. at most Sys.int_size fields).
val get_bitfield : t -> N.bitfield -> N.t -> bool
Access the bit field of the given node
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
Set the bitfield for the node. This will be backtracked. See N.bitfield.
val on_pre_merge : t -> ev_on_pre_merge -> unit
Add a function to be called when two classes are merged
val on_post_merge : t -> ev_on_post_merge -> unit
Add a function to be called when two classes are merged
val on_new_term : t -> ev_on_new_term -> unit
Add a function to be called when a new node is created
val on_conflict : t -> ev_on_conflict -> unit
Called when the congruence closure finds a conflict
val on_propagate : t -> ev_on_propagate -> unit
Called when the congruence closure propagates a literal
val on_is_subterm : t -> ev_on_is_subterm -> unit
Called on terms that are subterms of function symbols
val set_as_lit : t -> N.t -> lit -> unit
map the given node to a literal.
val find_t : t -> term -> repr
Current representative of the term.
  • raises Not_found 
    if the term is not already add-ed.
val add_seq : t -> term Iter.t -> unit
Add a sequence of terms to the congruence closure
val all_classes : t -> repr Iter.t
All current classes. This is costly, only use if there is no other solution
val assert_lit : t -> lit -> unit
Given a literal, assume it in the congruence closure and propagate its consequences. Will be backtracked.
Useful for the theory combination or the SAT solver's functor
val assert_lits : t -> lit Iter.t -> unit
Addition of many literals
val explain_eq : t -> N.t -> N.t -> lit list
Explain why the two nodes are equal. Fails if they are not, in an unspecified way
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
Raise a conflict with the given explanation it must be a theory tautology that expl ==> absurd. To be used in theories.
val n_true : t -> N.t
Node for true
val n_false : t -> N.t
Node for false
val n_bool : t -> bool -> N.t
Node for either true or false
val merge : t -> N.t -> N.t -> Expl.t -> unit
Merge these two nodes given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val merge_t : t -> term -> term -> Expl.t -> unit
Shortcut for adding + merging
val check : t -> actions -> unit
Perform all pending operations done via assert_eq, assert_lit, etc. Will use the actions to propagate literals, declare conflicts, etc.
val new_merges : t -> bool
Called after check, returns true if some pairs of classes were merged.
val push_level : t -> unit
Push backtracking level
val pop_levels : t -> int -> unit
Restore to state n calls to push_level earlier. Used during backtracking.
val get_model : t -> N.t Iter.t Iter.t
get all the equivalence classes so they can be merged in the model

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/Simplify/index.html b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/Simplify/index.html
index abaf2513..2c72d710 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/Simplify/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/Simplify/index.html
@@ -1,2 +1,2 @@
 
-Simplify (sidekick.Sidekick_th_data.ARG.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
+Simplify (sidekick.Sidekick_th_data.ARG.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/index.html b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/index.html
index 092475cf..4140bfe6 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/index.html
@@ -1,3 +1,3 @@
 
-Solver_internal (sidekick.Sidekick_th_data.ARG.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
+Solver_internal (sidekick.Sidekick_th_data.ARG.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
 P.t = proof and type P.lit = lit and type Actions.t = theory_actions
Congruence closure instance
val cc : t -> CC.t
Congruence closure for this solver
Simplifiers
module Simplify : sig ... end
Simplify terms
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
Add a simplifier hook for preprocessing.
val simplify_t : t -> term -> (term * proof_step) option
Simplify input term, returns Some u if some simplification occurred.
val simp_t : t -> term -> term * proof_step option
simp_t si t returns u even if no simplification occurred (in which case t == u syntactically). It emits |- t=u. (see simplifier)
Preprocessors
These preprocessors turn mixed, raw literals (possibly simplified) into literals suitable for reasoning. Typically some clauses are also added to the solver.
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
Actions available to the preprocessor
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
Given a term, try to preprocess it. Return None if it didn't change, or Some (u) if t=u. Can also add clauses to define new terms.
Preprocessing might transform terms to make them more amenable to reasoning, e.g. by removing boolean formulas via Tseitin encoding, adding clauses that encode their meaning in the same move.
  • parameter preprocess_actions 
    actions available during preprocessing.
val on_preprocess : t -> preprocess_hook -> unit
Add a hook that will be called when terms are preprocessed
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
Obtain preprocessor actions, from theory actions
hooks for the theory
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
Give a conflict clause to the solver
val push_decision : t -> theory_actions -> lit -> unit
Ask the SAT solver to decide the given literal in an extension of the current trail. This is useful for theory combination. If the SAT solver backtracks, this (potential) decision is removed and forgotten.
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
Add local clause to the SAT solver. This clause will be removed when the solver backtracks.
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
Add toplevel clause to the SAT solver. This clause will not be backtracked.
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
Create a literal. This automatically preprocesses the term.
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
Preprocess a term.
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
Add the given literal to the SAT solver, so it gets assigned a boolean value.
  • parameter default_pol 
    default polarity for the corresponding atom
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
Add the given (signed) bool term to the SAT solver, so it gets assigned a boolean value
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
Raise a conflict with the given congruence closure explanation. it must be a theory tautology that expl ==> absurd. To be used in theories.
val cc_find : t -> CC.N.t -> CC.N.t
Find representative of the node
val cc_are_equal : t -> term -> term -> bool
Are these two terms equal in the congruence closure?
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
Merge these two nodes in the congruence closure, given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
Merge these two terms in the congruence closure, given this explanation. See cc_merge
val cc_add_term : t -> term -> CC.N.t
Add/retrieve congruence closure node for this term. To be used in theories
val cc_mem_term : t -> term -> bool
Return true if the term is explicitly in the congruence closure. To be used in theories
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called before)
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called after)
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
Callback to add data on terms when they are added to the congruence closure
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
Callback for when a term is a subterm of another term in the congruence closure
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
Callback called on every CC conflict
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
Callback called on every CC propagation
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callbacked to be called with the slice of literals newly added on the trail.
This is called very often and should be efficient. It doesn't have to be complete, only correct. It's given only the slice of the trail consisting in new literals.
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callback to be called during the final check.
Must be complete (i.e. must raise a conflict if the set of literals is not satisfiable) and can be expensive. The function is given the whole trail.
Model production
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
A model-production hook. It takes the solver, a class, and returns a term for this class. For example, an arithmetic theory might detect that a class contains a numeric constant, and return this constant as a model value.
If no hook assigns a value to a class, a fake value is created for it.
val on_model_gen : t -> model_hook -> unit
Add a hook that will be called when a model is being produced

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
index d954df97..66f68aae 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
@@ -1,2 +1,2 @@
 
-PREPROCESS_ACTS (sidekick.Sidekick_th_data.ARG.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
+PREPROCESS_ACTS (sidekick.Sidekick_th_data.ARG.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/T/Fun/index.html b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/T/Fun/index.html
index bdc5f2b4..44126e33 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_th_data.ARG.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_th_data.ARG.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/T/Term/index.html b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/T/Term/index.html
index 08711d01..78c51d15 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/T/Term/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_th_data.ARG.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_th_data.ARG.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/T/Ty/index.html b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/T/Ty/index.html
index 7ae5f8ee..fd6c0b87 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_th_data.ARG.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_th_data.ARG.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/T/index.html b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/T/index.html
index de2c58f3..86f97d99 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/T/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_th_data.ARG.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_th_data.ARG.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Unknown/index.html b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Unknown/index.html
index 0edb0314..b01b45a0 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Unknown/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/Unknown/index.html
@@ -1,2 +1,2 @@
 
-Unknown (sidekick.Sidekick_th_data.ARG.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
+Unknown (sidekick.Sidekick_th_data.ARG.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/index.html b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/index.html
index 1c314f86..bec57266 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/index.html
@@ -1,5 +1,5 @@
 
-S (sidekick.Sidekick_th_data.ARG.S)
Module ARG.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
+S (sidekick.Sidekick_th_data.ARG.S)
Module ARG.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
 ?push_level:('th -> unit) -> ?pop_levels:('th -> int -> unit) -> unit -> theory
Helper to create a theory.
module Model : sig ... end
Models
module Unknown : sig ... end
Main API
val stats : t -> Sidekick_util.Stat.t
val tst : t -> T.Term.store
val ty_st : t -> T.Ty.store
val proof : t -> proof
val create : ?stat:Sidekick_util.Stat.t -> ?size:[ `Big | `Tiny | `Small ] -> proof:proof -> theories:theory list ->
 T.Term.store -> T.Ty.store -> unit -> t
Create a new solver.
It needs a term state and a type state to manipulate terms and types. All terms and types interacting with this solver will need to come from these exact states.
  • parameter store_proof 
    if true, proofs from the SAT solver and theories are retained and potentially accessible after solve returns UNSAT.
  • parameter size 
    influences the size of initial allocations.
  • parameter theories 
    theories to load from the start. Other theories can be added using add_theory.
val add_theory : t -> theory -> unit
Add a theory to the solver. This should be called before any call to solve or to add_clause and the likes (otherwise the theory will have a partial view of the problem).
val add_theory_p : t -> 'a theory_p -> 'a
Add the given theory and obtain its state
val add_theory_l : t -> theory list -> unit
val mk_lit_t : t -> ?sign:bool -> term -> lit
mk_lit_t _ ~sign t returns lit', where lit' is preprocess(lit) and lit is an internal representation of ± t.
The proof of |- lit = lit' is directly added to the solver's proof.
val add_clause : t -> lit Sidekick_util.IArray.t -> proof_step -> unit
add_clause solver cs adds a boolean clause to the solver. Subsequent calls to solve will need to satisfy this clause.
val add_clause_l : t -> lit list -> proof_step -> unit
Add a clause to the solver, given as a list.
val assert_terms : t -> term list -> unit
Helper that turns each term into an atom, before adding the result to the solver as an assertion
val assert_term : t -> term -> unit
Helper that turns the term into an atom, before adding the result to the solver as a unit clause assertion
type res = 
| Sat of Model.t(*
Satisfiable
*)
| Unsat of {
unsat_core : unit -> lit Iter.t;(*
Unsat core (subset of assumptions), or empty
*)
unsat_proof_step : unit -> proof_step option;(*
Proof step for the empty clause
*)
}		(*
Unsatisfiable
*)
| Unknown of Unknown.t(*
Unknown, obtained after a timeout, memory limit, etc.
*)
Result of solving for the current set of clauses
val solve : ?on_exit:(unit -> unit) list -> ?check:bool -> ?on_progress:(t -> unit) ->
 assumptions:lit list -> t -> res
solve s checks the satisfiability of the clauses added so far to s.
  • parameter check 
    if true, the model is checked before returning.
  • parameter on_progress 
    called regularly during solving.
  • parameter assumptions 
    a set of atoms held to be true. The unsat core, if any, will be a subset of assumptions.
  • parameter on_exit 
    functions to be run before this returns
val pp_stats : t CCFormat.printer
Print some statistics. What it prints exactly is unspecified.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/module-type-THEORY/index.html b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/module-type-THEORY/index.html
index fb948231..86a56358 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-ARG/S/module-type-THEORY/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-ARG/S/module-type-THEORY/index.html
@@ -1,2 +1,2 @@
 
-THEORY (sidekick.Sidekick_th_data.ARG.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
+THEORY (sidekick.Sidekick_th_data.ARG.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-ARG/index.html b/dev/sidekick/Sidekick_th_data/module-type-ARG/index.html
index 2780187b..fac563cc 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-ARG/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-ARG/index.html
@@ -1,2 +1,2 @@
 
-ARG (sidekick.Sidekick_th_data.ARG)
Module type Sidekick_th_data.ARG
module Cstor : sig ... end
Constructor symbols.
val as_datatype : S.T.Ty.t -> (Cstor.t Iter.t, S.T.Ty.t) data_ty_view
Try to view type as a datatype (with its constructors)
val view_as_data : S.T.Term.t -> (Cstor.t, S.T.Term.t) data_view
Try to view term as a datatype term
Make a constructor application term
Make a is-a term
val mk_sel : S.T.Term.store -> Cstor.t -> int -> S.T.Term.t -> S.T.Term.t
Make a selector term
Make a term equality
val ty_is_finite : S.T.Ty.t -> bool
Is the given type known to be finite? For example a finite datatype (an "enum" in C parlance), or Bool, or Array Bool Bool.
val ty_set_is_finite : S.T.Ty.t -> bool -> unit
Modify the "finite" field (see ty_is_finite)
include PROOF with type proof := S.P.t and type proof_step := S.P.proof_step and type term := S.T.Term.t and type lit := S.Lit.t
val lemma_isa_cstor : cstor_t:S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
lemma_isa_cstor (d …) (is-c t) returns the clause (c …) = t |- is-c t or (d …) = t |- ¬ (is-c t)
val lemma_select_cstor : cstor_t:S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
lemma_select_cstor (c t1…tn) (sel-c-i t) returns a proof of t = c t1…tn |- (sel-c-i t) = ti
val lemma_isa_split : S.T.Term.t -> S.Lit.t Iter.t -> S.P.t -> S.P.proof_step
lemma_isa_split t lits is the proof of is-c1 t \/ is-c2 t \/ … \/ is-c_n t
val lemma_isa_sel : S.T.Term.t -> S.P.t -> S.P.proof_step
lemma_isa_sel (is-c t) is the proof of is-c t |- t = c (sel-c-1 t)…(sel-c-n t)
val lemma_isa_disj : S.Lit.t -> S.Lit.t -> S.P.t -> S.P.proof_step
lemma_isa_disj (is-c t) (is-d t) is the proof of ¬ (is-c t) \/ ¬ (is-c t)
val lemma_cstor_inj : S.T.Term.t -> S.T.Term.t -> int -> S.P.t -> S.P.proof_step
lemma_cstor_inj (c t1…tn) (c u1…un) i is the proof of c t1…tn = c u1…un |- ti = ui
val lemma_cstor_distinct : S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
lemma_isa_distinct (c …) (d …) is the proof of the unit clause |- (c …) ≠ (d …)
val lemma_acyclicity : (S.T.Term.t * S.T.Term.t) Iter.t -> S.P.t -> S.P.proof_step
lemma_acyclicity pairs is a proof of t1=u1, …, tn=un |- false by acyclicity.

\ No newline at end of file
+ARG (sidekick.Sidekick_th_data.ARG)
Module type Sidekick_th_data.ARG
module Cstor : sig ... end
Constructor symbols.
val as_datatype : S.T.Ty.t -> (Cstor.t Iter.t, S.T.Ty.t) data_ty_view
Try to view type as a datatype (with its constructors)
val view_as_data : S.T.Term.t -> (Cstor.t, S.T.Term.t) data_view
Try to view term as a datatype term
Make a constructor application term
Make a is-a term
val mk_sel : S.T.Term.store -> Cstor.t -> int -> S.T.Term.t -> S.T.Term.t
Make a selector term
Make a term equality
val ty_is_finite : S.T.Ty.t -> bool
Is the given type known to be finite? For example a finite datatype (an "enum" in C parlance), or Bool, or Array Bool Bool.
val ty_set_is_finite : S.T.Ty.t -> bool -> unit
Modify the "finite" field (see ty_is_finite)
include PROOF with type proof := S.P.t and type proof_step := S.P.proof_step and type term := S.T.Term.t and type lit := S.Lit.t
val lemma_isa_cstor : cstor_t:S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
lemma_isa_cstor (d …) (is-c t) returns the clause (c …) = t |- is-c t or (d …) = t |- ¬ (is-c t)
val lemma_select_cstor : cstor_t:S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
lemma_select_cstor (c t1…tn) (sel-c-i t) returns a proof of t = c t1…tn |- (sel-c-i t) = ti
val lemma_isa_split : S.T.Term.t -> S.Lit.t Iter.t -> S.P.t -> S.P.proof_step
lemma_isa_split t lits is the proof of is-c1 t \/ is-c2 t \/ … \/ is-c_n t
val lemma_isa_sel : S.T.Term.t -> S.P.t -> S.P.proof_step
lemma_isa_sel (is-c t) is the proof of is-c t |- t = c (sel-c-1 t)…(sel-c-n t)
val lemma_isa_disj : S.Lit.t -> S.Lit.t -> S.P.t -> S.P.proof_step
lemma_isa_disj (is-c t) (is-d t) is the proof of ¬ (is-c t) \/ ¬ (is-c t)
val lemma_cstor_inj : S.T.Term.t -> S.T.Term.t -> int -> S.P.t -> S.P.proof_step
lemma_cstor_inj (c t1…tn) (c u1…un) i is the proof of c t1…tn = c u1…un |- ti = ui
val lemma_cstor_distinct : S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
lemma_isa_distinct (c …) (d …) is the proof of the unit clause |- (c …) ≠ (d …)
val lemma_acyclicity : (S.T.Term.t * S.T.Term.t) Iter.t -> S.P.t -> S.P.proof_step
lemma_acyclicity pairs is a proof of t1=u1, …, tn=un |- false by acyclicity.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-PROOF/index.html b/dev/sidekick/Sidekick_th_data/module-type-PROOF/index.html
index 7c199fb8..3edbdca9 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-PROOF/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-PROOF/index.html
@@ -1,2 +1,2 @@
 
-PROOF (sidekick.Sidekick_th_data.PROOF)
Module type Sidekick_th_data.PROOF
type term
type lit
type proof_step
type proof
val lemma_isa_cstor : cstor_t:term -> term -> proof -> proof_step
lemma_isa_cstor (d …) (is-c t) returns the clause (c …) = t |- is-c t or (d …) = t |- ¬ (is-c t)
val lemma_select_cstor : cstor_t:term -> term -> proof -> proof_step
lemma_select_cstor (c t1…tn) (sel-c-i t) returns a proof of t = c t1…tn |- (sel-c-i t) = ti
val lemma_isa_split : term -> lit Iter.t -> proof -> proof_step
lemma_isa_split t lits is the proof of is-c1 t \/ is-c2 t \/ … \/ is-c_n t
val lemma_isa_sel : term -> proof -> proof_step
lemma_isa_sel (is-c t) is the proof of is-c t |- t = c (sel-c-1 t)…(sel-c-n t)
val lemma_isa_disj : lit -> lit -> proof -> proof_step
lemma_isa_disj (is-c t) (is-d t) is the proof of ¬ (is-c t) \/ ¬ (is-c t)
val lemma_cstor_inj : term -> term -> int -> proof -> proof_step
lemma_cstor_inj (c t1…tn) (c u1…un) i is the proof of c t1…tn = c u1…un |- ti = ui
val lemma_cstor_distinct : term -> term -> proof -> proof_step
lemma_isa_distinct (c …) (d …) is the proof of the unit clause |- (c …) ≠ (d …)
val lemma_acyclicity : (term * term) Iter.t -> proof -> proof_step
lemma_acyclicity pairs is a proof of t1=u1, …, tn=un |- false by acyclicity.

\ No newline at end of file
+PROOF (sidekick.Sidekick_th_data.PROOF)
Module type Sidekick_th_data.PROOF
type term
type lit
type proof_step
type proof
val lemma_isa_cstor : cstor_t:term -> term -> proof -> proof_step
lemma_isa_cstor (d …) (is-c t) returns the clause (c …) = t |- is-c t or (d …) = t |- ¬ (is-c t)
val lemma_select_cstor : cstor_t:term -> term -> proof -> proof_step
lemma_select_cstor (c t1…tn) (sel-c-i t) returns a proof of t = c t1…tn |- (sel-c-i t) = ti
val lemma_isa_split : term -> lit Iter.t -> proof -> proof_step
lemma_isa_split t lits is the proof of is-c1 t \/ is-c2 t \/ … \/ is-c_n t
val lemma_isa_sel : term -> proof -> proof_step
lemma_isa_sel (is-c t) is the proof of is-c t |- t = c (sel-c-1 t)…(sel-c-n t)
val lemma_isa_disj : lit -> lit -> proof -> proof_step
lemma_isa_disj (is-c t) (is-d t) is the proof of ¬ (is-c t) \/ ¬ (is-c t)
val lemma_cstor_inj : term -> term -> int -> proof -> proof_step
lemma_cstor_inj (c t1…tn) (c u1…un) i is the proof of c t1…tn = c u1…un |- ti = ui
val lemma_cstor_distinct : term -> term -> proof -> proof_step
lemma_isa_distinct (c …) (d …) is the proof of the unit clause |- (c …) ≠ (d …)
val lemma_acyclicity : (term * term) Iter.t -> proof -> proof_step
lemma_acyclicity pairs is a proof of t1=u1, …, tn=un |- false by acyclicity.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-S/A/Cstor/index.html b/dev/sidekick/Sidekick_th_data/module-type-S/A/Cstor/index.html
index 44eb5ddd..a50b53ad 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-S/A/Cstor/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-S/A/Cstor/index.html
@@ -1,2 +1,2 @@
 
-Cstor (sidekick.Sidekick_th_data.S.A.Cstor)
Module A.Cstor
type t
val ty_args : t -> S.T.Ty.t Iter.t
val pp : t Sidekick_util.Fmt.printer
val equal : t -> t -> bool

\ No newline at end of file
+Cstor (sidekick.Sidekick_th_data.S.A.Cstor)
Module A.Cstor
Constructor symbols.
A constructor is an injective symbol, part of a datatype (or "sum type"). For example, in type option a = Some a | None, the constructors are Some and None.
type t
Constructor
val ty_args : t -> S.T.Ty.t Iter.t
Type arguments, for a polymorphic constructor
val pp : t Sidekick_util.Fmt.printer
val equal : t -> t -> bool
Comparison

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Lit/index.html b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Lit/index.html
index 743a70e6..19551514 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Lit/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Lit/index.html
@@ -1,2 +1,2 @@
 
-Lit (sidekick.Sidekick_th_data.S.A.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Lit (sidekick.Sidekick_th_data.S.A.S.Lit)
Module S.Lit
module T = T
Literals depend on terms
type t
A literal
val term : t -> T.Term.t
Get the (positive) term
val sign : t -> bool
Get the sign. A negated literal has sign false.
val neg : t -> t
Take negation of literal. sign (neg lit) = not (sign lit).
val abs : t -> t
abs lit is like lit but always positive, i.e. sign (abs lit) = true
val signed_term : t -> T.Term.t * bool
Return the atom and the sign
val atom : ?sign:bool -> T.Term.store -> T.Term.t -> t
atom store t makes a literal out of a term, possibly normalizing its sign in the process.
  • parameter sign 
    if provided, and sign=false, negate the resulting lit.
val norm_sign : t -> t * bool
norm_sign (+t) is +t, true, and norm_sign (-t) is +t, false. In both cases the term is positive, and the boolean reflects the initial sign.
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Model/index.html b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Model/index.html
index a296e8df..384dfe21 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Model/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Model/index.html
@@ -1,2 +1,2 @@
 
-Model (sidekick.Sidekick_th_data.S.A.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Model (sidekick.Sidekick_th_data.S.A.S.Model)
Module S.Model
Models
A model can be produced when the solver is found to be in a satisfiable state after a call to solve.
type t
val empty : t
val mem : t -> term -> bool
val find : t -> term -> term option
val eval : t -> term -> term option
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/P/Step_vec/index.html b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/P/Step_vec/index.html
index cda3c1f4..49bcb5b8 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/P/Step_vec/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/P/Step_vec/index.html
@@ -1,2 +1,2 @@
 
-Step_vec (sidekick.Sidekick_th_data.S.A.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Step_vec (sidekick.Sidekick_th_data.S.A.S.P.Step_vec)
Module P.Step_vec
A vector of steps
include Sidekick_util.Vec_sig.BASE with type elt = proof_step
include Sidekick_util.Vec_sig.BASE_RO with type elt = proof_step
type elt = proof_step
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Sidekick_util.Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/P/index.html b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/P/index.html
index 43ece9c7..adffb11f 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/P/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_data.S.A.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
+P (sidekick.Sidekick_th_data.S.A.S.P)
Module S.P
type t = proof
The abstract representation of a proof. A proof always proves a clause to be valid (true in every possible interpretation of the problem's assertions, and the theories)
type proof_step = proof_step
Identifier for a proof proof_rule (like a unique ID for a clause previously added/proved)
type term = T.Term.t
type lit = Lit.t
type proof_rule = t -> proof_step
include Sidekick_core.CC_PROOF with type t := t and type lit := lit and type proof_step := proof_step
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.
include Sidekick_core.SAT_PROOF with type t := t and type lit := lit and type proof_step := proof_step and type proof_rule := proof_rule
A vector of steps
val enabled : t -> bool
Returns true if proof production is enabled
val emit_input_clause : lit Iter.t -> proof_rule
Emit an input clause.
val emit_redundant_clause : lit Iter.t -> hyps:proof_step Iter.t -> proof_rule
Emit a clause deduced by the SAT solver, redundant wrt previous clauses. The clause must be RUP wrt hyps.
val emit_unsat_core : lit Iter.t -> proof_rule
Produce a proof of the empty clause given this subset of the assumptions. FIXME: probably needs the list of proof_step that disprove the lits?
val emit_unsat : proof_step -> t -> unit
Signal "unsat" result at the given proof
val del_clause : proof_step -> lit Iter.t -> t -> unit
Forget a clause. Only useful for performance considerations.
val define_term : term -> term -> proof_rule
define_term cst u proof defines the new constant cst as being equal to u. The result is a proof of the clause cst = u
val proof_p1 : proof_step -> proof_step -> proof_rule
proof_p1 p1 p2, where p1 proves the unit clause t=u (t:bool) and p2 proves C \/ t, is the rule that produces C \/ u, i.e unit paramodulation.
val with_defs : proof_step -> proof_step Iter.t -> proof_rule
with_defs pr defs specifies that pr is valid only in a context where the definitions defs are present.
val lemma_true : term -> proof_rule
lemma_true (true) p asserts the clause (true)
val lemma_preprocess : term -> term -> using:proof_step Iter.t -> proof_rule
lemma_preprocess t u ~using p asserts that t = u is a tautology and that t has been preprocessed into u.
The theorem /\_{eqn in using} eqn |- t=u is proved using congruence closure, and then resolved against the clauses using to obtain a unit equality.
From now on, t and u will be used interchangeably.
  • returns 
    a proof_rule ID for the clause (t=u).
val lemma_rw_clause : proof_step -> res:lit Iter.t -> using:proof_step Iter.t -> proof_rule
lemma_rw_clause prc ~res ~using, where prc is the proof of |- c, uses the equations |- p_i = q_i from using to rewrite some literals of c into res. This is used to preprocess literals of a clause (using lemma_preprocess individually).

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/Actions/P/index.html b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/Actions/P/index.html
index 07191a2c..469be97f 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/Actions/P/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/Actions/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_data.S.A.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_th_data.S.A.S.Solver_internal.CC.Actions.P)
Module Actions.P
type proof_step = proof_step
type t = proof
type lit = Lit.t
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/Actions/index.html b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/Actions/index.html
index e7bb74c4..6e111a92 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/Actions/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/Actions/index.html
@@ -1,2 +1,2 @@
 
-Actions (sidekick.Sidekick_th_data.S.A.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
+Actions (sidekick.Sidekick_th_data.S.A.S.Solver_internal.CC.Actions)
Module CC.Actions
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step
An action handle. It is used by the congruence closure to perform the actions below. How it performs the actions is not specified and is solver-specific.
val proof : t -> proof
val raise_conflict : t -> Lit.t list -> proof_step -> 'a
raise_conflict acts c pr declares that c is a tautology of the theory of congruence. This does not return (it should raise an exception).
  • parameter pr 
    the proof of c being a tautology
val propagate : t -> Lit.t -> reason:(unit -> Lit.t list * proof_step) -> unit
propagate acts lit ~reason pr declares that reason() => lit is a tautology.
  • reason() should return a list of literals that are currently true.
  • lit should be a literal of interest (see CC_S.set_as_lit).
This function might never be called, a congruence closure has the right to not propagate and only trigger conflicts.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/Expl/index.html b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/Expl/index.html
index 08096d9f..149e676d 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/Expl/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/Expl/index.html
@@ -1,2 +1,2 @@
 
-Expl (sidekick.Sidekick_th_data.S.A.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
+Expl (sidekick.Sidekick_th_data.S.A.S.Solver_internal.CC.Expl)
Module CC.Expl
Explanations
Explanations are specialized proofs, created by the congruence closure when asked to justify why 2 terms are equal.
type t
val pp : t Sidekick_core.Fmt.printer
val mk_merge : N.t -> N.t -> t
val mk_merge_t : term -> term -> t
val mk_lit : lit -> t
val mk_list : t list -> t
val mk_theory : proof_step -> t list -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/N/index.html b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/N/index.html
index c0ddaa81..d35c3304 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/N/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/N/index.html
@@ -1,2 +1,2 @@
 
-N (sidekick.Sidekick_th_data.S.A.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
+N (sidekick.Sidekick_th_data.S.A.S.Solver_internal.CC.N)
Module CC.N
Equivalence classes.
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 "representative".
All information pertaining to the whole equivalence class is stored in this representative's node.
When two classes become equal (are "merged"), 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.
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.
type t
An equivalent class, containing terms that are proved to be equal.
A value of type t points to a particular term, but see find to get the representative of the class.
val term : t -> term
Term contained in this equivalence class. If is_root n, then term n is the class' representative term.
val equal : t -> t -> bool
Are two classes physically equal? To check for logical equality, use CC.N.equal (CC.find cc n1) (CC.find cc n2) which checks for equality of representatives.
val hash : t -> int
An opaque hash of this node.
val pp : t Sidekick_core.Fmt.printer
Unspecified printing of the node, for example its term, a unique ID, etc.
val is_root : t -> bool
Is the node a root (ie the representative of its class)? See find to get the root.
val iter_class : t -> t Iter.t
Traverse the congruence class. Precondition: is_root n (see find below)
val iter_parents : t -> t Iter.t
Traverse the parents of the class. Precondition: is_root n (see find below)
type bitfield
A field in the bitfield of this node. This should only be allocated when a theory is initialized.
Bitfields are accessed using preallocated keys. See CC_S.allocate_bitfield.
All fields are initially 0, are backtracked automatically, and are merged automatically when classes are merged.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/P/index.html b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/P/index.html
index cd7fba30..f5be8412 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/P/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/P/index.html
@@ -1,2 +1,2 @@
 
-P (sidekick.Sidekick_th_data.S.A.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
+P (sidekick.Sidekick_th_data.S.A.S.Solver_internal.CC.P)
Module CC.P
type proof_step = proof_step
type t = proof
type lit = lit
val lemma_cc : lit Iter.t -> t -> proof_step
lemma_cc proof lits asserts that lits form a tautology for the theory of uninterpreted functions.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/index.html b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/index.html
index 264d53b5..cfd415e8 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/CC/index.html
@@ -1,4 +1,4 @@
 
-CC (sidekick.Sidekick_th_data.S.A.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
+CC (sidekick.Sidekick_th_data.S.A.S.Solver_internal.CC)
Module Solver_internal.CC
Congruence closure instance
first, some aliases.
module T = T
module Lit = Lit
type proof = proof
type proof_step = proof_step
module P : Sidekick_core.CC_PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step with type t = proof with type lit = lit
module Actions : Sidekick_core.CC_ACTIONS with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step with type t = theory_actions
type term_store = T.Term.store
type term = T.Term.t
type fun_ = T.Fun.t
type lit = Lit.t
type actions = Actions.t
type t
The congruence closure object. It contains a fair amount of state and is mutable and backtrackable.
module N : sig ... end
Equivalence classes.
module Expl : sig ... end
Explanations
type node = N.t
A node of the congruence closure
type repr = N.t
Node that is currently a representative
type explanation = Expl.t
Accessors
val term_store : t -> term_store
val proof : t -> proof
val find : t -> node -> repr
Current representative
val add_term : t -> term -> node
Add the term to the congruence closure, if not present already. Will be backtracked.
val mem_term : t -> term -> bool
Returns true if the term is explicitly present in the congruence closure
Events
Events triggered by the congruence closure, to which other plugins can subscribe.
type ev_on_pre_merge = t -> actions -> N.t -> N.t -> Expl.t -> unit
ev_on_pre_merge cc acts n1 n2 expl is called right before n1 and n2 are merged with explanation expl.
type ev_on_post_merge = t -> actions -> N.t -> N.t -> unit
ev_on_post_merge cc acts n1 n2 is called right after n1 and n2 were merged. find cc n1 and find cc n2 will return the same node.
type ev_on_new_term = t -> N.t -> term -> unit
ev_on_new_term cc n t is called whenever a new term t is added to the congruence closure. Its node is n.
type ev_on_conflict = t -> th:bool -> lit list -> unit
ev_on_conflict acts ~th c is called when the congruence closure triggers a conflict by asserting the tautology c.
  • parameter th 
    true if the explanation for this conflict involves at least one "theory" explanation; i.e. some of the equations participating in the conflict are purely syntactic theories like injectivity of constructors.
type ev_on_propagate = t -> lit -> (unit -> lit list * proof_step) -> unit
ev_on_propagate cc lit reason is called whenever reason() => lit is a propagated lemma. See CC_ACTIONS.propagate.
type ev_on_is_subterm = N.t -> term -> unit
ev_on_is_subterm n t is called when n is a subterm of another node for the first time. t is the term corresponding to the node n. This can be useful for theory combination.
val create : ?stat:Sidekick_util.Stat.t -> ?on_pre_merge:ev_on_pre_merge list -> ?on_post_merge:ev_on_post_merge list ->
 ?on_new_term:ev_on_new_term list -> ?on_conflict:ev_on_conflict list -> ?on_propagate:ev_on_propagate list ->
 ?on_is_subterm:ev_on_is_subterm list -> ?size:[ `Small | `Big ] -> term_store -> proof -> t
Create a new congruence closure.
  • parameter term_store 
    used to be able to create new terms. All terms interacting with this congruence closure must belong in this term state as well.
val allocate_bitfield : descr:string -> t -> N.bitfield
Allocate a new node field (see N.bitfield).
This field descriptor is henceforth reserved for all nodes in this congruence closure, and can be set using set_bitfield for each node individually. This can be used to efficiently store some metadata on nodes (e.g. "is there a numeric value in the class" or "is there a constructor term in the class").
There may be restrictions on how many distinct fields are allocated for a given congruence closure (e.g. at most Sys.int_size fields).
val get_bitfield : t -> N.bitfield -> N.t -> bool
Access the bit field of the given node
val set_bitfield : t -> N.bitfield -> bool -> N.t -> unit
Set the bitfield for the node. This will be backtracked. See N.bitfield.
val on_pre_merge : t -> ev_on_pre_merge -> unit
Add a function to be called when two classes are merged
val on_post_merge : t -> ev_on_post_merge -> unit
Add a function to be called when two classes are merged
val on_new_term : t -> ev_on_new_term -> unit
Add a function to be called when a new node is created
val on_conflict : t -> ev_on_conflict -> unit
Called when the congruence closure finds a conflict
val on_propagate : t -> ev_on_propagate -> unit
Called when the congruence closure propagates a literal
val on_is_subterm : t -> ev_on_is_subterm -> unit
Called on terms that are subterms of function symbols
val set_as_lit : t -> N.t -> lit -> unit
map the given node to a literal.
val find_t : t -> term -> repr
Current representative of the term.
  • raises Not_found 
    if the term is not already add-ed.
val add_seq : t -> term Iter.t -> unit
Add a sequence of terms to the congruence closure
val all_classes : t -> repr Iter.t
All current classes. This is costly, only use if there is no other solution
val assert_lit : t -> lit -> unit
Given a literal, assume it in the congruence closure and propagate its consequences. Will be backtracked.
Useful for the theory combination or the SAT solver's functor
val assert_lits : t -> lit Iter.t -> unit
Addition of many literals
val explain_eq : t -> N.t -> N.t -> lit list
Explain why the two nodes are equal. Fails if they are not, in an unspecified way
val raise_conflict_from_expl : t -> actions -> Expl.t -> 'a
Raise a conflict with the given explanation it must be a theory tautology that expl ==> absurd. To be used in theories.
val n_true : t -> N.t
Node for true
val n_false : t -> N.t
Node for false
val n_bool : t -> bool -> N.t
Node for either true or false
val merge : t -> N.t -> N.t -> Expl.t -> unit
Merge these two nodes given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val merge_t : t -> term -> term -> Expl.t -> unit
Shortcut for adding + merging
val check : t -> actions -> unit
Perform all pending operations done via assert_eq, assert_lit, etc. Will use the actions to propagate literals, declare conflicts, etc.
val new_merges : t -> bool
Called after check, returns true if some pairs of classes were merged.
val push_level : t -> unit
Push backtracking level
val pop_levels : t -> int -> unit
Restore to state n calls to push_level earlier. Used during backtracking.
val get_model : t -> N.t Iter.t Iter.t
get all the equivalence classes so they can be merged in the model

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/Simplify/index.html b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/Simplify/index.html
index ece97416..ec0ece8a 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/Simplify/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/Simplify/index.html
@@ -1,2 +1,2 @@
 
-Simplify (sidekick.Sidekick_th_data.S.A.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
+Simplify (sidekick.Sidekick_th_data.S.A.S.Solver_internal.Simplify)
Module Solver_internal.Simplify
Simplify terms
type t
val tst : t -> term_store
val ty_st : t -> ty_store
val clear : t -> unit
Reset internal cache, etc.
val proof : t -> proof
Access proof
type hook = t -> term -> (term * proof_step Iter.t) option
Given a term, try to simplify it. Return None if it didn't change.
A simple example could be a hook that takes a term t, and if t is app "+" (const x) (const y) where x and y are number, returns Some (const (x+y)), and None otherwise.
val normalize : t -> term -> (term * proof_step) option
Normalize a term using all the hooks. This performs a fixpoint, i.e. it only stops when no hook applies anywhere inside the term.
val normalize_t : t -> term -> term * proof_step option
Normalize a term using all the hooks, along with a proof that the simplification is correct. returns t, ø if no simplification occurred.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/index.html b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/index.html
index 9f6a5314..0c11d05e 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/index.html
@@ -1,3 +1,3 @@
 
-Solver_internal (sidekick.Sidekick_th_data.S.A.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
+Solver_internal (sidekick.Sidekick_th_data.S.A.S.Solver_internal)
Module S.Solver_internal
Internal solver, available to theories.
module T = T
module Lit = Lit
type ty = T.Ty.t
type term = T.Term.t
type term_store = T.Term.store
type ty_store = T.Ty.store
type clause_pool
type proof = proof
type proof_step = proof_step
module P = P
type t
Main type for a solver
type solver = t
val tst : t -> term_store
val ty_st : t -> ty_store
val stats : t -> Sidekick_util.Stat.t
val proof : t -> proof
Access the proof object
Actions for the theories
type theory_actions
Handle that the theories can use to perform actions.
type lit = Lit.t
Congruence Closure
module CC : Sidekick_core.CC_S with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and type
 P.t = proof and type P.lit = lit and type Actions.t = theory_actions
Congruence closure instance
val cc : t -> CC.t
Congruence closure for this solver
Simplifiers
module Simplify : sig ... end
Simplify terms
type simplify_hook = Simplify.hook
val add_simplifier : t -> Simplify.hook -> unit
Add a simplifier hook for preprocessing.
val simplify_t : t -> term -> (term * proof_step) option
Simplify input term, returns Some u if some simplification occurred.
val simp_t : t -> term -> term * proof_step option
simp_t si t returns u even if no simplification occurred (in which case t == u syntactically). It emits |- t=u. (see simplifier)
Preprocessors
These preprocessors turn mixed, raw literals (possibly simplified) into literals suitable for reasoning. Typically some clauses are also added to the solver.
module type PREPROCESS_ACTS = sig ... end
type preprocess_actions = (module PREPROCESS_ACTS)
Actions available to the preprocessor
type preprocess_hook = t -> preprocess_actions -> term -> (term * proof_step Iter.t) option
Given a term, try to preprocess it. Return None if it didn't change, or Some (u) if t=u. Can also add clauses to define new terms.
Preprocessing might transform terms to make them more amenable to reasoning, e.g. by removing boolean formulas via Tseitin encoding, adding clauses that encode their meaning in the same move.
  • parameter preprocess_actions 
    actions available during preprocessing.
val on_preprocess : t -> preprocess_hook -> unit
Add a hook that will be called when terms are preprocessed
val preprocess_acts_of_acts : t -> theory_actions -> preprocess_actions
Obtain preprocessor actions, from theory actions
hooks for the theory
val raise_conflict : t -> theory_actions -> lit list -> proof_step -> 'a
Give a conflict clause to the solver
val push_decision : t -> theory_actions -> lit -> unit
Ask the SAT solver to decide the given literal in an extension of the current trail. This is useful for theory combination. If the SAT solver backtracks, this (potential) decision is removed and forgotten.
val propagate : t -> theory_actions -> lit -> reason:(unit -> lit list * proof_step) -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val propagate_l : t -> theory_actions -> lit -> lit list -> proof_step -> unit
Propagate a boolean using a unit clause. expl => lit must be a theory lemma, that is, a T-tautology
val add_clause_temp : t -> theory_actions -> lit list -> proof_step -> unit
Add local clause to the SAT solver. This clause will be removed when the solver backtracks.
val add_clause_permanent : t -> theory_actions -> lit list -> proof_step -> unit
Add toplevel clause to the SAT solver. This clause will not be backtracked.
val mk_lit : t -> theory_actions -> ?sign:bool -> term -> lit
Create a literal. This automatically preprocesses the term.
val preprocess_term : t -> preprocess_actions -> term -> term * proof_step option
Preprocess a term.
val add_lit : t -> theory_actions -> ?default_pol:bool -> lit -> unit
Add the given literal to the SAT solver, so it gets assigned a boolean value.
  • parameter default_pol 
    default polarity for the corresponding atom
val add_lit_t : t -> theory_actions -> ?sign:bool -> term -> unit
Add the given (signed) bool term to the SAT solver, so it gets assigned a boolean value
val cc_raise_conflict_expl : t -> theory_actions -> CC.Expl.t -> 'a
Raise a conflict with the given congruence closure explanation. it must be a theory tautology that expl ==> absurd. To be used in theories.
val cc_find : t -> CC.N.t -> CC.N.t
Find representative of the node
val cc_are_equal : t -> term -> term -> bool
Are these two terms equal in the congruence closure?
val cc_merge : t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit
Merge these two nodes in the congruence closure, given this explanation. It must be a theory tautology that expl ==> n1 = n2. To be used in theories.
val cc_merge_t : t -> theory_actions -> term -> term -> CC.Expl.t -> unit
Merge these two terms in the congruence closure, given this explanation. See cc_merge
val cc_add_term : t -> term -> CC.N.t
Add/retrieve congruence closure node for this term. To be used in theories
val cc_mem_term : t -> term -> bool
Return true if the term is explicitly in the congruence closure. To be used in theories
val on_cc_pre_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> CC.Expl.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called before)
val on_cc_post_merge : t -> (CC.t -> theory_actions -> CC.N.t -> CC.N.t -> unit) -> unit
Callback for when two classes containing data for this key are merged (called after)
val on_cc_new_term : t -> (CC.t -> CC.N.t -> term -> unit) -> unit
Callback to add data on terms when they are added to the congruence closure
val on_cc_is_subterm : t -> (CC.N.t -> term -> unit) -> unit
Callback for when a term is a subterm of another term in the congruence closure
val on_cc_conflict : t -> (CC.t -> th:bool -> lit list -> unit) -> unit
Callback called on every CC conflict
val on_cc_propagate : t -> (CC.t -> lit -> (unit -> lit list * proof_step) -> unit) -> unit
Callback called on every CC propagation
val on_partial_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callbacked to be called with the slice of literals newly added on the trail.
This is called very often and should be efficient. It doesn't have to be complete, only correct. It's given only the slice of the trail consisting in new literals.
val on_final_check : t -> (t -> theory_actions -> lit Iter.t -> unit) -> unit
Register callback to be called during the final check.
Must be complete (i.e. must raise a conflict if the set of literals is not satisfiable) and can be expensive. The function is given the whole trail.
Model production
type model_hook = recurse:(t -> CC.N.t -> term) -> t -> CC.N.t -> term option
A model-production hook. It takes the solver, a class, and returns a term for this class. For example, an arithmetic theory might detect that a class contains a numeric constant, and return this constant as a model value.
If no hook assigns a value to a class, a fake value is created for it.
val on_model_gen : t -> model_hook -> unit
Add a hook that will be called when a model is being produced

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
index 3e51d5ce..eb1223a1 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Solver_internal/module-type-PREPROCESS_ACTS/index.html
@@ -1,2 +1,2 @@
 
-PREPROCESS_ACTS (sidekick.Sidekick_th_data.S.A.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
+PREPROCESS_ACTS (sidekick.Sidekick_th_data.S.A.S.Solver_internal.PREPROCESS_ACTS)
Module type Solver_internal.PREPROCESS_ACTS
val proof : proof
val mk_lit_nopreproc : ?sign:bool -> term -> lit
mk_lit t creates a new literal for a boolean term t.
val mk_lit : ?sign:bool -> term -> lit * proof_step option
mk_lit t creates a new literal for a boolean term t. Also returns an optional proof of preprocessing, which if present is the proof of |- t = lit with lit the result.
val add_clause : lit list -> proof_step -> unit
pushes a new clause into the SAT solver.
val add_lit : ?default_pol:bool -> lit -> unit
Ensure the literal will be decided/handled by the SAT solver.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/T/Fun/index.html b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/T/Fun/index.html
index 214f99df..f67997cf 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/T/Fun/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/T/Fun/index.html
@@ -1,2 +1,2 @@
 
-Fun (sidekick.Sidekick_th_data.S.A.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
+Fun (sidekick.Sidekick_th_data.S.A.S.T.Fun)
Module T.Fun
A function symbol, like "f" or "plus" or "is_human" or "socrates"
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/T/Term/index.html b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/T/Term/index.html
index 7a01027f..2e65c2b1 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/T/Term/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/T/Term/index.html
@@ -1,5 +1,5 @@
 
-Term (sidekick.Sidekick_th_data.S.A.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
+Term (sidekick.Sidekick_th_data.S.A.S.T.Term)
Module T.Term
Term structure.
Terms should be hashconsed, with perfect sharing. This allows, for example, Term.Tbl and Term.iter_dag to be efficient.
type t
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
A store used to create new terms. It is where the hashconsing table should live, along with other all-terms related store.
val ty : t -> Ty.t
val bool : store -> bool -> t
build true/false
val as_bool : t -> bool option
as_bool t is Some true if t is the term true, and similarly for false. For other terms it is None.
val abs : store -> t -> t * bool
abs t returns an "absolute value" for the term, along with the sign of t.
The idea is that we want to turn not a into (a, false), or (a != b) into (a=b, false). For terms without a negation this should return (t, true).
The store is passed in case a new term needs to be created.
val map_shallow : store -> (t -> t) -> t -> t
Map function on immediate subterms. This should not be recursive.
val iter_dag : t -> (t -> unit) -> unit
iter_dag t f calls f once on each subterm of t, t included. It must not traverse t as a tree, but rather as a perfectly shared DAG.
For example, in:
let x = 2 in
 let y = f x x in
 let z = g y x in
 z = z
the DAG has the following nodes:
n1: 2
diff --git a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/T/Ty/index.html b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/T/Ty/index.html
index c8ce33b9..dfccfb15 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/T/Ty/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/T/Ty/index.html
@@ -1,2 +1,2 @@
 
-Ty (sidekick.Sidekick_th_data.S.A.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
+Ty (sidekick.Sidekick_th_data.S.A.S.T.Ty)
Module T.Ty
Types
Types should be comparable (ideally, in O(1)), and have at least a boolean type available.
type t
val equal : t -> t -> bool
val hash : t -> int
val pp : t Sidekick_core.Fmt.printer
type store
val bool : store -> t
val is_bool : t -> bool

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/T/index.html b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/T/index.html
index 12d46ab1..02dc6601 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/T/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/T/index.html
@@ -1,2 +1,2 @@
 
-T (sidekick.Sidekick_th_data.S.A.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
+T (sidekick.Sidekick_th_data.S.A.S.T)
Module S.T
module Fun : sig ... end
A function symbol, like "f" or "plus" or "is_human" or "socrates"
module Ty : sig ... end
Types
module Term : sig ... end
Term structure.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Unknown/index.html b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Unknown/index.html
index 191a3ff8..025b0385 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Unknown/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/Unknown/index.html
@@ -1,2 +1,2 @@
 
-Unknown (sidekick.Sidekick_th_data.S.A.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
+Unknown (sidekick.Sidekick_th_data.S.A.S.Unknown)
Module S.Unknown
type t
val pp : t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/index.html b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/index.html
index f92b660f..faaaad70 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/index.html
@@ -1,5 +1,5 @@
 
-S (sidekick.Sidekick_th_data.S.A.S)
Module A.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
+S (sidekick.Sidekick_th_data.S.A.S)
Module A.S
module Lit : Sidekick_core.LIT with module T = T
type proof
type proof_step
module P : Sidekick_core.PROOF with type lit = Lit.t and type t = proof and type proof_step = proof_step and type term = T.Term.t
module Solver_internal : Sidekick_core.SOLVER_INTERNAL with module T = T and module Lit = Lit and type proof = proof and type proof_step = proof_step and module P = P
Internal solver, available to theories.
type t
The solver's state.
type solver = t
type term = T.Term.t
type ty = T.Ty.t
type lit = Lit.t
module type THEORY = sig ... end
type theory = (module THEORY)
A theory that can be used for this particular solver.
type 'a theory_p = (module THEORY with type t = 'a)
A theory that can be used for this particular solver, with state of type 'a.
val mk_theory : name:string -> create_and_setup:(Solver_internal.t -> 'th) ->
 ?push_level:('th -> unit) -> ?pop_levels:('th -> int -> unit) -> unit -> theory
Helper to create a theory.
module Model : sig ... end
Models
module Unknown : sig ... end
Main API
val stats : t -> Sidekick_util.Stat.t
val tst : t -> T.Term.store
val ty_st : t -> T.Ty.store
val proof : t -> proof
val create : ?stat:Sidekick_util.Stat.t -> ?size:[ `Big | `Tiny | `Small ] -> proof:proof -> theories:theory list ->
 T.Term.store -> T.Ty.store -> unit -> t
Create a new solver.
It needs a term state and a type state to manipulate terms and types. All terms and types interacting with this solver will need to come from these exact states.
  • parameter store_proof 
    if true, proofs from the SAT solver and theories are retained and potentially accessible after solve returns UNSAT.
  • parameter size 
    influences the size of initial allocations.
  • parameter theories 
    theories to load from the start. Other theories can be added using add_theory.
val add_theory : t -> theory -> unit
Add a theory to the solver. This should be called before any call to solve or to add_clause and the likes (otherwise the theory will have a partial view of the problem).
val add_theory_p : t -> 'a theory_p -> 'a
Add the given theory and obtain its state
val add_theory_l : t -> theory list -> unit
val mk_lit_t : t -> ?sign:bool -> term -> lit
mk_lit_t _ ~sign t returns lit', where lit' is preprocess(lit) and lit is an internal representation of ± t.
The proof of |- lit = lit' is directly added to the solver's proof.
val add_clause : t -> lit Sidekick_util.IArray.t -> proof_step -> unit
add_clause solver cs adds a boolean clause to the solver. Subsequent calls to solve will need to satisfy this clause.
val add_clause_l : t -> lit list -> proof_step -> unit
Add a clause to the solver, given as a list.
val assert_terms : t -> term list -> unit
Helper that turns each term into an atom, before adding the result to the solver as an assertion
val assert_term : t -> term -> unit
Helper that turns the term into an atom, before adding the result to the solver as a unit clause assertion
type res = 
| Sat of Model.t(*
Satisfiable
*)
| Unsat of {
unsat_core : unit -> lit Iter.t;(*
Unsat core (subset of assumptions), or empty
*)
unsat_proof_step : unit -> proof_step option;(*
Proof step for the empty clause
*)
}		(*
Unsatisfiable
*)
| Unknown of Unknown.t(*
Unknown, obtained after a timeout, memory limit, etc.
*)
Result of solving for the current set of clauses
val solve : ?on_exit:(unit -> unit) list -> ?check:bool -> ?on_progress:(t -> unit) ->
 assumptions:lit list -> t -> res
solve s checks the satisfiability of the clauses added so far to s.
  • parameter check 
    if true, the model is checked before returning.
  • parameter on_progress 
    called regularly during solving.
  • parameter assumptions 
    a set of atoms held to be true. The unsat core, if any, will be a subset of assumptions.
  • parameter on_exit 
    functions to be run before this returns
val pp_stats : t CCFormat.printer
Print some statistics. What it prints exactly is unspecified.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/module-type-THEORY/index.html b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/module-type-THEORY/index.html
index 58a4be87..45ee521d 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-S/A/S/module-type-THEORY/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-S/A/S/module-type-THEORY/index.html
@@ -1,2 +1,2 @@
 
-THEORY (sidekick.Sidekick_th_data.S.A.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
+THEORY (sidekick.Sidekick_th_data.S.A.S.THEORY)
Module type S.THEORY
A theory
Theories are abstracted over the concrete implementation of the solver, so they can work with any implementation.
Typically a theory should be a functor taking an argument containing a SOLVER_INTERNAL or even a full SOLVER, and some additional views on terms, literals, etc. that are specific to the theory (e.g. to map terms to linear expressions). The theory can then be instantiated on any kind of solver for any term representation that also satisfies the additional theory-specific requirements. Instantiated theories (ie values of type SOLVER.theory) can be added to the solver.
type t
The theory's state
val name : string
Name of the theory (ideally, unique and short)
val create_and_setup : Solver_internal.t -> t
Instantiate the theory's state for the given (internal) solver, register callbacks, create keys, etc.
Called once for every solver this theory is added to.
val push_level : t -> unit
Push backtracking level. When the corresponding pop is called, the theory's state should be restored to a state equivalent to what it was just before push_level.
it does not have to be exactly the same state, it just needs to be equivalent.
val pop_levels : t -> int -> unit
pop_levels theory n pops n backtracking levels, restoring theory to its state before calling push_level n times.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-S/A/index.html b/dev/sidekick/Sidekick_th_data/module-type-S/A/index.html
index da702034..6de28ed8 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-S/A/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-S/A/index.html
@@ -1,2 +1,2 @@
 
-A (sidekick.Sidekick_th_data.S.A)
Module S.A
module Cstor : sig ... end
val as_datatype : S.T.Ty.t -> (Cstor.t Iter.t, S.T.Ty.t) data_ty_view
val view_as_data : S.T.Term.t -> (Cstor.t, S.T.Term.t) data_view
val mk_sel : S.T.Term.store -> Cstor.t -> int -> S.T.Term.t -> S.T.Term.t
val ty_is_finite : S.T.Ty.t -> bool
val ty_set_is_finite : S.T.Ty.t -> bool -> unit
val lemma_isa_cstor : cstor_t:S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
val lemma_select_cstor : cstor_t:S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
val lemma_isa_split : S.T.Term.t -> S.Lit.t Iter.t -> S.P.t -> S.P.proof_step
val lemma_isa_sel : S.T.Term.t -> S.P.t -> S.P.proof_step
val lemma_isa_disj : S.Lit.t -> S.Lit.t -> S.P.t -> S.P.proof_step
val lemma_cstor_inj : S.T.Term.t -> S.T.Term.t -> int -> S.P.t -> S.P.proof_step
val lemma_cstor_distinct : S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
val lemma_acyclicity : (S.T.Term.t * S.T.Term.t) Iter.t -> S.P.t -> S.P.proof_step

\ No newline at end of file
+A (sidekick.Sidekick_th_data.S.A)
Module S.A
module Cstor : sig ... end
Constructor symbols.
val as_datatype : S.T.Ty.t -> (Cstor.t Iter.t, S.T.Ty.t) data_ty_view
Try to view type as a datatype (with its constructors)
val view_as_data : S.T.Term.t -> (Cstor.t, S.T.Term.t) data_view
Try to view term as a datatype term
Make a constructor application term
Make a is-a term
val mk_sel : S.T.Term.store -> Cstor.t -> int -> S.T.Term.t -> S.T.Term.t
Make a selector term
Make a term equality
val ty_is_finite : S.T.Ty.t -> bool
Is the given type known to be finite? For example a finite datatype (an "enum" in C parlance), or Bool, or Array Bool Bool.
val ty_set_is_finite : S.T.Ty.t -> bool -> unit
Modify the "finite" field (see ty_is_finite)
include PROOF with type proof := S.P.t and type proof_step := S.P.proof_step and type term := S.T.Term.t and type lit := S.Lit.t
val lemma_isa_cstor : cstor_t:S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
lemma_isa_cstor (d …) (is-c t) returns the clause (c …) = t |- is-c t or (d …) = t |- ¬ (is-c t)
val lemma_select_cstor : cstor_t:S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
lemma_select_cstor (c t1…tn) (sel-c-i t) returns a proof of t = c t1…tn |- (sel-c-i t) = ti
val lemma_isa_split : S.T.Term.t -> S.Lit.t Iter.t -> S.P.t -> S.P.proof_step
lemma_isa_split t lits is the proof of is-c1 t \/ is-c2 t \/ … \/ is-c_n t
val lemma_isa_sel : S.T.Term.t -> S.P.t -> S.P.proof_step
lemma_isa_sel (is-c t) is the proof of is-c t |- t = c (sel-c-1 t)…(sel-c-n t)
val lemma_isa_disj : S.Lit.t -> S.Lit.t -> S.P.t -> S.P.proof_step
lemma_isa_disj (is-c t) (is-d t) is the proof of ¬ (is-c t) \/ ¬ (is-c t)
val lemma_cstor_inj : S.T.Term.t -> S.T.Term.t -> int -> S.P.t -> S.P.proof_step
lemma_cstor_inj (c t1…tn) (c u1…un) i is the proof of c t1…tn = c u1…un |- ti = ui
val lemma_cstor_distinct : S.T.Term.t -> S.T.Term.t -> S.P.t -> S.P.proof_step
lemma_isa_distinct (c …) (d …) is the proof of the unit clause |- (c …) ≠ (d …)
val lemma_acyclicity : (S.T.Term.t * S.T.Term.t) Iter.t -> S.P.t -> S.P.proof_step
lemma_acyclicity pairs is a proof of t1=u1, …, tn=un |- false by acyclicity.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data/module-type-S/index.html b/dev/sidekick/Sidekick_th_data/module-type-S/index.html
index 08087c0f..1fb90c6b 100644
--- a/dev/sidekick/Sidekick_th_data/module-type-S/index.html
+++ b/dev/sidekick/Sidekick_th_data/module-type-S/index.html
@@ -1,2 +1,2 @@
 
-S (sidekick.Sidekick_th_data.S)
Module type Sidekick_th_data.S
module A : ARG
val theory : A.S.theory
A theory that can be added to A.S to perform datatype reasoning.

\ No newline at end of file
+S (sidekick.Sidekick_th_data.S)
Module type Sidekick_th_data.S
module A : ARG
val theory : A.S.theory
A theory that can be added to A.S to perform datatype reasoning.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data__/index.html b/dev/sidekick/Sidekick_th_data__/index.html
index 720fd9fb..b14420ba 100644
--- a/dev/sidekick/Sidekick_th_data__/index.html
+++ b/dev/sidekick/Sidekick_th_data__/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_th_data__ (sidekick.Sidekick_th_data__)
Module Sidekick_th_data__

\ No newline at end of file
+Sidekick_th_data__ (sidekick.Sidekick_th_data__)
Module Sidekick_th_data__

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data__Th_intf/index.html b/dev/sidekick/Sidekick_th_data__Th_intf/index.html
index 296c7b8f..2764b283 100644
--- a/dev/sidekick/Sidekick_th_data__Th_intf/index.html
+++ b/dev/sidekick/Sidekick_th_data__Th_intf/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_th_data__Th_intf (sidekick.Sidekick_th_data__Th_intf)
Module Sidekick_th_data__Th_intf

\ No newline at end of file
+Sidekick_th_data__Th_intf (sidekick.Sidekick_th_data__Th_intf)
Module Sidekick_th_data__Th_intf

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_th_data__Types/index.html b/dev/sidekick/Sidekick_th_data__Types/index.html
index 3b06f2bd..3fc59081 100644
--- a/dev/sidekick/Sidekick_th_data__Types/index.html
+++ b/dev/sidekick/Sidekick_th_data__Types/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_th_data__Types (sidekick.Sidekick_th_data__Types)
Module Sidekick_th_data__Types

\ No newline at end of file
+Sidekick_th_data__Types (sidekick.Sidekick_th_data__Types)
Module Sidekick_th_data__Types

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Backtrack_stack/index.html b/dev/sidekick/Sidekick_util/Backtrack_stack/index.html
index f71ae54e..11056d04 100644
--- a/dev/sidekick/Sidekick_util/Backtrack_stack/index.html
+++ b/dev/sidekick/Sidekick_util/Backtrack_stack/index.html
@@ -1,2 +1,2 @@
 
-Backtrack_stack (sidekick.Sidekick_util.Backtrack_stack)
Module Sidekick_util.Backtrack_stack
A backtracking stack
type 'a t
val create : unit -> 'a t
val push : 'a t -> 'a -> unit
Push an element onto the stack
val push_if_nonzero_level : 'a t -> 'a -> unit
Push an element onto the stack if level > 0
val n_levels : _ t -> int
Number of levels
val push_level : _ t -> unit
Push a backtracking point
val pop_levels : 'a t -> int -> f:('a -> unit) -> unit
pop_levels st n ~f removes n levels, calling f on every removed item
val iter : f:('a -> unit) -> 'a t -> unit

\ No newline at end of file
+Backtrack_stack (sidekick.Sidekick_util.Backtrack_stack)
Module Sidekick_util.Backtrack_stack
A backtracking stack
type 'a t
val create : unit -> 'a t
val push : 'a t -> 'a -> unit
Push an element onto the stack
val push_if_nonzero_level : 'a t -> 'a -> unit
Push an element onto the stack if level > 0
val n_levels : _ t -> int
Number of levels
val push_level : _ t -> unit
Push a backtracking point
val pop_levels : 'a t -> int -> f:('a -> unit) -> unit
pop_levels st n ~f removes n levels, calling f on every removed item
val iter : f:('a -> unit) -> 'a t -> unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Backtrackable_tbl/Make/argument-1-A/index.html b/dev/sidekick/Sidekick_util/Backtrackable_tbl/Make/argument-1-A/index.html
index 0801ef4e..755c2a4f 100644
--- a/dev/sidekick/Sidekick_util/Backtrackable_tbl/Make/argument-1-A/index.html
+++ b/dev/sidekick/Sidekick_util/Backtrackable_tbl/Make/argument-1-A/index.html
@@ -1,2 +1,2 @@
 
-A (sidekick.Sidekick_util.Backtrackable_tbl.Make.1-A)
Parameter Make.1-A
type t
val equal : t -> t -> bool
val hash : t -> int

\ No newline at end of file
+A (sidekick.Sidekick_util.Backtrackable_tbl.Make.1-A)
Parameter Make.1-A
type t
val equal : t -> t -> bool
val hash : t -> int

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Backtrackable_tbl/Make/index.html b/dev/sidekick/Sidekick_util/Backtrackable_tbl/Make/index.html
index 2f04fc47..6ccc3b8a 100644
--- a/dev/sidekick/Sidekick_util/Backtrackable_tbl/Make/index.html
+++ b/dev/sidekick/Sidekick_util/Backtrackable_tbl/Make/index.html
@@ -1,2 +1,2 @@
 
-Make (sidekick.Sidekick_util.Backtrackable_tbl.Make)
Module Backtrackable_tbl.Make
Parameters
module A : ARG
Signature
type key = A.t
type 'a t
val create : ?size:int -> unit -> 'a t
val find : 'a t -> key -> 'a
  • raises Not_found 
    if the key is not present
val get : 'a t -> key -> 'a option
val mem : _ t -> key -> bool
val length : _ t -> int
val iter : (key -> 'a -> unit) -> 'a t -> unit
val to_iter : 'a t -> (key * 'a) Iter.t
val add : 'a t -> key -> 'a -> unit
val remove : _ t -> key -> unit
val push_level : _ t -> unit
val pop_levels : _ t -> int -> unit

\ No newline at end of file
+Make (sidekick.Sidekick_util.Backtrackable_tbl.Make)
Module Backtrackable_tbl.Make
Parameters
module A : ARG
Signature
type key = A.t
type 'a t
val create : ?size:int -> unit -> 'a t
val find : 'a t -> key -> 'a
  • raises Not_found 
    if the key is not present
val get : 'a t -> key -> 'a option
val mem : _ t -> key -> bool
val length : _ t -> int
val iter : (key -> 'a -> unit) -> 'a t -> unit
val to_iter : 'a t -> (key * 'a) Iter.t
val add : 'a t -> key -> 'a -> unit
val remove : _ t -> key -> unit
val push_level : _ t -> unit
val pop_levels : _ t -> int -> unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Backtrackable_tbl/index.html b/dev/sidekick/Sidekick_util/Backtrackable_tbl/index.html
index fa9592a5..096c0e96 100644
--- a/dev/sidekick/Sidekick_util/Backtrackable_tbl/index.html
+++ b/dev/sidekick/Sidekick_util/Backtrackable_tbl/index.html
@@ -1,2 +1,2 @@
 
-Backtrackable_tbl (sidekick.Sidekick_util.Backtrackable_tbl)
Module Sidekick_util.Backtrackable_tbl
A backtrackable hashtable
module type S = sig ... end
module type ARG = sig ... end
module Make (A : ARG) : S with type key = A.t

\ No newline at end of file
+Backtrackable_tbl (sidekick.Sidekick_util.Backtrackable_tbl)
Module Sidekick_util.Backtrackable_tbl
A backtrackable hashtable
module type S = sig ... end
module type ARG = sig ... end
module Make (A : ARG) : S with type key = A.t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Backtrackable_tbl/module-type-ARG/index.html b/dev/sidekick/Sidekick_util/Backtrackable_tbl/module-type-ARG/index.html
index 02ab7e3e..599ec984 100644
--- a/dev/sidekick/Sidekick_util/Backtrackable_tbl/module-type-ARG/index.html
+++ b/dev/sidekick/Sidekick_util/Backtrackable_tbl/module-type-ARG/index.html
@@ -1,2 +1,2 @@
 
-ARG (sidekick.Sidekick_util.Backtrackable_tbl.ARG)
Module type Backtrackable_tbl.ARG
type t
val equal : t -> t -> bool
val hash : t -> int

\ No newline at end of file
+ARG (sidekick.Sidekick_util.Backtrackable_tbl.ARG)
Module type Backtrackable_tbl.ARG
type t
val equal : t -> t -> bool
val hash : t -> int

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Backtrackable_tbl/module-type-S/index.html b/dev/sidekick/Sidekick_util/Backtrackable_tbl/module-type-S/index.html
index 8eafee88..74703f16 100644
--- a/dev/sidekick/Sidekick_util/Backtrackable_tbl/module-type-S/index.html
+++ b/dev/sidekick/Sidekick_util/Backtrackable_tbl/module-type-S/index.html
@@ -1,2 +1,2 @@
 
-S (sidekick.Sidekick_util.Backtrackable_tbl.S)
Module type Backtrackable_tbl.S
type key
type 'a t
val create : ?size:int -> unit -> 'a t
val find : 'a t -> key -> 'a
  • raises Not_found 
    if the key is not present
val get : 'a t -> key -> 'a option
val mem : _ t -> key -> bool
val length : _ t -> int
val iter : (key -> 'a -> unit) -> 'a t -> unit
val to_iter : 'a t -> (key * 'a) Iter.t
val add : 'a t -> key -> 'a -> unit
val remove : _ t -> key -> unit
val push_level : _ t -> unit
val pop_levels : _ t -> int -> unit

\ No newline at end of file
+S (sidekick.Sidekick_util.Backtrackable_tbl.S)
Module type Backtrackable_tbl.S
type key
type 'a t
val create : ?size:int -> unit -> 'a t
val find : 'a t -> key -> 'a
  • raises Not_found 
    if the key is not present
val get : 'a t -> key -> 'a option
val mem : _ t -> key -> bool
val length : _ t -> int
val iter : (key -> 'a -> unit) -> 'a t -> unit
val to_iter : 'a t -> (key * 'a) Iter.t
val add : 'a t -> key -> 'a -> unit
val remove : _ t -> key -> unit
val push_level : _ t -> unit
val pop_levels : _ t -> int -> unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Bag/index.html b/dev/sidekick/Sidekick_util/Bag/index.html
index a96f001a..bc7dd1f8 100644
--- a/dev/sidekick/Sidekick_util/Bag/index.html
+++ b/dev/sidekick/Sidekick_util/Bag/index.html
@@ -1,2 +1,2 @@
 
-Bag (sidekick.Sidekick_util.Bag)
Module Sidekick_util.Bag
Ordered Bag of Elements
A data structure where we can have duplicate elements, optimized for fast concatenation and size.
type +'a t = private 
| E
| L of 'a
| N of 'a t * 'a t
val empty : 'a t
val is_empty : _ t -> bool
val return : 'a -> 'a t
val cons : 'a -> 'a t -> 'a t
val snoc : 'a t -> 'a -> 'a t
val append : 'a t -> 'a t -> 'a t
val of_iter : 'a Iter.t -> 'a t
val to_iter : 'a t -> 'a Iter.t
val fold : ('a -> 'b -> 'a) -> 'a -> 'b t -> 'a
val iter : ('a -> unit) -> 'a t -> unit
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
Are the two bags equal, element wise?

\ No newline at end of file
+Bag (sidekick.Sidekick_util.Bag)
Module Sidekick_util.Bag
Ordered Bag of Elements
A data structure where we can have duplicate elements, optimized for fast concatenation and size.
type +'a t = private 
| E
| L of 'a
| N of 'a t * 'a t
val empty : 'a t
val is_empty : _ t -> bool
val return : 'a -> 'a t
val cons : 'a -> 'a t -> 'a t
val snoc : 'a t -> 'a -> 'a t
val append : 'a t -> 'a t -> 'a t
val of_iter : 'a Iter.t -> 'a t
val to_iter : 'a t -> 'a Iter.t
val fold : ('a -> 'b -> 'a) -> 'a -> 'b t -> 'a
val iter : ('a -> unit) -> 'a t -> unit
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
Are the two bags equal, element wise?

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Bitvec/index.html b/dev/sidekick/Sidekick_util/Bitvec/index.html
index c8ebad5f..45275078 100644
--- a/dev/sidekick/Sidekick_util/Bitvec/index.html
+++ b/dev/sidekick/Sidekick_util/Bitvec/index.html
@@ -1,2 +1,2 @@
 
-Bitvec (sidekick.Sidekick_util.Bitvec)
Module Sidekick_util.Bitvec
Bitvector
type t
val create : unit -> t
val ensure_size : t -> int -> unit
ensure_size bv i ensures that i is a valid index in bv
val get : t -> int -> bool
val set : t -> int -> bool -> unit
val clear_all : t -> unit

\ No newline at end of file
+Bitvec (sidekick.Sidekick_util.Bitvec)
Module Sidekick_util.Bitvec
Bitvector
type t
val create : unit -> t
val ensure_size : t -> int -> unit
ensure_size bv i ensures that i is a valid index in bv
val get : t -> int -> bool
val set : t -> int -> bool -> unit
val clear_all : t -> unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Chunk_stack/Buf/index.html b/dev/sidekick/Sidekick_util/Chunk_stack/Buf/index.html
index 9152ac84..84196e90 100644
--- a/dev/sidekick/Sidekick_util/Chunk_stack/Buf/index.html
+++ b/dev/sidekick/Sidekick_util/Chunk_stack/Buf/index.html
@@ -1,2 +1,2 @@
 
-Buf (sidekick.Sidekick_util.Chunk_stack.Buf)
Module Chunk_stack.Buf
A hand made buffer
type t = {
mutable b : bytes;
mutable len : int;
}
val create : ?cap:int -> unit -> t
val clear : t -> unit
val contents : t -> string

\ No newline at end of file
+Buf (sidekick.Sidekick_util.Chunk_stack.Buf)
Module Chunk_stack.Buf
A hand made buffer
type t = {
mutable b : bytes;
mutable len : int;
}
val create : ?cap:int -> unit -> t
val clear : t -> unit
val contents : t -> string

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Chunk_stack/Reader/index.html b/dev/sidekick/Sidekick_util/Chunk_stack/Reader/index.html
index 294db352..3e648aae 100644
--- a/dev/sidekick/Sidekick_util/Chunk_stack/Reader/index.html
+++ b/dev/sidekick/Sidekick_util/Chunk_stack/Reader/index.html
@@ -1,2 +1,2 @@
 
-Reader (sidekick.Sidekick_util.Chunk_stack.Reader)
Module Chunk_stack.Reader
type t
val next : t -> yield:(bytes -> int -> int -> 'a) -> finish:(unit -> 'a) -> 'a
Read next chunk, call yield with a slice of bytes, otherwise call finish().
val next_string : t -> string option
Read next chunk as a string
val empty : t
val from_buf : Buf.t -> t
val from_channel_backward : ?close_at_end:bool -> Stdlib.in_channel -> t
Read channel from the end, assuming that is possible.
val with_file_backward : string -> (t -> 'a) -> 'a
read_file_backward filename f calls f with an iterator over chunks of the file, read from the end.
Each chunk is assumed to be followed by its length as an int32 LE.

\ No newline at end of file
+Reader (sidekick.Sidekick_util.Chunk_stack.Reader)
Module Chunk_stack.Reader
type t
val next : t -> yield:(bytes -> int -> int -> 'a) -> finish:(unit -> 'a) -> 'a
Read next chunk, call yield with a slice of bytes, otherwise call finish().
val next_string : t -> string option
Read next chunk as a string
val empty : t
val from_buf : Buf.t -> t
val from_channel_backward : ?close_at_end:bool -> Stdlib.in_channel -> t
Read channel from the end, assuming that is possible.
val with_file_backward : string -> (t -> 'a) -> 'a
read_file_backward filename f calls f with an iterator over chunks of the file, read from the end.
Each chunk is assumed to be followed by its length as an int32 LE.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Chunk_stack/Writer/index.html b/dev/sidekick/Sidekick_util/Chunk_stack/Writer/index.html
index cae1c00d..a2ae22f8 100644
--- a/dev/sidekick/Sidekick_util/Chunk_stack/Writer/index.html
+++ b/dev/sidekick/Sidekick_util/Chunk_stack/Writer/index.html
@@ -1,2 +1,2 @@
 
-Writer (sidekick.Sidekick_util.Chunk_stack.Writer)
Module Chunk_stack.Writer
Create a stack of chunks.
type t
val dummy : t
val into_buf : Buf.t -> t
val into_channel : Stdlib.out_channel -> t
val add_buf : t -> Buf.t -> unit
val add_bytes : t -> bytes -> int -> int -> unit
val add_string : t -> string -> unit
val add_buffer : t -> Stdlib.Buffer.t -> unit

\ No newline at end of file
+Writer (sidekick.Sidekick_util.Chunk_stack.Writer)
Module Chunk_stack.Writer
Create a stack of chunks.
type t
val dummy : t
val into_buf : Buf.t -> t
val into_channel : Stdlib.out_channel -> t
val add_buf : t -> Buf.t -> unit
val add_bytes : t -> bytes -> int -> int -> unit
val add_string : t -> string -> unit
val add_buffer : t -> Stdlib.Buffer.t -> unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Chunk_stack/index.html b/dev/sidekick/Sidekick_util/Chunk_stack/index.html
index 5e3c843b..86ad80b6 100644
--- a/dev/sidekick/Sidekick_util/Chunk_stack/index.html
+++ b/dev/sidekick/Sidekick_util/Chunk_stack/index.html
@@ -1,2 +1,2 @@
 
-Chunk_stack (sidekick.Sidekick_util.Chunk_stack)
Module Sidekick_util.Chunk_stack
Manage a list of chunks.
A chunk is used for serializing proof traces, possibly on disk. This way we do not have to keep the whole proof in memory. Each chunk is typically one step of the proof search.
We produce chunks in forward order (chronological order of their discovery), but once we find a proof of "false", we work our way backward to find chunks transitively needed by this proof of false. Once we obtain this subset of the chunks (as a graph in memory) we can emit a proper proof with no redundant information.
module Buf : sig ... end
A hand made buffer
module Writer : sig ... end
Create a stack of chunks.
module Reader : sig ... end

\ No newline at end of file
+Chunk_stack (sidekick.Sidekick_util.Chunk_stack)
Module Sidekick_util.Chunk_stack
Manage a list of chunks.
A chunk is used for serializing proof traces, possibly on disk. This way we do not have to keep the whole proof in memory. Each chunk is typically one step of the proof search.
We produce chunks in forward order (chronological order of their discovery), but once we find a proof of "false", we work our way backward to find chunks transitively needed by this proof of false. Once we obtain this subset of the chunks (as a graph in memory) we can emit a proper proof with no redundant information.
module Buf : sig ... end
A hand made buffer
module Writer : sig ... end
Create a stack of chunks.
module Reader : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Error/index.html b/dev/sidekick/Sidekick_util/Error/index.html
index cfa1c9b1..c2bbfee3 100644
--- a/dev/sidekick/Sidekick_util/Error/index.html
+++ b/dev/sidekick/Sidekick_util/Error/index.html
@@ -1,2 +1,2 @@
 
-Error (sidekick.Sidekick_util.Error)
Module Sidekick_util.Error
exception Error of string
val errorf : ('a, Stdlib.Format.formatter, unit, 'b) Stdlib.format4 -> 'a
  • raises Error 
    when called

\ No newline at end of file
+Error (sidekick.Sidekick_util.Error)
Module Sidekick_util.Error
exception Error of string
val errorf : ('a, Stdlib.Format.formatter, unit, 'b) Stdlib.format4 -> 'a
  • raises Error 
    when called

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Hash/index.html b/dev/sidekick/Sidekick_util/Hash/index.html
index 77e96bf6..c12b0c70 100644
--- a/dev/sidekick/Sidekick_util/Hash/index.html
+++ b/dev/sidekick/Sidekick_util/Hash/index.html
@@ -1,2 +1,2 @@
 
-Hash (sidekick.Sidekick_util.Hash)
Module Sidekick_util.Hash
type 'a t = 'a -> int
val bool : bool t
val int : int t
val string : string t
val combine : 'a t -> int -> 'a -> int
val pair : 'a t -> 'b t -> ('a * 'b) t
val opt : 'a t -> 'a option t
val list : 'a t -> 'a list t
val array : 'a t -> 'a array t
val iarray : 'a t -> 'a IArray.t t
val seq : 'a t -> 'a Iter.t t
val combine2 : int -> int -> int
val combine3 : int -> int -> int -> int
val combine4 : int -> int -> int -> int -> int
val poly : 'a t
the regular polymorphic hash function

\ No newline at end of file
+Hash (sidekick.Sidekick_util.Hash)
Module Sidekick_util.Hash
type 'a t = 'a -> int
val bool : bool t
val int : int t
val string : string t
val combine : 'a t -> int -> 'a -> int
val pair : 'a t -> 'b t -> ('a * 'b) t
val opt : 'a t -> 'a option t
val list : 'a t -> 'a list t
val array : 'a t -> 'a array t
val iarray : 'a t -> 'a IArray.t t
val seq : 'a t -> 'a Iter.t t
val combine2 : int -> int -> int
val combine3 : int -> int -> int -> int
val combine4 : int -> int -> int -> int -> int
val poly : 'a t
the regular polymorphic hash function

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/IArray/index.html b/dev/sidekick/Sidekick_util/IArray/index.html
index 98302a8a..8eb3a5da 100644
--- a/dev/sidekick/Sidekick_util/IArray/index.html
+++ b/dev/sidekick/Sidekick_util/IArray/index.html
@@ -1,2 +1,2 @@
 
-IArray (sidekick.Sidekick_util.IArray)
Module Sidekick_util.IArray
type 'a t = private 'a array
Array of values of type 'a. The underlying type really is an array, but it will never be modified.
It should be covariant but OCaml will not accept it.
val empty : 'a t
val is_empty : _ t -> bool
val length : _ t -> int
val sub : 'a t -> int -> int -> 'a t
val singleton : 'a -> 'a t
val doubleton : 'a -> 'a -> 'a t
val make : int -> 'a -> 'a t
make n x makes an array of n times x
val init : int -> (int -> 'a) -> 'a t
init n f makes the array [| f 0; f 1; ... ; f (n-1) |].
  • raises Invalid_argument 
    if n < 0
val get : 'a t -> int -> 'a
Access the element
val unsafe_get : 'a t -> int -> 'a
Unsafe access, not bound-checked. Use with caution
val set : 'a t -> int -> 'a -> 'a t
Copy the array and modify its copy
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (int -> 'a -> 'b) -> 'a t -> 'b t
val append : 'a t -> 'a t -> 'a t
val iter : ('a -> unit) -> 'a t -> unit
val iteri : (int -> 'a -> unit) -> 'a t -> unit
val foldi : ('a -> int -> 'b -> 'a) -> 'a -> 'b t -> 'a
val fold : ('a -> 'b -> 'a) -> 'a -> 'b t -> 'a
val for_all : ('a -> bool) -> 'a t -> bool
val exists : ('a -> bool) -> 'a t -> bool
Conversions
type 'a iter = ('a -> unit) -> unit
type 'a gen = unit -> 'a option
val of_list : 'a list -> 'a t
val to_list : 'a t -> 'a list
val of_list_map : ('a -> 'b) -> 'a list -> 'b t
val to_list_map : ('a -> 'b) -> 'a t -> 'b list
val of_array_map : ('a -> 'b) -> 'a array -> 'b t
val to_array_map : ('a -> 'b) -> 'a t -> 'b array
val of_array_unsafe : 'a array -> 'a t
Take ownership of the given array. Careful, the array must NOT be modified afterwards!
val to_iter : 'a t -> 'a iter
val to_iter_sub : 'a t -> int -> int -> 'a iter
val of_iter : 'a iter -> 'a t
val of_gen : 'a gen -> 'a t
val to_gen : 'a t -> 'a gen
IO
type 'a printer = Stdlib.Format.formatter -> 'a -> unit
val print : ?start:string -> ?stop:string -> ?sep:string -> 'a printer -> 'a t printer
Binary
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val for_all2 : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val exists2 : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val map2 : ('a -> 'b -> 'c) -> 'a t -> 'b t -> 'c t
val fold2 : ('acc -> 'a -> 'b -> 'acc) -> 'acc -> 'a t -> 'b t -> 'acc
val iteri2 : (int -> 'a -> 'b -> unit) -> 'a t -> 'b t -> unit
val iter2 : ('a -> 'b -> unit) -> 'a t -> 'b t -> unit

\ No newline at end of file
+IArray (sidekick.Sidekick_util.IArray)
Module Sidekick_util.IArray
type 'a t = private 'a array
Array of values of type 'a. The underlying type really is an array, but it will never be modified.
It should be covariant but OCaml will not accept it.
val empty : 'a t
val is_empty : _ t -> bool
val length : _ t -> int
val sub : 'a t -> int -> int -> 'a t
val singleton : 'a -> 'a t
val doubleton : 'a -> 'a -> 'a t
val make : int -> 'a -> 'a t
make n x makes an array of n times x
val init : int -> (int -> 'a) -> 'a t
init n f makes the array [| f 0; f 1; ... ; f (n-1) |].
  • raises Invalid_argument 
    if n < 0
val get : 'a t -> int -> 'a
Access the element
val unsafe_get : 'a t -> int -> 'a
Unsafe access, not bound-checked. Use with caution
val set : 'a t -> int -> 'a -> 'a t
Copy the array and modify its copy
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (int -> 'a -> 'b) -> 'a t -> 'b t
val append : 'a t -> 'a t -> 'a t
val iter : ('a -> unit) -> 'a t -> unit
val iteri : (int -> 'a -> unit) -> 'a t -> unit
val foldi : ('a -> int -> 'b -> 'a) -> 'a -> 'b t -> 'a
val fold : ('a -> 'b -> 'a) -> 'a -> 'b t -> 'a
val for_all : ('a -> bool) -> 'a t -> bool
val exists : ('a -> bool) -> 'a t -> bool
Conversions
type 'a iter = ('a -> unit) -> unit
type 'a gen = unit -> 'a option
val of_list : 'a list -> 'a t
val to_list : 'a t -> 'a list
val of_list_map : ('a -> 'b) -> 'a list -> 'b t
val to_list_map : ('a -> 'b) -> 'a t -> 'b list
val of_array_map : ('a -> 'b) -> 'a array -> 'b t
val to_array_map : ('a -> 'b) -> 'a t -> 'b array
val of_array_unsafe : 'a array -> 'a t
Take ownership of the given array. Careful, the array must NOT be modified afterwards!
val to_iter : 'a t -> 'a iter
val to_iter_sub : 'a t -> int -> int -> 'a iter
val of_iter : 'a iter -> 'a t
val of_gen : 'a gen -> 'a t
val to_gen : 'a t -> 'a gen
IO
type 'a printer = Stdlib.Format.formatter -> 'a -> unit
val print : ?start:string -> ?stop:string -> ?sep:string -> 'a printer -> 'a t printer
Binary
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val for_all2 : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val exists2 : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val map2 : ('a -> 'b -> 'c) -> 'a t -> 'b t -> 'c t
val fold2 : ('acc -> 'a -> 'b -> 'acc) -> 'acc -> 'a t -> 'b t -> 'acc
val iteri2 : (int -> 'a -> 'b -> unit) -> 'a t -> 'b t -> unit
val iter2 : ('a -> 'b -> unit) -> 'a t -> 'b t -> unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Int_id/Make/index.html b/dev/sidekick/Sidekick_util/Int_id/Make/index.html
index a1c59e91..ec0c5e87 100644
--- a/dev/sidekick/Sidekick_util/Int_id/Make/index.html
+++ b/dev/sidekick/Sidekick_util/Int_id/Make/index.html
@@ -1,2 +1,2 @@
 
-Make (sidekick.Sidekick_util.Int_id.Make)
Module Int_id.Make
Parameters
Signature
type t = int
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : int CCHash.t
val to_int : 'a -> 'a
val of_int_unsafe : int -> t

\ No newline at end of file
+Make (sidekick.Sidekick_util.Int_id.Make)
Module Int_id.Make
Parameters
Signature
type t = int
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : int CCHash.t
val to_int : 'a -> 'a
val of_int_unsafe : int -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Int_id/index.html b/dev/sidekick/Sidekick_util/Int_id/index.html
index d88f02ca..32635600 100644
--- a/dev/sidekick/Sidekick_util/Int_id/index.html
+++ b/dev/sidekick/Sidekick_util/Int_id/index.html
@@ -1,2 +1,2 @@
 
-Int_id (sidekick.Sidekick_util.Int_id)
Module Sidekick_util.Int_id
module type S = sig ... end
module Make () : sig ... end

\ No newline at end of file
+Int_id (sidekick.Sidekick_util.Int_id)
Module Sidekick_util.Int_id
module type S = sig ... end
module Make () : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Int_id/module-type-S/index.html b/dev/sidekick/Sidekick_util/Int_id/module-type-S/index.html
index 706931d5..ab82f388 100644
--- a/dev/sidekick/Sidekick_util/Int_id/module-type-S/index.html
+++ b/dev/sidekick/Sidekick_util/Int_id/module-type-S/index.html
@@ -1,2 +1,2 @@
 
-S (sidekick.Sidekick_util.Int_id.S)
Module type Int_id.S
type t = private int
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val to_int : t -> int
val of_int_unsafe : int -> t

\ No newline at end of file
+S (sidekick.Sidekick_util.Int_id.S)
Module type Int_id.S
type t = private int
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val to_int : t -> int
val of_int_unsafe : int -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Log/index.html b/dev/sidekick/Sidekick_util/Log/index.html
index 551e27f9..a963273d 100644
--- a/dev/sidekick/Sidekick_util/Log/index.html
+++ b/dev/sidekick/Sidekick_util/Log/index.html
@@ -1,2 +1,2 @@
 
-Log (sidekick.Sidekick_util.Log)
Module Sidekick_util.Log
Logging function, for debugging
val enabled : bool
val set_debug : int -> unit
Set debug level
val get_debug : unit -> int
Current debug level
val debugf : int -> ((('a, Stdlib.Format.formatter, unit, unit) Stdlib.format4 -> 'a) -> unit) -> unit
Emit a debug message at the given level. If the level is lower than get_debug (), the message will indeed be emitted
val debug : int -> string -> unit
Simpler version of debug, without formatting
val set_debug_out : Stdlib.Format.formatter -> unit
Change the output formatter.

\ No newline at end of file
+Log (sidekick.Sidekick_util.Log)
Module Sidekick_util.Log
Logging function, for debugging
val enabled : bool
val set_debug : int -> unit
Set debug level
val get_debug : unit -> int
Current debug level
val debugf : int -> ((('a, Stdlib.Format.formatter, unit, unit) Stdlib.format4 -> 'a) -> unit) -> unit
Emit a debug message at the given level. If the level is lower than get_debug (), the message will indeed be emitted
val debug : int -> string -> unit
Simpler version of debug, without formatting
val set_debug_out : Stdlib.Format.formatter -> unit
Change the output formatter.

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Profile/Control/index.html b/dev/sidekick/Sidekick_util/Profile/Control/index.html
index e83aa294..81b39373 100644
--- a/dev/sidekick/Sidekick_util/Profile/Control/index.html
+++ b/dev/sidekick/Sidekick_util/Profile/Control/index.html
@@ -1,2 +1,2 @@
 
-Control (sidekick.Sidekick_util.Profile.Control)
Module Profile.Control
val setup : backend option -> unit
val teardown : unit -> unit

\ No newline at end of file
+Control (sidekick.Sidekick_util.Profile.Control)
Module Profile.Control
val setup : backend option -> unit
val teardown : unit -> unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Profile/index.html b/dev/sidekick/Sidekick_util/Profile/index.html
index 1fddcb30..091b9a2e 100644
--- a/dev/sidekick/Sidekick_util/Profile/index.html
+++ b/dev/sidekick/Sidekick_util/Profile/index.html
@@ -1,2 +1,2 @@
 
-Profile (sidekick.Sidekick_util.Profile)
Module Sidekick_util.Profile
Profiling probes
type probe
val null_probe : probe
val enabled : unit -> bool
val instant : string -> unit
val begin_ : string -> probe
val exit : probe -> unit
val with_ : string -> (unit -> 'a) -> 'a
val with1 : string -> ('a -> 'b) -> 'a -> 'b
val with2 : string -> ('a -> 'b -> 'c) -> 'a -> 'b -> 'c
module type BACKEND = sig ... end
type backend = (module BACKEND)
module Control : sig ... end

\ No newline at end of file
+Profile (sidekick.Sidekick_util.Profile)
Module Sidekick_util.Profile
Profiling probes
type probe
val null_probe : probe
val enabled : unit -> bool
val instant : string -> unit
val begin_ : string -> probe
val exit : probe -> unit
val with_ : string -> (unit -> 'a) -> 'a
val with1 : string -> ('a -> 'b) -> 'a -> 'b
val with2 : string -> ('a -> 'b -> 'c) -> 'a -> 'b -> 'c
module type BACKEND = sig ... end
type backend = (module BACKEND)
module Control : sig ... end

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Profile/module-type-BACKEND/index.html b/dev/sidekick/Sidekick_util/Profile/module-type-BACKEND/index.html
index 08941a99..33d8909c 100644
--- a/dev/sidekick/Sidekick_util/Profile/module-type-BACKEND/index.html
+++ b/dev/sidekick/Sidekick_util/Profile/module-type-BACKEND/index.html
@@ -1,2 +1,2 @@
 
-BACKEND (sidekick.Sidekick_util.Profile.BACKEND)
Module type Profile.BACKEND
val get_ts : unit -> float
val emit_duration_event : name:string -> start:float -> end_:float -> unit -> unit
val emit_instant_event : name:string -> ts:float -> unit -> unit
val teardown : unit -> unit

\ No newline at end of file
+BACKEND (sidekick.Sidekick_util.Profile.BACKEND)
Module type Profile.BACKEND
val get_ts : unit -> float
val emit_duration_event : name:string -> start:float -> end_:float -> unit -> unit
val emit_instant_event : name:string -> ts:float -> unit -> unit
val teardown : unit -> unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Stat/index.html b/dev/sidekick/Sidekick_util/Stat/index.html
index f98a4d9c..746c83e8 100644
--- a/dev/sidekick/Sidekick_util/Stat/index.html
+++ b/dev/sidekick/Sidekick_util/Stat/index.html
@@ -1,2 +1,2 @@
 
-Stat (sidekick.Sidekick_util.Stat)
Module Sidekick_util.Stat
Statistics
module Fmt = CCFormat
type t
val create : unit -> t
type 'a counter
val mk_int : t -> string -> int counter
val mk_float : t -> string -> float counter
val incr : int counter -> unit
val incr_f : float counter -> float -> unit
val set : 'a counter -> 'a -> unit
type ex_counter
Existential counter
val all : t -> ex_counter Iter.t
val pp_all : ex_counter Iter.t Fmt.printer
val global : t
Global statistics, by default

\ No newline at end of file
+Stat (sidekick.Sidekick_util.Stat)
Module Sidekick_util.Stat
Statistics
module Fmt = CCFormat
type t
val create : unit -> t
type 'a counter
val mk_int : t -> string -> int counter
val mk_float : t -> string -> float counter
val incr : int counter -> unit
val incr_f : float counter -> float -> unit
val set : 'a counter -> 'a -> unit
type ex_counter
Existential counter
val all : t -> ex_counter Iter.t
val pp_all : ex_counter Iter.t Fmt.printer
val global : t
Global statistics, by default

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Util/index.html b/dev/sidekick/Sidekick_util/Util/index.html
index 58d86fef..df3cbb38 100644
--- a/dev/sidekick/Sidekick_util/Util/index.html
+++ b/dev/sidekick/Sidekick_util/Util/index.html
@@ -1,2 +1,2 @@
 
-Util (sidekick.Sidekick_util.Util)
Module Sidekick_util.Util
Utils
type 'a printer = 'a CCFormat.printer
val pp_list : ?sep:string -> 'a printer -> 'a list printer
val pp_iter : ?sep:string -> 'a printer -> 'a Iter.t printer
val pp_array : ?sep:string -> 'a printer -> 'a array printer
val pp_pair : ?sep:string -> 'a printer -> 'b printer -> ('a * 'b) printer
val pp_iarray : ?sep:string -> 'a CCFormat.printer -> 'a IArray.t CCFormat.printer
val flat_map_l_ia : ('a -> 'b IArray.t) -> 'a list -> 'b list
val array_of_list_map : ('a -> 'b) -> 'a list -> 'b array
array_of_list_map f l is the same as Array.of_list @@ List.map f l
val array_to_list_map : ('a -> 'b) -> 'a array -> 'b list
val lazy_map : ('a -> 'b) -> 'a lazy_t -> 'b lazy_t
val lazy_map2 : ('a -> 'b -> 'c) -> 'a lazy_t -> 'b lazy_t -> 'c lazy_t
val setup_gc : unit -> unit
Change parameters of the GC
module Int_set : CCSet.S with type elt = int
module Int_map : CCMap.S with type key = int
module Int_tbl : CCHashtbl.S with type key = int
module Str_tbl : CCHashtbl.S with type key = string

\ No newline at end of file
+Util (sidekick.Sidekick_util.Util)
Module Sidekick_util.Util
Utils
type 'a printer = 'a CCFormat.printer
val pp_list : ?sep:string -> 'a printer -> 'a list printer
val pp_iter : ?sep:string -> 'a printer -> 'a Iter.t printer
val pp_array : ?sep:string -> 'a printer -> 'a array printer
val pp_pair : ?sep:string -> 'a printer -> 'b printer -> ('a * 'b) printer
val pp_iarray : ?sep:string -> 'a CCFormat.printer -> 'a IArray.t CCFormat.printer
val flat_map_l_ia : ('a -> 'b IArray.t) -> 'a list -> 'b list
val array_of_list_map : ('a -> 'b) -> 'a list -> 'b array
array_of_list_map f l is the same as Array.of_list @@ List.map f l
val array_to_list_map : ('a -> 'b) -> 'a array -> 'b list
val lazy_map : ('a -> 'b) -> 'a lazy_t -> 'b lazy_t
val lazy_map2 : ('a -> 'b -> 'c) -> 'a lazy_t -> 'b lazy_t -> 'c lazy_t
val setup_gc : unit -> unit
Change parameters of the GC
module Int_set : CCSet.S with type elt = int
module Int_map : CCMap.S with type key = int
module Int_tbl : CCHashtbl.S with type key = int
module Str_tbl : CCHashtbl.S with type key = string

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Vec/index.html b/dev/sidekick/Sidekick_util/Vec/index.html
index 4f70f11d..52812f44 100644
--- a/dev/sidekick/Sidekick_util/Vec/index.html
+++ b/dev/sidekick/Sidekick_util/Vec/index.html
@@ -1,3 +1,3 @@
 
-Vec (sidekick.Sidekick_util.Vec)
Module Sidekick_util.Vec
Vectors
A resizable array, workhorse of imperative programming :-). This implementation originated in alt-ergo-zero but has been basically rewritten from scratch several times since.
type 'a t
Abstract type of vectors of 'a
val make : int -> 'a -> 'a t
make cap dummy creates a new vector filled with dummy. The vector is initially empty but its underlying array has capacity cap. dummy will stay alive as long as the vector
val create : unit -> 'a t
val to_list : 'a t -> 'a list
Returns the list of elements of the vector
val to_array : 'a t -> 'a array
val of_list : 'a list -> 'a t
val to_seq : 'a t -> 'a Iter.t
val clear : 'a t -> unit
Set size to 0, doesn't free elements
val ensure_size : 'a t -> 'a -> int -> unit
ensure size is at least n
val ensure_size_with : 'a t -> (unit -> 'a) -> int -> unit
ensure size is at least n
val shrink : 'a t -> int -> unit
shrink vec sz resets size of vec to sz. Assumes sz >=0 && sz <= size vec
val pop_exn : 'a t -> 'a
Pop last element and return it.
  • raises Invalid_argument 
    if the vector is empty
val pop : 'a t -> 'a option
val size : 'a t -> int
val is_empty : 'a t -> bool
val is_full : 'a t -> bool
Is the capacity of the vector equal to the number of its elements?
val push : 'a t -> 'a -> unit
Push element into the vector
val get : 'a t -> int -> 'a
get the element at the given index, or
  • raises Invalid_argument 
    if the index is not valid
val set : 'a t -> int -> 'a -> unit
set the element at the given index, either already set or the first free slot if not (is_full vec), or
  • raises Invalid_argument 
    if the index is not valid
val copy : 'a t -> 'a t
Fresh copy
val fast_remove : 'a t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val append : into:'a t -> 'a t -> unit
append ~into v pushes elements of v in the vector into
val prepend : 'a t -> into:'a t -> unit
prepend v ~into pushes all elements of v into into, at the beginning. consumes v.
val filter_in_place : ('a -> bool) -> 'a t -> unit
filter_in_place f v removes from v the elements that do not satisfy f
val sort : 'a t -> ('a -> 'a -> int) -> unit
Sort in place the array
val iter : ('a -> unit) -> 'a t -> unit
Iterate on elements
val to_iter : 'a t -> 'a Iter.t
val iteri : (int -> 'a -> unit) -> 'a t -> unit
Iterate on elements with their index
val fold : ('b -> 'a -> 'b) -> 'b -> 'a t -> 'b
Fold over elements
val exists : ('a -> bool) -> 'a t -> bool
Does there exist an element that satisfies the predicate?
val for_all : ('a -> bool) -> 'a t -> bool
Do all elements satisfy the predicate?
val pp : ?sep:string ->
+Vec (sidekick.Sidekick_util.Vec)
Module Sidekick_util.Vec
Vectors
A resizable array, workhorse of imperative programming :-). This implementation originated in alt-ergo-zero but has been basically rewritten from scratch several times since.
type 'a t
Abstract type of vectors of 'a
val make : int -> 'a -> 'a t
make cap dummy creates a new vector filled with dummy. The vector is initially empty but its underlying array has capacity cap. dummy will stay alive as long as the vector
val create : unit -> 'a t
val to_list : 'a t -> 'a list
Returns the list of elements of the vector
val to_array : 'a t -> 'a array
val of_list : 'a list -> 'a t
val to_seq : 'a t -> 'a Iter.t
val clear : 'a t -> unit
Set size to 0, doesn't free elements
val ensure_size : 'a t -> 'a -> int -> unit
ensure size is at least n
val ensure_size_with : 'a t -> (unit -> 'a) -> int -> unit
ensure size is at least n
val shrink : 'a t -> int -> unit
shrink vec sz resets size of vec to sz. Assumes sz >=0 && sz <= size vec
val pop_exn : 'a t -> 'a
Pop last element and return it.
  • raises Invalid_argument 
    if the vector is empty
val pop : 'a t -> 'a option
val size : 'a t -> int
val is_empty : 'a t -> bool
val is_full : 'a t -> bool
Is the capacity of the vector equal to the number of its elements?
val push : 'a t -> 'a -> unit
Push element into the vector
val get : 'a t -> int -> 'a
get the element at the given index, or
  • raises Invalid_argument 
    if the index is not valid
val set : 'a t -> int -> 'a -> unit
set the element at the given index, either already set or the first free slot if not (is_full vec), or
  • raises Invalid_argument 
    if the index is not valid
val copy : 'a t -> 'a t
Fresh copy
val fast_remove : 'a t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val append : into:'a t -> 'a t -> unit
append ~into v pushes elements of v in the vector into
val prepend : 'a t -> into:'a t -> unit
prepend v ~into pushes all elements of v into into, at the beginning. consumes v.
val filter_in_place : ('a -> bool) -> 'a t -> unit
filter_in_place f v removes from v the elements that do not satisfy f
val sort : 'a t -> ('a -> 'a -> int) -> unit
Sort in place the array
val iter : ('a -> unit) -> 'a t -> unit
Iterate on elements
val to_iter : 'a t -> 'a Iter.t
val iteri : (int -> 'a -> unit) -> 'a t -> unit
Iterate on elements with their index
val fold : ('b -> 'a -> 'b) -> 'b -> 'a t -> 'b
Fold over elements
val exists : ('a -> bool) -> 'a t -> bool
Does there exist an element that satisfies the predicate?
val for_all : ('a -> bool) -> 'a t -> bool
Do all elements satisfy the predicate?
val pp : ?sep:string ->
 (Stdlib.Format.formatter -> 'a -> unit) -> Stdlib.Format.formatter -> 'a t -> unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/VecI32/index.html b/dev/sidekick/Sidekick_util/VecI32/index.html
index c300deaa..2dee94ef 100644
--- a/dev/sidekick/Sidekick_util/VecI32/index.html
+++ b/dev/sidekick/Sidekick_util/VecI32/index.html
@@ -1,2 +1,2 @@
 
-VecI32 (sidekick.Sidekick_util.VecI32)
Module Sidekick_util.VecI32
Vectors of int32 integers
These vectors are more optimized than Vec.
include Vec_sig.S with type elt := int32
include Vec_sig.BASE with type elt := int32
include Vec_sig.BASE_RO with type elt := int32
type t
val size : t -> int
val get : t -> int -> int32
val iter : f:(int32 -> unit) -> t -> unit
val iteri : f:(int -> int32 -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> int32 -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (int32 -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> int32
val set : t -> int -> int32 -> unit
val shrink : t -> int -> unit
include Vec_sig.EXTENSIONS with type t := t and type elt := int32
val to_iter : t -> int32 Iter.t
val to_array : t -> int32 array
val fold_left : ('a -> int32 -> 'a) -> 'a -> t -> 'a
val pp : int32 CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+VecI32 (sidekick.Sidekick_util.VecI32)
Module Sidekick_util.VecI32
Vectors of int32 integers
These vectors are more optimized than Vec.
include Vec_sig.S with type elt := int32
include Vec_sig.BASE with type elt := int32
include Vec_sig.BASE_RO with type elt := int32
type t
val size : t -> int
val get : t -> int -> int32
val iter : f:(int32 -> unit) -> t -> unit
val iteri : f:(int -> int32 -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> int32 -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (int32 -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> int32
val set : t -> int -> int32 -> unit
val shrink : t -> int -> unit
include Vec_sig.EXTENSIONS with type t := t and type elt := int32
val to_iter : t -> int32 Iter.t
val to_array : t -> int32 array
val fold_left : ('a -> int32 -> 'a) -> 'a -> t -> 'a
val pp : int32 CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/VecSmallInt/index.html b/dev/sidekick/Sidekick_util/VecSmallInt/index.html
index 16f155d0..796dff95 100644
--- a/dev/sidekick/Sidekick_util/VecSmallInt/index.html
+++ b/dev/sidekick/Sidekick_util/VecSmallInt/index.html
@@ -1,2 +1,2 @@
 
-VecSmallInt (sidekick.Sidekick_util.VecSmallInt)
Module Sidekick_util.VecSmallInt
Vectors of int32 integers
These vectors are more optimized than Vec.
include Vec_sig.S with type elt := int
include Vec_sig.BASE with type elt := int
include Vec_sig.BASE_RO with type elt := int
type t
val size : t -> int
val get : t -> int -> int
val iter : f:(int -> unit) -> t -> unit
val iteri : f:(int -> int -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> int -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (int -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> int
val set : t -> int -> int -> unit
val shrink : t -> int -> unit
include Vec_sig.EXTENSIONS with type t := t and type elt := int
val to_iter : t -> int Iter.t
val to_array : t -> int array
val fold_left : ('a -> int -> 'a) -> 'a -> t -> 'a
val pp : int CCFormat.printer -> t CCFormat.printer
val push_i32 : t -> int32 -> unit
val get_i32 : t -> int -> int32
val set_i32 : t -> int -> int32 -> unit

\ No newline at end of file
+VecSmallInt (sidekick.Sidekick_util.VecSmallInt)
Module Sidekick_util.VecSmallInt
Vectors of int32 integers
These vectors are more optimized than Vec.
include Vec_sig.S with type elt := int
include Vec_sig.BASE with type elt := int
include Vec_sig.BASE_RO with type elt := int
type t
val size : t -> int
val get : t -> int -> int
val iter : f:(int -> unit) -> t -> unit
val iteri : f:(int -> int -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> int -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (int -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> int
val set : t -> int -> int -> unit
val shrink : t -> int -> unit
include Vec_sig.EXTENSIONS with type t := t and type elt := int
val to_iter : t -> int Iter.t
val to_array : t -> int array
val fold_left : ('a -> int -> 'a) -> 'a -> t -> 'a
val pp : int CCFormat.printer -> t CCFormat.printer
val push_i32 : t -> int32 -> unit
val get_i32 : t -> int -> int32
val set_i32 : t -> int -> int32 -> unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Vec_float/index.html b/dev/sidekick/Sidekick_util/Vec_float/index.html
index f2de9694..77c863e3 100644
--- a/dev/sidekick/Sidekick_util/Vec_float/index.html
+++ b/dev/sidekick/Sidekick_util/Vec_float/index.html
@@ -1,2 +1,2 @@
 
-Vec_float (sidekick.Sidekick_util.Vec_float)
Module Sidekick_util.Vec_float
Vectors of floats
These vectors are more optimized than Vec.
include Vec_sig.S with type elt := float
include Vec_sig.BASE with type elt := float
include Vec_sig.BASE_RO with type elt := float
type t
val size : t -> int
val get : t -> int -> float
val iter : f:(float -> unit) -> t -> unit
val iteri : f:(int -> float -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> float -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (float -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> float
val set : t -> int -> float -> unit
val shrink : t -> int -> unit
include Vec_sig.EXTENSIONS with type t := t and type elt := float
val to_iter : t -> float Iter.t
val to_array : t -> float array
val fold_left : ('a -> float -> 'a) -> 'a -> t -> 'a
val pp : float CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Vec_float (sidekick.Sidekick_util.Vec_float)
Module Sidekick_util.Vec_float
Vectors of floats
These vectors are more optimized than Vec.
include Vec_sig.S with type elt := float
include Vec_sig.BASE with type elt := float
include Vec_sig.BASE_RO with type elt := float
type t
val size : t -> int
val get : t -> int -> float
val iter : f:(float -> unit) -> t -> unit
val iteri : f:(int -> float -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> float -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (float -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> float
val set : t -> int -> float -> unit
val shrink : t -> int -> unit
include Vec_sig.EXTENSIONS with type t := t and type elt := float
val to_iter : t -> float Iter.t
val to_array : t -> float array
val fold_left : ('a -> float -> 'a) -> 'a -> t -> 'a
val pp : float CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Vec_sig/Make_extensions/argument-1-B/index.html b/dev/sidekick/Sidekick_util/Vec_sig/Make_extensions/argument-1-B/index.html
index a12ba95f..9268816f 100644
--- a/dev/sidekick/Sidekick_util/Vec_sig/Make_extensions/argument-1-B/index.html
+++ b/dev/sidekick/Sidekick_util/Vec_sig/Make_extensions/argument-1-B/index.html
@@ -1,2 +1,2 @@
 
-B (sidekick.Sidekick_util.Vec_sig.Make_extensions.1-B)
Parameter Make_extensions.1-B
type elt
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit

\ No newline at end of file
+B (sidekick.Sidekick_util.Vec_sig.Make_extensions.1-B)
Parameter Make_extensions.1-B
type elt
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Vec_sig/Make_extensions/index.html b/dev/sidekick/Sidekick_util/Vec_sig/Make_extensions/index.html
index 283f6fe1..ceb7d7c5 100644
--- a/dev/sidekick/Sidekick_util/Vec_sig/Make_extensions/index.html
+++ b/dev/sidekick/Sidekick_util/Vec_sig/Make_extensions/index.html
@@ -1,2 +1,2 @@
 
-Make_extensions (sidekick.Sidekick_util.Vec_sig.Make_extensions)
Module Vec_sig.Make_extensions
Parameters
module B : BASE_RO
Signature
val to_iter : B.t -> B.elt Iter.t
val to_array : B.t -> B.elt array
val fold_left : ('a -> B.elt -> 'a) -> 'a -> B.t -> 'a
val pp : B.elt CCFormat.printer -> B.t CCFormat.printer

\ No newline at end of file
+Make_extensions (sidekick.Sidekick_util.Vec_sig.Make_extensions)
Module Vec_sig.Make_extensions
Parameters
module B : BASE_RO
Signature
val to_iter : B.t -> B.elt Iter.t
val to_array : B.t -> B.elt array
val fold_left : ('a -> B.elt -> 'a) -> 'a -> B.t -> 'a
val pp : B.elt CCFormat.printer -> B.t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Vec_sig/index.html b/dev/sidekick/Sidekick_util/Vec_sig/index.html
index a264068e..e425b8ee 100644
--- a/dev/sidekick/Sidekick_util/Vec_sig/index.html
+++ b/dev/sidekick/Sidekick_util/Vec_sig/index.html
@@ -1,2 +1,2 @@
 
-Vec_sig (sidekick.Sidekick_util.Vec_sig)
Module Sidekick_util.Vec_sig
module type BASE_RO = sig ... end
Basics
module type BASE = sig ... end
module type EXTENSIONS = sig ... end
module type S = sig ... end
module Make_extensions (B : BASE_RO) : EXTENSIONS with type t := B.t and type elt := B.elt

\ No newline at end of file
+Vec_sig (sidekick.Sidekick_util.Vec_sig)
Module Sidekick_util.Vec_sig
module type BASE_RO = sig ... end
Basics
module type BASE = sig ... end
module type EXTENSIONS = sig ... end
module type S = sig ... end
module Make_extensions (B : BASE_RO) : EXTENSIONS with type t := B.t and type elt := B.elt

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Vec_sig/module-type-BASE/index.html b/dev/sidekick/Sidekick_util/Vec_sig/module-type-BASE/index.html
index 90fa7eae..e9c8a63e 100644
--- a/dev/sidekick/Sidekick_util/Vec_sig/module-type-BASE/index.html
+++ b/dev/sidekick/Sidekick_util/Vec_sig/module-type-BASE/index.html
@@ -1,2 +1,2 @@
 
-BASE (sidekick.Sidekick_util.Vec_sig.BASE)
Module type Vec_sig.BASE
include BASE_RO
type elt
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit

\ No newline at end of file
+BASE (sidekick.Sidekick_util.Vec_sig.BASE)
Module type Vec_sig.BASE
include BASE_RO
type elt
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Vec_sig/module-type-BASE_RO/index.html b/dev/sidekick/Sidekick_util/Vec_sig/module-type-BASE_RO/index.html
index 71d84f79..7a74401e 100644
--- a/dev/sidekick/Sidekick_util/Vec_sig/module-type-BASE_RO/index.html
+++ b/dev/sidekick/Sidekick_util/Vec_sig/module-type-BASE_RO/index.html
@@ -1,2 +1,2 @@
 
-BASE_RO (sidekick.Sidekick_util.Vec_sig.BASE_RO)
Module type Vec_sig.BASE_RO
Basics
type elt
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit

\ No newline at end of file
+BASE_RO (sidekick.Sidekick_util.Vec_sig.BASE_RO)
Module type Vec_sig.BASE_RO
Basics
type elt
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Vec_sig/module-type-EXTENSIONS/index.html b/dev/sidekick/Sidekick_util/Vec_sig/module-type-EXTENSIONS/index.html
index 4f18f625..c52a1b3d 100644
--- a/dev/sidekick/Sidekick_util/Vec_sig/module-type-EXTENSIONS/index.html
+++ b/dev/sidekick/Sidekick_util/Vec_sig/module-type-EXTENSIONS/index.html
@@ -1,2 +1,2 @@
 
-EXTENSIONS (sidekick.Sidekick_util.Vec_sig.EXTENSIONS)
Module type Vec_sig.EXTENSIONS
type elt
type t
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+EXTENSIONS (sidekick.Sidekick_util.Vec_sig.EXTENSIONS)
Module type Vec_sig.EXTENSIONS
type elt
type t
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Vec_sig/module-type-S/index.html b/dev/sidekick/Sidekick_util/Vec_sig/module-type-S/index.html
index 505f0d42..40e08d83 100644
--- a/dev/sidekick/Sidekick_util/Vec_sig/module-type-S/index.html
+++ b/dev/sidekick/Sidekick_util/Vec_sig/module-type-S/index.html
@@ -1,2 +1,2 @@
 
-S (sidekick.Sidekick_util.Vec_sig.S)
Module type Vec_sig.S
include BASE
include BASE_RO
type elt
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+S (sidekick.Sidekick_util.Vec_sig.S)
Module type Vec_sig.S
include BASE
include BASE_RO
type elt
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/Vec_unit/index.html b/dev/sidekick/Sidekick_util/Vec_unit/index.html
index 54c1cd76..d6289351 100644
--- a/dev/sidekick/Sidekick_util/Vec_unit/index.html
+++ b/dev/sidekick/Sidekick_util/Vec_unit/index.html
@@ -1,2 +1,2 @@
 
-Vec_unit (sidekick.Sidekick_util.Vec_unit)
Module Sidekick_util.Vec_unit
include Vec_sig.S with type elt = unit
include Vec_sig.BASE with type elt = unit
include Vec_sig.BASE_RO with type elt = unit
type elt = unit
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
+Vec_unit (sidekick.Sidekick_util.Vec_unit)
Module Sidekick_util.Vec_unit
include Vec_sig.S with type elt = unit
include Vec_sig.BASE with type elt = unit
include Vec_sig.BASE_RO with type elt = unit
type elt = unit
type t
val size : t -> int
val get : t -> int -> elt
val iter : f:(elt -> unit) -> t -> unit
val iteri : f:(int -> elt -> unit) -> t -> unit
val create : ?cap:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val is_empty : t -> bool
val push : t -> elt -> unit
val fast_remove : t -> int -> unit
Remove element at index i without preserving order (swap with last element)
val filter_in_place : (elt -> bool) -> t -> unit
val ensure_size : t -> int -> unit
val pop : t -> elt
val set : t -> int -> elt -> unit
val shrink : t -> int -> unit
include Vec_sig.EXTENSIONS with type t := t and type elt := elt
val to_iter : t -> elt Iter.t
val to_array : t -> elt array
val fold_left : ('a -> elt -> 'a) -> 'a -> t -> 'a
val pp : elt CCFormat.printer -> t CCFormat.printer

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util/index.html b/dev/sidekick/Sidekick_util/index.html
index 49459e1b..41d1a535 100644
--- a/dev/sidekick/Sidekick_util/index.html
+++ b/dev/sidekick/Sidekick_util/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_util (sidekick.Sidekick_util)
Module Sidekick_util
module Fmt = CCFormat
module Util : sig ... end
module Vec : sig ... end
Vectors
module VecSmallInt : sig ... end
Vectors of int32 integers
module VecI32 : sig ... end
Vectors of int32 integers
module Vec_float : sig ... end
Vectors of floats
module Vec_unit : sig ... end
module Vec_sig : sig ... end
module Bitvec : sig ... end
Bitvector
module Int_id : sig ... end
module Int_tbl = Util.Int_tbl
module Int_set = Util.Int_set
module Int_map = Util.Int_map
module IArray : sig ... end
module Backtrack_stack : sig ... end
module Backtrackable_tbl : sig ... end
module Log : sig ... end
Logging function, for debugging
module Error : sig ... end
module Bag : sig ... end
module Stat : sig ... end
module Hash : sig ... end
module Profile : sig ... end
module Chunk_stack : sig ... end
Manage a list of chunks.
module Intf = Sidekick_sigs

\ No newline at end of file
+Sidekick_util (sidekick.Sidekick_util)
Module Sidekick_util
module Fmt = CCFormat
module Util : sig ... end
module Vec : sig ... end
Vectors
module VecSmallInt : sig ... end
Vectors of int32 integers
module VecI32 : sig ... end
Vectors of int32 integers
module Vec_float : sig ... end
Vectors of floats
module Vec_unit : sig ... end
module Vec_sig : sig ... end
module Bitvec : sig ... end
Bitvector
module Int_id : sig ... end
module Int_tbl = Util.Int_tbl
module Int_set = Util.Int_set
module Int_map = Util.Int_map
module IArray : sig ... end
module Backtrack_stack : sig ... end
module Backtrackable_tbl : sig ... end
module Log : sig ... end
Logging function, for debugging
module Error : sig ... end
module Bag : sig ... end
module Stat : sig ... end
module Hash : sig ... end
module Profile : sig ... end
module Chunk_stack : sig ... end
Manage a list of chunks.
module Intf = Sidekick_sigs

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util__/index.html b/dev/sidekick/Sidekick_util__/index.html
index 9dff1a0f..9af96af0 100644
--- a/dev/sidekick/Sidekick_util__/index.html
+++ b/dev/sidekick/Sidekick_util__/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_util__ (sidekick.Sidekick_util__)
Module Sidekick_util__

\ No newline at end of file
+Sidekick_util__ (sidekick.Sidekick_util__)
Module Sidekick_util__

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util__Backtrack_stack/index.html b/dev/sidekick/Sidekick_util__Backtrack_stack/index.html
index f4ad0bc9..65c346ee 100644
--- a/dev/sidekick/Sidekick_util__Backtrack_stack/index.html
+++ b/dev/sidekick/Sidekick_util__Backtrack_stack/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_util__Backtrack_stack (sidekick.Sidekick_util__Backtrack_stack)
Module Sidekick_util__Backtrack_stack

\ No newline at end of file
+Sidekick_util__Backtrack_stack (sidekick.Sidekick_util__Backtrack_stack)
Module Sidekick_util__Backtrack_stack

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util__Backtrackable_tbl/index.html b/dev/sidekick/Sidekick_util__Backtrackable_tbl/index.html
index 8a880a1c..6aa2a7a7 100644
--- a/dev/sidekick/Sidekick_util__Backtrackable_tbl/index.html
+++ b/dev/sidekick/Sidekick_util__Backtrackable_tbl/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_util__Backtrackable_tbl (sidekick.Sidekick_util__Backtrackable_tbl)
Module Sidekick_util__Backtrackable_tbl

\ No newline at end of file
+Sidekick_util__Backtrackable_tbl (sidekick.Sidekick_util__Backtrackable_tbl)
Module Sidekick_util__Backtrackable_tbl

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util__Bag/index.html b/dev/sidekick/Sidekick_util__Bag/index.html
index 3fd7574c..e981beb9 100644
--- a/dev/sidekick/Sidekick_util__Bag/index.html
+++ b/dev/sidekick/Sidekick_util__Bag/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_util__Bag (sidekick.Sidekick_util__Bag)
Module Sidekick_util__Bag

\ No newline at end of file
+Sidekick_util__Bag (sidekick.Sidekick_util__Bag)
Module Sidekick_util__Bag

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util__Bitvec/index.html b/dev/sidekick/Sidekick_util__Bitvec/index.html
index 0d125218..782f3fa3 100644
--- a/dev/sidekick/Sidekick_util__Bitvec/index.html
+++ b/dev/sidekick/Sidekick_util__Bitvec/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_util__Bitvec (sidekick.Sidekick_util__Bitvec)
Module Sidekick_util__Bitvec

\ No newline at end of file
+Sidekick_util__Bitvec (sidekick.Sidekick_util__Bitvec)
Module Sidekick_util__Bitvec

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util__Chunk_stack/index.html b/dev/sidekick/Sidekick_util__Chunk_stack/index.html
index 948d4e5c..20e59897 100644
--- a/dev/sidekick/Sidekick_util__Chunk_stack/index.html
+++ b/dev/sidekick/Sidekick_util__Chunk_stack/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_util__Chunk_stack (sidekick.Sidekick_util__Chunk_stack)
Module Sidekick_util__Chunk_stack

\ No newline at end of file
+Sidekick_util__Chunk_stack (sidekick.Sidekick_util__Chunk_stack)
Module Sidekick_util__Chunk_stack

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util__Error/index.html b/dev/sidekick/Sidekick_util__Error/index.html
index b7b27b83..74236838 100644
--- a/dev/sidekick/Sidekick_util__Error/index.html
+++ b/dev/sidekick/Sidekick_util__Error/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_util__Error (sidekick.Sidekick_util__Error)
Module Sidekick_util__Error

\ No newline at end of file
+Sidekick_util__Error (sidekick.Sidekick_util__Error)
Module Sidekick_util__Error

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util__Hash/index.html b/dev/sidekick/Sidekick_util__Hash/index.html
index fd7fe10e..676c0217 100644
--- a/dev/sidekick/Sidekick_util__Hash/index.html
+++ b/dev/sidekick/Sidekick_util__Hash/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_util__Hash (sidekick.Sidekick_util__Hash)
Module Sidekick_util__Hash

\ No newline at end of file
+Sidekick_util__Hash (sidekick.Sidekick_util__Hash)
Module Sidekick_util__Hash

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util__IArray/index.html b/dev/sidekick/Sidekick_util__IArray/index.html
index e092071f..419e6750 100644
--- a/dev/sidekick/Sidekick_util__IArray/index.html
+++ b/dev/sidekick/Sidekick_util__IArray/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_util__IArray (sidekick.Sidekick_util__IArray)
Module Sidekick_util__IArray

\ No newline at end of file
+Sidekick_util__IArray (sidekick.Sidekick_util__IArray)
Module Sidekick_util__IArray

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util__Int_id/index.html b/dev/sidekick/Sidekick_util__Int_id/index.html
index f0f525f2..e4810044 100644
--- a/dev/sidekick/Sidekick_util__Int_id/index.html
+++ b/dev/sidekick/Sidekick_util__Int_id/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_util__Int_id (sidekick.Sidekick_util__Int_id)
Module Sidekick_util__Int_id

\ No newline at end of file
+Sidekick_util__Int_id (sidekick.Sidekick_util__Int_id)
Module Sidekick_util__Int_id

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util__Log/index.html b/dev/sidekick/Sidekick_util__Log/index.html
index 529b3cfc..048bde14 100644
--- a/dev/sidekick/Sidekick_util__Log/index.html
+++ b/dev/sidekick/Sidekick_util__Log/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_util__Log (sidekick.Sidekick_util__Log)
Module Sidekick_util__Log

\ No newline at end of file
+Sidekick_util__Log (sidekick.Sidekick_util__Log)
Module Sidekick_util__Log

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util__Profile/index.html b/dev/sidekick/Sidekick_util__Profile/index.html
index dd1d68cc..fdfa2004 100644
--- a/dev/sidekick/Sidekick_util__Profile/index.html
+++ b/dev/sidekick/Sidekick_util__Profile/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_util__Profile (sidekick.Sidekick_util__Profile)
Module Sidekick_util__Profile

\ No newline at end of file
+Sidekick_util__Profile (sidekick.Sidekick_util__Profile)
Module Sidekick_util__Profile

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util__Stat/index.html b/dev/sidekick/Sidekick_util__Stat/index.html
index 1a9048f5..3a540f59 100644
--- a/dev/sidekick/Sidekick_util__Stat/index.html
+++ b/dev/sidekick/Sidekick_util__Stat/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_util__Stat (sidekick.Sidekick_util__Stat)
Module Sidekick_util__Stat

\ No newline at end of file
+Sidekick_util__Stat (sidekick.Sidekick_util__Stat)
Module Sidekick_util__Stat

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util__Util/index.html b/dev/sidekick/Sidekick_util__Util/index.html
index 7396627b..fda294d8 100644
--- a/dev/sidekick/Sidekick_util__Util/index.html
+++ b/dev/sidekick/Sidekick_util__Util/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_util__Util (sidekick.Sidekick_util__Util)
Module Sidekick_util__Util

\ No newline at end of file
+Sidekick_util__Util (sidekick.Sidekick_util__Util)
Module Sidekick_util__Util

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util__Vec/index.html b/dev/sidekick/Sidekick_util__Vec/index.html
index 12432569..fc58a062 100644
--- a/dev/sidekick/Sidekick_util__Vec/index.html
+++ b/dev/sidekick/Sidekick_util__Vec/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_util__Vec (sidekick.Sidekick_util__Vec)
Module Sidekick_util__Vec

\ No newline at end of file
+Sidekick_util__Vec (sidekick.Sidekick_util__Vec)
Module Sidekick_util__Vec

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util__VecI32/index.html b/dev/sidekick/Sidekick_util__VecI32/index.html
index 737ac2d8..1c17a5a7 100644
--- a/dev/sidekick/Sidekick_util__VecI32/index.html
+++ b/dev/sidekick/Sidekick_util__VecI32/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_util__VecI32 (sidekick.Sidekick_util__VecI32)
Module Sidekick_util__VecI32

\ No newline at end of file
+Sidekick_util__VecI32 (sidekick.Sidekick_util__VecI32)
Module Sidekick_util__VecI32

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util__VecSmallInt/index.html b/dev/sidekick/Sidekick_util__VecSmallInt/index.html
index b96bb1a5..72218f87 100644
--- a/dev/sidekick/Sidekick_util__VecSmallInt/index.html
+++ b/dev/sidekick/Sidekick_util__VecSmallInt/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_util__VecSmallInt (sidekick.Sidekick_util__VecSmallInt)
Module Sidekick_util__VecSmallInt

\ No newline at end of file
+Sidekick_util__VecSmallInt (sidekick.Sidekick_util__VecSmallInt)
Module Sidekick_util__VecSmallInt

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util__Vec_float/index.html b/dev/sidekick/Sidekick_util__Vec_float/index.html
index 17b174e3..5e05cca5 100644
--- a/dev/sidekick/Sidekick_util__Vec_float/index.html
+++ b/dev/sidekick/Sidekick_util__Vec_float/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_util__Vec_float (sidekick.Sidekick_util__Vec_float)
Module Sidekick_util__Vec_float

\ No newline at end of file
+Sidekick_util__Vec_float (sidekick.Sidekick_util__Vec_float)
Module Sidekick_util__Vec_float

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util__Vec_sig/index.html b/dev/sidekick/Sidekick_util__Vec_sig/index.html
index d2f4e277..727bca89 100644
--- a/dev/sidekick/Sidekick_util__Vec_sig/index.html
+++ b/dev/sidekick/Sidekick_util__Vec_sig/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_util__Vec_sig (sidekick.Sidekick_util__Vec_sig)
Module Sidekick_util__Vec_sig

\ No newline at end of file
+Sidekick_util__Vec_sig (sidekick.Sidekick_util__Vec_sig)
Module Sidekick_util__Vec_sig

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_util__Vec_unit/index.html b/dev/sidekick/Sidekick_util__Vec_unit/index.html
index 99a56f34..8ed3f7d5 100644
--- a/dev/sidekick/Sidekick_util__Vec_unit/index.html
+++ b/dev/sidekick/Sidekick_util__Vec_unit/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_util__Vec_unit (sidekick.Sidekick_util__Vec_unit)
Module Sidekick_util__Vec_unit

\ No newline at end of file
+Sidekick_util__Vec_unit (sidekick.Sidekick_util__Vec_unit)
Module Sidekick_util__Vec_unit

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_zarith/Int/index.html b/dev/sidekick/Sidekick_zarith/Int/index.html
index c15bf59b..68ad0778 100644
--- a/dev/sidekick/Sidekick_zarith/Int/index.html
+++ b/dev/sidekick/Sidekick_zarith/Int/index.html
@@ -1,2 +1,2 @@
 
-Int (sidekick.Sidekick_zarith.Int)
Module Sidekick_zarith.Int
include Sidekick_arith.NUM with type t = Z.t
type t = Z.t
val zero : t
val one : t
val minus_one : t
val sign : t -> int
val of_int : int -> t
include Sidekick_sigs.EQ with type t := t
val equal : t -> t -> bool
include Sidekick_sigs.ORD with type t := t
val compare : t -> t -> int
include Sidekick_sigs.HASH with type t := t
val hash : t -> int
include Sidekick_sigs.PRINT with type t := t
val pp : t CCFormat.printer
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
val (~-) : t -> t
val neg : t -> t
val min : t -> t -> t
val max : t -> t -> t
val (=) : t -> t -> bool
val (<>) : t -> t -> bool
val (>) : t -> t -> bool
val (>=) : t -> t -> bool
val (<) : t -> t -> bool
val (<=) : t -> t -> bool
val succ : t -> t

\ No newline at end of file
+Int (sidekick.Sidekick_zarith.Int)
Module Sidekick_zarith.Int
include Sidekick_arith.NUM with type t = Z.t
type t = Z.t
val zero : t
val one : t
val minus_one : t
val sign : t -> int
val of_int : int -> t
include Sidekick_sigs.EQ with type t := t
val equal : t -> t -> bool
include Sidekick_sigs.ORD with type t := t
val compare : t -> t -> int
include Sidekick_sigs.HASH with type t := t
val hash : t -> int
include Sidekick_sigs.PRINT with type t := t
val pp : t CCFormat.printer
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
val (~-) : t -> t
val neg : t -> t
val min : t -> t -> t
val max : t -> t -> t
val (=) : t -> t -> bool
val (<>) : t -> t -> bool
val (>) : t -> t -> bool
val (>=) : t -> t -> bool
val (<) : t -> t -> bool
val (<=) : t -> t -> bool
val succ : t -> t

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_zarith/Rational/index.html b/dev/sidekick/Sidekick_zarith/Rational/index.html
index 2bd443fd..68635893 100644
--- a/dev/sidekick/Sidekick_zarith/Rational/index.html
+++ b/dev/sidekick/Sidekick_zarith/Rational/index.html
@@ -1,2 +1,2 @@
 
-Rational (sidekick.Sidekick_zarith.Rational)
Module Sidekick_zarith.Rational
include Sidekick_arith.NUM with type t = Q.t
type t = Q.t
val zero : t
val one : t
val minus_one : t
val sign : t -> int
val of_int : int -> t
include Sidekick_sigs.EQ with type t := t
val equal : t -> t -> bool
include Sidekick_sigs.ORD with type t := t
val compare : t -> t -> int
include Sidekick_sigs.HASH with type t := t
val hash : t -> int
include Sidekick_sigs.PRINT with type t := t
val pp : t CCFormat.printer
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
val (~-) : t -> t
val neg : t -> t
val min : t -> t -> t
val max : t -> t -> t
val (=) : t -> t -> bool
val (<>) : t -> t -> bool
val (>) : t -> t -> bool
val (>=) : t -> t -> bool
val (<) : t -> t -> bool
val (<=) : t -> t -> bool
type bigint = Z.t
val (/) : t -> t -> t
val num : t -> bigint
val denum : t -> bigint
val pp_approx : int -> Stdlib.Format.formatter -> t -> unit
Pretty print rational with given amount of precision (for example as a floating point number)

\ No newline at end of file
+Rational (sidekick.Sidekick_zarith.Rational)
Module Sidekick_zarith.Rational
include Sidekick_arith.NUM with type t = Q.t
type t = Q.t
val zero : t
val one : t
val minus_one : t
val sign : t -> int
val of_int : int -> t
include Sidekick_sigs.EQ with type t := t
val equal : t -> t -> bool
include Sidekick_sigs.ORD with type t := t
val compare : t -> t -> int
include Sidekick_sigs.HASH with type t := t
val hash : t -> int
include Sidekick_sigs.PRINT with type t := t
val pp : t CCFormat.printer
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
val (~-) : t -> t
val neg : t -> t
val min : t -> t -> t
val max : t -> t -> t
val (=) : t -> t -> bool
val (<>) : t -> t -> bool
val (>) : t -> t -> bool
val (>=) : t -> t -> bool
val (<) : t -> t -> bool
val (<=) : t -> t -> bool
type bigint = Z.t
val (/) : t -> t -> t
val num : t -> bigint
val denum : t -> bigint
val pp_approx : int -> Stdlib.Format.formatter -> t -> unit
Pretty print rational with given amount of precision (for example as a floating point number)

\ No newline at end of file
diff --git a/dev/sidekick/Sidekick_zarith/index.html b/dev/sidekick/Sidekick_zarith/index.html
index 5b917022..2ca4d7d1 100644
--- a/dev/sidekick/Sidekick_zarith/index.html
+++ b/dev/sidekick/Sidekick_zarith/index.html
@@ -1,2 +1,2 @@
 
-Sidekick_zarith (sidekick.Sidekick_zarith)
Module Sidekick_zarith
module Int : Sidekick_arith.INT with type t = Z.t
module Rational : Sidekick_arith.RATIONAL with type t = Q.t and type bigint = Z.t

\ No newline at end of file
+Sidekick_zarith (sidekick.Sidekick_zarith)
Module Sidekick_zarith
module Int : Sidekick_arith.INT with type t = Z.t
module Rational : Sidekick_arith.RATIONAL with type t = Q.t and type bigint = Z.t

\ No newline at end of file
diff --git a/dev/sidekick/index.html b/dev/sidekick/index.html
index 226f8255..6c97262b 100644
--- a/dev/sidekick/index.html
+++ b/dev/sidekick/index.html
@@ -1,2 +1,2 @@
 
-index (sidekick.index)
sidekick index
Library sidekick.arith
The entry point of this library is the module: Sidekick_arith.
Library sidekick.arith-lra
The entry point of this library is the module: Sidekick_arith_lra.
Library sidekick.cc
The entry point of this library is the module: Sidekick_cc.
Library sidekick.core
The entry point of this library is the module: Sidekick_core.
Library sidekick.drup
The entry point of this library is the module: Sidekick_drup.
Library sidekick.lit
The entry point of this library is the module: Sidekick_lit.
Library sidekick.memtrace
The entry point of this library is the module: Sidekick_memtrace.
Library sidekick.mini-cc
The entry point of this library is the module: Sidekick_mini_cc.
Library sidekick.quip
The entry point of this library is the module: Sidekick_quip.
Library sidekick.sat
The entry point of this library is the module: Sidekick_sat.
Library sidekick.sigs
The entry point of this library is the module: Sidekick_sigs.
Library sidekick.smt-solver
The entry point of this library is the module: Sidekick_smt_solver.
Library sidekick.tef
The entry point of this library is the module: Sidekick_tef.
Library sidekick.th-bool-static
The entry point of this library is the module: Sidekick_th_bool_static.
Library sidekick.th-cstor
The entry point of this library is the module: Sidekick_th_cstor.
Library sidekick.th-data
The entry point of this library is the module: Sidekick_th_data.
Library sidekick.util
The entry point of this library is the module: Sidekick_util.
Library sidekick.zarith
The entry point of this library is the module: Sidekick_zarith.

\ No newline at end of file
+index (sidekick.index)
sidekick index
Library sidekick.arith
The entry point of this library is the module: Sidekick_arith.
Library sidekick.arith-lra
The entry point of this library is the module: Sidekick_arith_lra.
Library sidekick.cc
The entry point of this library is the module: Sidekick_cc.
Library sidekick.core
The entry point of this library is the module: Sidekick_core.
Library sidekick.drup
The entry point of this library is the module: Sidekick_drup.
Library sidekick.lit
The entry point of this library is the module: Sidekick_lit.
Library sidekick.memtrace
The entry point of this library is the module: Sidekick_memtrace.
Library sidekick.mini-cc
The entry point of this library is the module: Sidekick_mini_cc.
Library sidekick.quip
The entry point of this library is the module: Sidekick_quip.
Library sidekick.sat
The entry point of this library is the module: Sidekick_sat.
Library sidekick.sigs
The entry point of this library is the module: Sidekick_sigs.
Library sidekick.smt-solver
The entry point of this library is the module: Sidekick_smt_solver.
Library sidekick.tef
The entry point of this library is the module: Sidekick_tef.
Library sidekick.th-bool-static
The entry point of this library is the module: Sidekick_th_bool_static.
Library sidekick.th-cstor
The entry point of this library is the module: Sidekick_th_cstor.
Library sidekick.th-data
The entry point of this library is the module: Sidekick_th_data.
Library sidekick.util
The entry point of this library is the module: Sidekick_util.
Library sidekick.zarith
The entry point of this library is the module: Sidekick_zarith.

\ No newline at end of file