blob: cda6c5b0743aaeaf69b834eb55337aea939dd8bd (
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
54
|
/*
* 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 proof_trace.h
/// @brief Proof reconstruction from the empty clause back to axioms.
///
/// This module depends only on ClauseStore (not Prover), so it can be
/// reused with any search strategy.
#include "atp/core/clause.h"
#include "atp/core/clause_store.h"
#include "atp/core/term_bank.h"
#include <string>
#include <vector>
namespace atp {
/// A single step in a reconstructed proof.
struct ProofStep {
ClauseId clause_id;
InferenceRule rule;
ClauseId parent1;
ClauseId parent2;
std::string description; ///< Human-readable description
};
/// Reconstruct the proof trace from the empty clause.
/// Walks parent pointers via ClauseStore, independent of search strategy.
std::vector<ProofStep> extractProof(const ClauseStore& store, ClauseId empty_clause_id,
const TermBank& bank);
/// Format a proof as a human-readable string.
std::string formatProof(const std::vector<ProofStep>& proof, const TermBank& bank);
} // namespace atp
|
