blob: b4d3e68075e1e7705cb7e8838cad38a17d8962eb (
plain)
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
|
/*
* 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 clause.h
/// @brief A clause is a disjunction of literals, with provenance tracking.
///
/// NOTE: V1 uses std::vector<Literal> for simplicity.
/// Future optimization: migrate to a Clause Arena with contiguous storage.
#include <vector>
#include "atp/core/literal.h"
#include "atp/core/types.h"
namespace atp {
/// A clause: a disjunction of literals plus provenance for proof reconstruction.
struct Clause {
ClauseId id = kInvalidId;
std::vector<Literal> literals;
// Provenance (for proof trace)
InferenceRule rule = InferenceRule::kInput;
ClauseId parent1 = kInvalidId;
ClauseId parent2 = kInvalidId;
uint16_t depth = 0; ///< Derivation depth (for BFS scheduling)
/// True if the clause has no literals (contradiction).
[[nodiscard]] bool isEmpty() const { return literals.empty(); }
/// Number of literals.
[[nodiscard]] size_t size() const { return literals.size(); }
};
} // namespace atp
|
