From bf4f464cec8b6515d9e5131d43847ef9b2fd21d1 Mon Sep 17 00:00:00 2001 From: Richard Qin Date: Sat, 4 Apr 2026 05:21:26 +0800 Subject: style: reformat codebase with consistent indentation --- include/atp/normalize/formula.h | 24 +++++++++++------------- 1 file changed, 11 insertions(+), 13 deletions(-) (limited to 'include/atp/normalize') diff --git a/include/atp/normalize/formula.h b/include/atp/normalize/formula.h index 2cd7900..1bcc021 100644 --- a/include/atp/normalize/formula.h +++ b/include/atp/normalize/formula.h @@ -35,15 +35,15 @@ namespace atp { /// AST node types for first-order logic formulas. enum class FormulaKind : uint8_t { - kAtom, ///< Predicate application: P(t1, ..., tn) - kEquality, ///< Equality atom: t1 = t2 (distinguished for equality reasoning) - kNot, ///< Negation: ¬F - kAnd, ///< Conjunction: F ∧ G - kOr, ///< Disjunction: F ∨ G - kImplies, ///< Implication: F → G - kIff, ///< Biconditional: F ↔ G - kForall, ///< Universal: ∀x. F - kExists, ///< Existential: ∃x. F + kAtom, ///< Predicate application: P(t1, ..., tn) + kEquality, ///< Equality atom: t1 = t2 (distinguished for equality reasoning) + kNot, ///< Negation: ¬F + kAnd, ///< Conjunction: F ∧ G + kOr, ///< Disjunction: F ∨ G + kImplies, ///< Implication: F → G + kIff, ///< Biconditional: F ↔ G + kForall, ///< Universal: ∀x. F + kExists, ///< Existential: ∃x. F }; /// A first-order logic formula node. @@ -77,10 +77,8 @@ struct Formula { std::unique_ptr rhs); static std::unique_ptr makeIff(std::unique_ptr lhs, std::unique_ptr rhs); - static std::unique_ptr makeForall(SymbolId var, - std::unique_ptr body); - static std::unique_ptr makeExists(SymbolId var, - std::unique_ptr body); + static std::unique_ptr makeForall(SymbolId var, std::unique_ptr body); + static std::unique_ptr makeExists(SymbolId var, std::unique_ptr body); }; } // namespace atp -- cgit v1.2.3