3 files changed, 187 insertions, 0 deletions
diff --git a/proofsearch/src/core/clause_store.cc b/proofsearch/src/core/clause_store.cc
new file mode 100644
index 0000000..f8ee73d
--- /dev/null
+++ b/proofsearch/src/core/clause_store.cc
@@ -0,0 +1,59 @@
+/*
+ * 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/>.
+ */
+
+#include "atp/core/clause_store.h"
+
+#include "atp/core/clause.h"
+#include "atp/core/types.h"
+
+#include <cassert>
+#include <cstddef>
+#include <functional>
+#include <utility>
+
+namespace atp {
+
+ClauseId ClauseStore::addClause(Clause clause) {
+    auto new_id = static_cast<ClauseId>(clauses_.size());
+    clause.id_ = new_id;
+    clauses_.push_back(std::move(clause));
+    return new_id;
+}
+
+const Clause& ClauseStore::getClause(ClauseId id) const {
+    assert(id < clauses_.size() && "ClauseId out of bounds!");
+    return clauses_[id];
+}
+
+Clause& ClauseStore::getMutableClause(ClauseId id) {
+    assert(id < clauses_.size() && "ClauseId out of bounds!");
+    return clauses_[id];
+}
+
+size_t ClauseStore::size() const {
+    return clauses_.size();
+}
+
+void ClauseStore::forEach(const std::function<void(const Clause&)>& visitor) const {
+    for (const auto& clause : clauses_) {
+        // TODO: Tombstone mechanism
+        visitor(clause);
+    }
+}
+
+}  // namespace atp
diff --git a/proofsearch/src/core/symbol_table.cc b/proofsearch/src/core/symbol_table.cc
new file mode 100644
index 0000000..b707132
--- /dev/null
+++ b/proofsearch/src/core/symbol_table.cc
@@ -0,0 +1,65 @@
+/*
+ * 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/>.
+ */
+
+#include "atp/core/symbol_table.h"
+
+#include "atp/core/types.h"
+
+#include <cstddef>
+#include <cstdint>
+#include <stdexcept>
+#include <string>
+#include <string_view>
+
+namespace atp {
+
+SymbolId SymbolTable::intern(std::string_view name, SymbolKind kind, uint16_t arity, SortId sort) {
+    auto it = name_to_id_.find(name);
+    if (it != name_to_id_.end()) {
+        SymbolId const id = it->second;
+        SymbolInfo const& info = infos_[id];
+        if (info.kind_ != kind || info.arity_ != arity) {
+            throw std::runtime_error("Symbol kind or arity mismatch for: " + std::string(name));
+        }
+        return id;
+    }
+    auto new_id = static_cast<SymbolId>(infos_.size());
+    infos_.push_back(SymbolInfo{
+        .name_ = std::string(name), .kind_ = kind, .arity_ = arity, .sort_ = sort});
+    std::string_view const stable_name_view = infos_.back().name_;
+    name_to_id_.emplace(stable_name_view, new_id);
+    return new_id;
+}
+
+std::string_view SymbolTable::getName(SymbolId id) const {
+    return infos_[id].name_;
+}
+
+const SymbolInfo& SymbolTable::getInfo(SymbolId id) const {
+    return infos_[id];
+}
+
+bool SymbolTable::isVariable(SymbolId id) const {
+    return infos_[id].kind_ == SymbolKind::kVariable;
+}
+
+size_t SymbolTable::size() const {
+    return infos_.size();
+}
+
+}  // namespace atp
diff --git a/proofsearch/src/core/term_bank.cc b/proofsearch/src/core/term_bank.cc
new file mode 100644
index 0000000..0dc166f
--- /dev/null
+++ b/proofsearch/src/core/term_bank.cc
@@ -0,0 +1,63 @@
+/*
+ * 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/>.
+ */
+
+#include "atp/core/term_bank.h"
+
+#include "atp/core/term.h"
+#include "atp/core/types.h"
+
+#include <cassert>
+#include <cstddef>
+#include <span>
+#include <utility>
+#include <vector>
+
+namespace atp {
+
+TermId TermBank::makeTerm(SymbolId symbol, std::span<const TermId> args) {
+    TermKey key{.symbol_ = symbol, .args_ = {args.begin(), args.end()}};
+    auto it = term_to_id_.find(key);
+    if (it != term_to_id_.end()) {
+        return it->second;
+    }
+    auto new_id = static_cast<TermId>(terms_.size());
+    Term new_term{.symbol_id_ = symbol, .args_ = key.args_};
+    terms_.push_back(std::move(new_term));
+    term_to_id_.emplace(std::move(key), new_id);
+    return new_id;
+}
+
+TermId TermBank::makeVar(SymbolId var_symbol) {
+    return makeTerm(var_symbol, {});
+}
+
+const Term& TermBank::getTerm(TermId id) const {
+    assert(id < terms_.size() && "TermId out of bounds!");
+    return terms_[id];
+}
+
+bool TermBank::isVariable(TermId id) const {
+    assert(id < terms_.size() && "TermId out of bounds!");
+    return symbols_->isVariable(terms_[id].symbol_id_);
+}
+
+size_t TermBank::size() const {
+    return terms_.size();
+}
+
+}  // namespace atp