clang-format

diff --git a/src/theory/arith/constraint.cpp b/src/theory/arith/constraint.cpp
index cdab772f85d1b5ce689ca185a280d897be996807..11c6c15a72a7522d1aeb188ad2727c8b07be1d4b 100644 (file)
--- a/src/theory/arith/constraint.cpp
+++ b/src/theory/arith/constraint.cpp
@@ -503,8 +503,7 @@ bool Constraint::hasSimpleFarkasProof() const
 
   // For each antecdent ...
   AntecedentId i = getConstraintRule().d_antecedentEnd;
-  for (ConstraintCP a = d_database->getAntecedent(i);
-       a != NullConstraint;
+  for (ConstraintCP a = d_database->getAntecedent(i); a != NullConstraint;
        a = d_database->getAntecedent(--i))
   {
     // ... that antecdent must be an assumption ...

diff --git a/src/theory/arith/theory_arith_private.cpp b/src/theory/arith/theory_arith_private.cpp
index 54bac3e26618dbf944506079e6f93b914f2de2a6..4e2a5bba19b1ecd6857cc5616dfb1e5cd731a607 100644 (file)
--- a/src/theory/arith/theory_arith_private.cpp
+++ b/src/theory/arith/theory_arith_private.cpp
@@ -4954,7 +4954,9 @@ bool TheoryArithPrivate::rowImplicationCanBeApplied(RowIndex ridx, bool rowUp, C
         Assert(coeffs != RationalVectorPSentinel);
         Assert(conflictInFarkasCoefficientOrder.getNumChildren()
                == coeffs->size());
-        if (std::all_of(explain.begin(), explain.end(), [](ConstraintCP c) { return c->isAssumption() || c->hasIntTightenProof(); }))
+        if (std::all_of(explain.begin(), explain.end(), [](ConstraintCP c) {
+              return c->isAssumption() || c->hasIntTightenProof();
+            }))
         {
           d_containing.d_proofRecorder->saveFarkasCoefficients(
               conflictInFarkasCoefficientOrder, coeffs);