1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
|
/*
* 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 prover.h
/// @brief The Given Clause Loop — main saturation-based proof search.
///
/// V1: Uses a simple ProverConfig with hardcoded resolution + factoring.
/// V2: Will be refactored to accept a Calculus object from strategy/ module
/// for dynamic algorithm loading per problem type.
#include "atp/core/clause.h"
#include "atp/core/clause_store.h"
#include "atp/core/term_bank.h"
#include "atp/search/clause_queue.h"
#include <optional>
#include <queue>
#include <vector>
namespace atp {
/// Result of a proof attempt.
enum class ProverResult : uint8_t {
kTheorem, ///< Empty clause derived — conjecture is a theorem
kSaturation, ///< Search space saturated — cannot prove
kTimeout, ///< Resource limit exceeded
};
/// V1 configuration — simple and direct.
/// Future: replaced by strategy::Calculus for dynamic rule loading.
struct ProverConfig {
ClauseComparator comparator_ = bfsCompare;
size_t max_clauses_ = 100000; ///< Safety limit
size_t max_iterations_ = 500000; ///< Safety limit
bool enable_occurs_check_ = false;
};
/// Main prover class implementing the Given Clause Loop.
/// V1: hardcodes resolution + factoring + subsumption.
/// V2: will accept a Calculus object for pluggable inference rules.
class Prover {
public:
Prover(TermBank& bank, ClauseStore& store, ProverConfig config = {});
/// Add initial clauses (axioms + negated conjecture).
void addClauses(std::vector<Clause> clauses);
/// Run the proof search.
ProverResult prove();
/// After a successful proof, retrieve the empty clause ID.
[[nodiscard]] std::optional<ClauseId> getEmptyClauseId() const;
/// Access the underlying clause store.
[[nodiscard]] const ClauseStore& clauseStore() const { return store_; }
private:
[[nodiscard]] bool hitResourceLimit(size_t iterations) const;
[[nodiscard]] Clause popGivenClause();
[[nodiscard]] bool isForwardSubsumedByProcessed(const Clause& clause) const;
[[nodiscard]] bool shouldSkipGiven(const Clause& given) const;
void applyBackwardSubsumption(const Clause& given);
[[nodiscard]] std::vector<Clause> generateNewClauses(const Clause& given) const;
[[nodiscard]] uint16_t computeDepth(const Clause& clause) const;
[[nodiscard]] std::optional<ClauseId> processNewClauses(std::vector<Clause> new_clauses);
TermBank& bank_;
ClauseStore& store_;
ProverConfig config_;
std::priority_queue<Clause, std::vector<Clause>, ClauseComparator> unprocessed_;
std::vector<ClauseId> processed_;
std::optional<ClauseId> empty_clause_id_;
};
} // namespace atp
|
