From 5f25eb5aa2209ec7a7033dda1d33ea2ac321e428 Mon Sep 17 00:00:00 2001 From: Nikolaj Bjorner Date: Fri, 11 Jul 2025 19:18:35 +0200 Subject: [PATCH] remove confusing construction Signed-off-by: Nikolaj Bjorner --- src/nlsat/nlsat_solver.h | 4 +--- 1 file changed, 1 insertion(+), 3 deletions(-) diff --git a/src/nlsat/nlsat_solver.h b/src/nlsat/nlsat_solver.h index b27691753..ddff95255 100644 --- a/src/nlsat/nlsat_solver.h +++ b/src/nlsat/nlsat_solver.h @@ -225,9 +225,7 @@ namespace nlsat { // l_false - update the list of assumptions (possibly reset it to empty), and a set of polynomials in core, // such that the conjunction of the assumptions and the polynomials in core is unsatisfiable. // l_undef - if the search was interrupted by a resource limit. - // Core is a list of polynomials. We associate literals as follows: - // For ~ in { >, <, = } If p(rvalues) ~ 0, then lit is p ~ 0. Their negations are used in the conflict clause. - // (this constrains the kind of literals for the conflict clause and may be revisited). + // Core is a list of polynomials. We associate literals as follows: TBD // Different implementations of check are possible. One where core comprises of linear polynomials could // produce lemmas that are friendly to linear arithmetic solvers. //