aboutsummaryrefslogtreecommitdiff
path: root/include/atp/simplify/tautology.h
blob: f17f0c72bdfd3735c64e72698280d0e3fb1214d0 (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
/*
 * 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 tautology.h
/// @brief Tautology detection for clauses.

#include "atp/core/clause.h"

namespace atp {

/// Returns true if the clause is a tautology (contains complementary literals).
[[nodiscard]] bool isTautology(const Clause& clause);

}  // namespace atp