aboutsummaryrefslogtreecommitdiff
path: root/include/atp/strategy
diff options
context:
space:
mode:
authorRichard Qin <richard.qin.x@gmail.com>2026-04-04 05:21:26 +0800
committerRichard Qin <richard.qin.x@gmail.com>2026-04-04 05:21:26 +0800
commitbf4f464cec8b6515d9e5131d43847ef9b2fd21d1 (patch)
tree8cff611e6dab7473c3bb601e58658fa44f0fd86f /include/atp/strategy
parent6fac8eb886f1e60a5a075c48a5f7648bb537f74e (diff)
downloadratp-bf4f464cec8b6515d9e5131d43847ef9b2fd21d1.tar.gz
ratp-bf4f464cec8b6515d9e5131d43847ef9b2fd21d1.tar.xz
style: reformat codebase with consistent indentation
Diffstat (limited to 'include/atp/strategy')
-rw-r--r--include/atp/strategy/calculus.h1
-rw-r--r--include/atp/strategy/inference_rule.h11
-rw-r--r--include/atp/strategy/problem_analyzer.h7
3 files changed, 8 insertions, 11 deletions
diff --git a/include/atp/strategy/calculus.h b/include/atp/strategy/calculus.h
index ee8ee09..e06988e 100644
--- a/include/atp/strategy/calculus.h
+++ b/include/atp/strategy/calculus.h
@@ -16,7 +16,6 @@
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
-
#pragma once
/// @file calculus.h
diff --git a/include/atp/strategy/inference_rule.h b/include/atp/strategy/inference_rule.h
index 1c7dbba..88b6fe0 100644
--- a/include/atp/strategy/inference_rule.h
+++ b/include/atp/strategy/inference_rule.h
@@ -16,7 +16,6 @@
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
-
#pragma once
/// @file inference_rule.h
@@ -62,9 +61,10 @@ class GeneratingRule : public InferenceRuleBase {
/// @param processed All previously processed clauses (accessed via store).
/// @param bank The global term bank.
/// @return Newly generated clauses (not yet added to the store).
- [[nodiscard]] virtual std::vector<Clause> generate(
- const Clause& given, const std::vector<ClauseId>& processed,
- const ClauseStore& store, TermBank& bank) const = 0;
+ [[nodiscard]] virtual std::vector<Clause> generate(const Clause& given,
+ const std::vector<ClauseId>& processed,
+ const ClauseStore& store,
+ TermBank& bank) const = 0;
};
/// Simplifying inference rule: rewrite or delete a clause in-place.
@@ -74,8 +74,7 @@ class SimplifyingRule : public InferenceRuleBase {
/// Attempt to simplify a clause. Returns true if the clause was modified.
/// If the clause should be deleted entirely, clear its literals.
- virtual bool simplify(Clause& clause, const ClauseStore& store,
- TermBank& bank) const = 0;
+ virtual bool simplify(Clause& clause, const ClauseStore& store, TermBank& bank) const = 0;
};
} // namespace atp
diff --git a/include/atp/strategy/problem_analyzer.h b/include/atp/strategy/problem_analyzer.h
index b5fdef4..5e6c5cf 100644
--- a/include/atp/strategy/problem_analyzer.h
+++ b/include/atp/strategy/problem_analyzer.h
@@ -16,7 +16,6 @@
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
-
#pragma once
/// @file problem_analyzer.h
@@ -41,10 +40,10 @@ namespace atp {
/// Features detected in the input problem.
struct ProblemFeatures {
- bool has_equality = false; ///< Contains '=' predicate
+ bool has_equality = false; ///< Contains '=' predicate
bool is_purely_propositional = false; ///< No function symbols, no variables
- bool is_horn = false; ///< All clauses are Horn clauses
- bool has_existential = false; ///< Had existential quantifiers (Skolemized)
+ bool is_horn = false; ///< All clauses are Horn clauses
+ bool has_existential = false; ///< Had existential quantifiers (Skolemized)
size_t num_clauses = 0;
size_t num_predicates = 0;
size_t num_functions = 0;