Initial commit: Build project architecture, define interfaces, write documentation, with the help of Claude

1 files changed, 38 insertions, 0 deletions

diff --git a/include/atp/normalize/clausifier.h b/include/atp/normalize/clausifier.h
new file mode 100644
index 0000000..1ff4d27
--- /dev/null
+++ b/include/atp/normalize/clausifier.h
@@ -0,0 +1,38 @@
+/*
+ * richard-atp-engine: A saturation-based automated theorem prover for first-order logic.
+ * Copyright (C) 2026 Richard Qin
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+
+#pragma once
+
+/// @file clausifier.h
+/// @brief Converts FOL formulas to Clause Normal Form (CNF).
+///
+/// Pipeline: eliminate ↔/→  →  NNF  →  Skolemize  →  distribute ∨ over ∧  →  flatten.
+
+#include "atp/core/clause.h"
+#include "atp/core/term_bank.h"
+#include "atp/normalize/formula.h"
+
+#include <vector>
+
+namespace atp {
+
+/// Convert a first-order formula into a set of clauses (CNF).
+std::vector<Clause> clausify(const Formula& formula, TermBank& bank);
+
+}  // namespace atp