style: reformat codebase with consistent indentation

2 files changed, 26 insertions, 26 deletions

diff --git a/proofsearch/src/simplify/subsumption.cc b/proofsearch/src/simplify/subsumption.cc
index cf243c9..3756d82 100644
--- a/proofsearch/src/simplify/subsumption.cc
+++ b/proofsearch/src/simplify/subsumption.cc
@@ -18,25 +18,24 @@
 
 #include "atp/simplify/subsumption.h"
 
-
 namespace atp {
 
-    bool subsumes(const Clause& general, const Clause& specific) {
-        if (general.size() > specific.size()) {
-            return false;
-        }
-        for (const auto& lit_g : general.literals) {
-            bool found = false;
-            for (const auto& lit_s : specific.literals) {
-                if (lit_g.atom == lit_s.atom && lit_g.is_positive == lit_s.is_positive) {
-                    found = true;
-                    break;
-                }
-            }
-            if (!found) {
-                return false;
+bool subsumes(const Clause& general, const Clause& specific) {
+    if (general.size() > specific.size()) {
+        return false;
+    }
+    for (const auto& lit_g : general.literals) {
+        bool found = false;
+        for (const auto& lit_s : specific.literals) {
+            if (lit_g.atom == lit_s.atom && lit_g.is_positive == lit_s.is_positive) {
+                found = true;
+                break;
             }
         }
-        return true;
+        if (!found) {
+            return false;
+        }
     }
+    return true;
 }
+}  // namespace atp
diff --git a/proofsearch/src/simplify/tautology.cc b/proofsearch/src/simplify/tautology.cc
index d41ecd7..70bdced 100644
--- a/proofsearch/src/simplify/tautology.cc
+++ b/proofsearch/src/simplify/tautology.cc
@@ -17,18 +17,19 @@
  */
 
 #include "atp/simplify/tautology.h"
+
 #include <cstddef>
 
- namespace atp {
-    bool isTautology(const Clause& clause) {
-        for (size_t i = 0; i < clause.size(); ++i) {
-            for (size_t j = i + 1; j < clause.size(); ++j) {
-                if (clause.literals[i].atom == clause.literals[j].atom && 
-                    clause.literals[i].is_positive != clause.literals[j].is_positive) {
-                    return true;
-                }
+namespace atp {
+bool isTautology(const Clause& clause) {
+    for (size_t i = 0; i < clause.size(); ++i) {
+        for (size_t j = i + 1; j < clause.size(); ++j) {
+            if (clause.literals[i].atom == clause.literals[j].atom &&
+                clause.literals[i].is_positive != clause.literals[j].is_positive) {
+                return true;
             }
         }
-        return false;
     }
-}
\ No newline at end of file
+    return false;
+}
+}  // namespace atp
\ No newline at end of file