@stevenvo780/st-lang 3.2.3 → 4.0.0

package/dist/solver/cdcl-v2/clause-learning.d.ts

@@ -0,0 +1,33 @@
+export interface AnalysisResult {
+    /** Cláusula aprendida. learned[0] es el literal asertivo (a propagar tras backtrack). */
+    learned: Int32Array;
+    /** Nivel de decisión al que retroceder (0 si la cláusula es unitaria). */
+    btLevel: number;
+    /** Variables que fueron "bumped" durante el análisis (para que VSIDS las premie). */
+    bumped: number[];
+}
+/** Función mínima requerida del solver para acceder al antecedente de cada lit. */
+export interface ConflictContext {
+    /** Array de cláusulas indexadas por índice (mutable, learned clauses incluidas). */
+    clauses: ReadonlyArray<Int32Array>;
+    /** Trail completo de literales asignados en orden. */
+    trail: ReadonlyArray<number>;
+    /** Nivel de decisión actual. */
+    currentLevel: number;
+    /** Nivel de decisión en que se asignó cada variable (1-indexado, -1 si libre). */
+    varLevel: Int32Array;
+    /** Cláusula antecedente que propagó cada variable (-1 si fue decisión). */
+    varAnte: Int32Array;
+}
+/**
+ * Analiza un conflicto usando el esquema 1UIP.
+ *
+ * @param conflictCi cláusula que entró en conflicto durante BCP.
+ * @param ctx contexto inmutable del solver (trail, levels, antecedents).
+ * @returns cláusula aprendida + nivel de backtrack + variables bumpeadas.
+ *
+ * Si retorna learned.length === 0 y btLevel === -1, el solver debe interpretar
+ * UNSAT raíz (conflicto en nivel 0).
+ */
+export declare function analyzeConflict1UIP(conflictCi: number, ctx: ConflictContext): AnalysisResult;
+//# sourceMappingURL=clause-learning.d.ts.map

package/dist/solver/cdcl-v2/clause-learning.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"clause-learning.d.ts","sourceRoot":"","sources":["../../../src/solver/cdcl-v2/clause-learning.ts"],"names":[],"mappings":"AAQA,MAAM,WAAW,cAAc;IAC7B,yFAAyF;IACzF,OAAO,EAAE,UAAU,CAAC;IACpB,0EAA0E;IAC1E,OAAO,EAAE,MAAM,CAAC;IAChB,qFAAqF;IACrF,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED,mFAAmF;AACnF,MAAM,WAAW,eAAe;IAC9B,oFAAoF;IACpF,OAAO,EAAE,aAAa,CAAC,UAAU,CAAC,CAAC;IACnC,sDAAsD;IACtD,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;IAC7B,gCAAgC;IAChC,YAAY,EAAE,MAAM,CAAC;IACrB,kFAAkF;IAClF,QAAQ,EAAE,UAAU,CAAC;IACrB,2EAA2E;IAC3E,OAAO,EAAE,UAAU,CAAC;CACrB;AAED;;;;;;;;;GASG;AACH,wBAAgB,mBAAmB,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,EAAE,eAAe,GAAG,cAAc,CA0F5F"}

package/dist/solver/cdcl-v2/clause-learning.js

@@ -0,0 +1,110 @@
+"use strict";
+// First-UIP Conflict Analysis — Marques-Silva & Sakallah (GRASP, 1996).
+// Recorremos hacia atrás el grafo de implicaciones desde la cláusula en
+// conflicto hasta hallar el primer Unique Implication Point: el único
+// literal del nivel de decisión actual que queda en la "frontera" del
+// corte. Eso produce la cláusula aprendida mínima respecto al esquema 1UIP.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.analyzeConflict1UIP = analyzeConflict1UIP;
+const state_1 = require("./state");
+/**
+ * Analiza un conflicto usando el esquema 1UIP.
+ *
+ * @param conflictCi cláusula que entró en conflicto durante BCP.
+ * @param ctx contexto inmutable del solver (trail, levels, antecedents).
+ * @returns cláusula aprendida + nivel de backtrack + variables bumpeadas.
+ *
+ * Si retorna learned.length === 0 y btLevel === -1, el solver debe interpretar
+ * UNSAT raíz (conflicto en nivel 0).
+ */
+function analyzeConflict1UIP(conflictCi, ctx) {
+    const { clauses, trail, currentLevel, varLevel, varAnte } = ctx;
+    if (currentLevel === 0) {
+        return { learned: new Int32Array(0), btLevel: -1, bumped: [] };
+    }
+    const numVarsPlus1 = varLevel.length;
+    const seen = new Uint8Array(numVarsPlus1);
+    const outLits = [];
+    const bumped = [];
+    let counter = 0;
+    let btLevel = 0;
+    // addLits: agrega los literales de la cláusula `ci` (excepto skipVar) al
+    // conjunto "seen", actualizando counter (lits del nivel actual) y outLits.
+    const addLits = (ci, skipVar) => {
+        const c = clauses[ci];
+        if (!c)
+            return;
+        for (let i = 0; i < c.length; i++) {
+            const lit = c[i] ?? 0;
+            const v = Math.abs(lit);
+            if (v === 0 || v === skipVar || seen[v])
+                continue;
+            seen[v] = 1;
+            bumped.push(v);
+            const lvl = varLevel[v];
+            if (lvl === currentLevel) {
+                counter++;
+            }
+            else if (lvl > 0) {
+                outLits.push(lit);
+                if (lvl > btLevel)
+                    btLevel = lvl;
+            }
+        }
+    };
+    addLits(conflictCi, 0);
+    let ti = trail.length - 1;
+    let assertLit = 0;
+    while (counter > 0) {
+        while (ti >= 0 && !seen[Math.abs(trail[ti] ?? 0)])
+            ti--;
+        if (ti < 0)
+            break;
+        const p = trail[ti] ?? 0;
+        ti--;
+        const v = Math.abs(p);
+        seen[v] = 0;
+        counter--;
+        if (counter === 0) {
+            assertLit = -p;
+        }
+        else if (varAnte[v] !== state_1.NO_ANTECEDENT) {
+            addLits(varAnte[v], v);
+        }
+    }
+    const learned = [];
+    if (assertLit !== 0)
+        learned.push(assertLit);
+    for (const l of outLits)
+        learned.push(l);
+    if (learned.length === 0) {
+        return { learned: new Int32Array(0), btLevel: -1, bumped };
+    }
+    if (learned.length === 1) {
+        return { learned: new Int32Array(learned), btLevel: 0, bumped };
+    }
+    // Posicionar el literal de mayor nivel-de-decisión-no-actual en learned[1].
+    // Esa colocación garantiza que tras backtrack(btLevel) ambos watched literals
+    // de la cláusula aprendida quedan bien definidos (learned[0] no asignado,
+    // learned[1] falso al nivel btLevel).
+    let mx = 1;
+    for (let i = 2; i < learned.length; i++) {
+        const li = learned[i];
+        const lmx = learned[mx];
+        if (li === undefined || lmx === undefined)
+            continue;
+        if (varLevel[Math.abs(li)] > varLevel[Math.abs(lmx)]) {
+            mx = i;
+        }
+    }
+    if (mx !== 1) {
+        const tmp = learned[1];
+        const swap = learned[mx];
+        if (tmp !== undefined && swap !== undefined) {
+            learned[1] = swap;
+            learned[mx] = tmp;
+        }
+    }
+    return { learned: new Int32Array(learned), btLevel, bumped };
+}
+//# sourceMappingURL=clause-learning.js.map

package/dist/solver/cdcl-v2/clause-learning.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"clause-learning.js","sourceRoot":"","sources":["../../../src/solver/cdcl-v2/clause-learning.ts"],"names":[],"mappings":";AAAA,wEAAwE;AACxE,wEAAwE;AACxE,sEAAsE;AACtE,sEAAsE;AACtE,4EAA4E;;AAqC5E,kDA0FC;AA7HD,mCAAwC;AAyBxC;;;;;;;;;GASG;AACH,SAAgB,mBAAmB,CAAC,UAAkB,EAAE,GAAoB;IAC1E,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,YAAY,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,GAAG,CAAC;IAChE,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,OAAO,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;IACjE,CAAC;IAED,MAAM,YAAY,GAAG,QAAQ,CAAC,MAAM,CAAC;IACrC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,YAAY,CAAC,CAAC;IAC1C,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,yEAAyE;IACzE,2EAA2E;IAC3E,MAAM,OAAO,GAAG,CAAC,EAAU,EAAE,OAAe,EAAQ,EAAE;QACpD,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACtB,IAAI,CAAC,CAAC;YAAE,OAAO;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACtB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACxB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC;gBAAE,SAAS;YAClD,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACZ,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,GAAG,KAAK,YAAY,EAAE,CAAC;gBACzB,OAAO,EAAE,CAAC;YACZ,CAAC;iBAAM,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;gBACnB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAClB,IAAI,GAAG,GAAG,OAAO;oBAAE,OAAO,GAAG,GAAG,CAAC;YACnC,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IAEvB,IAAI,EAAE,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1B,IAAI,SAAS,GAAG,CAAC,CAAC;IAElB,OAAO,OAAO,GAAG,CAAC,EAAE,CAAC;QACnB,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,EAAE,EAAE,CAAC;QACxD,IAAI,EAAE,GAAG,CAAC;YAAE,MAAM;QAElB,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QACzB,EAAE,EAAE,CAAC;QACL,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACZ,OAAO,EAAE,CAAC;QAEV,IAAI,OAAO,KAAK,CAAC,EAAE,CAAC;YAClB,SAAS,GAAG,CAAC,CAAC,CAAC;QACjB,CAAC;aAAM,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,qBAAa,EAAE,CAAC;YACxC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,SAAS,KAAK,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC7C,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEzC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,EAAE,OAAO,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC;IAC7D,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,EAAE,OAAO,EAAE,IAAI,UAAU,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC;IAClE,CAAC;IAED,4EAA4E;IAC5E,8EAA8E;IAC9E,0EAA0E;IAC1E,sCAAsC;IACtC,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,GAAG,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACxB,IAAI,EAAE,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS;YAAE,SAAS;QACpD,IAAI,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YACrD,EAAE,GAAG,CAAC,CAAC;QACT,CAAC;IACH,CAAC;IACD,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QACb,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACzB,IAAI,GAAG,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YAC5C,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YAClB,OAAO,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,IAAI,UAAU,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;AAC/D,CAAC"}

package/dist/solver/cdcl-v2/index.d.ts

@@ -0,0 +1,9 @@
+export { solveCDCLv2 } from './solver';
+export { NO_ANTECEDENT, NO_CONFLICT, litToIdx, idxToLit } from './state';
+export type { Clause, Literal, SatResult, SolveResult, SolverOptions, SolverStatsV2, UnsatResult, VarValue, } from './state';
+export { VSIDS } from './vsids';
+export { LubyRestartPolicy, luby, lubySequence } from './luby';
+export { PhaseSaver } from './phase-saving';
+export { analyzeConflict1UIP, type AnalysisResult, type ConflictContext } from './clause-learning';
+export { computeLBD, selectClausesToRemove, type LearnedMeta } from './lbd';
+//# sourceMappingURL=index.d.ts.map

package/dist/solver/cdcl-v2/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/solver/cdcl-v2/index.ts"],"names":[],"mappings":"AAgBA,OAAO,EAAE,WAAW,EAAE,MAAM,UAAU,CAAC;AACvC,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACzE,YAAY,EACV,MAAM,EACN,OAAO,EACP,SAAS,EACT,WAAW,EACX,aAAa,EACb,aAAa,EACb,WAAW,EACX,QAAQ,GACT,MAAM,SAAS,CAAC;AACjB,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAChC,OAAO,EAAE,iBAAiB,EAAE,IAAI,EAAE,YAAY,EAAE,MAAM,QAAQ,CAAC;AAC/D,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,EAAE,mBAAmB,EAAE,KAAK,cAAc,EAAE,KAAK,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACnG,OAAO,EAAE,UAAU,EAAE,qBAAqB,EAAE,KAAK,WAAW,EAAE,MAAM,OAAO,CAAC"}

package/dist/solver/cdcl-v2/index.js

@@ -0,0 +1,39 @@
+"use strict";
+// CDCL v2 — Entry point público.
+//
+// API principal:
+//   solveCDCLv2(clauses, numVars, opts?) → SatResult | UnsatResult
+//
+// `clauses` es un arreglo de Int32Array en formato DIMACS (variables 1..numVars,
+// literal positivo = true, negativo = false; cláusula vacía ⇒ UNSAT).
+//
+// El solver implementa el pipeline state-of-the-art clásico:
+//   - 2-watched literals para BCP O(amortizado).
+//   - VSIDS con EVSIDS rescaling para heurística de decisión.
+//   - 1UIP conflict analysis con minimización implícita por bumped tracking.
+//   - Luby restarts (1, 1, 2, 1, 1, 2, 4, ...).
+//   - Phase saving (Pipatsrisawat & Darwiche 2007).
+//   - LBD scoring + reducción periódica de la learnt clause database.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.selectClausesToRemove = exports.computeLBD = exports.analyzeConflict1UIP = exports.PhaseSaver = exports.lubySequence = exports.luby = exports.LubyRestartPolicy = exports.VSIDS = exports.idxToLit = exports.litToIdx = exports.NO_CONFLICT = exports.NO_ANTECEDENT = exports.solveCDCLv2 = void 0;
+var solver_1 = require("./solver");
+Object.defineProperty(exports, "solveCDCLv2", { enumerable: true, get: function () { return solver_1.solveCDCLv2; } });
+var state_1 = require("./state");
+Object.defineProperty(exports, "NO_ANTECEDENT", { enumerable: true, get: function () { return state_1.NO_ANTECEDENT; } });
+Object.defineProperty(exports, "NO_CONFLICT", { enumerable: true, get: function () { return state_1.NO_CONFLICT; } });
+Object.defineProperty(exports, "litToIdx", { enumerable: true, get: function () { return state_1.litToIdx; } });
+Object.defineProperty(exports, "idxToLit", { enumerable: true, get: function () { return state_1.idxToLit; } });
+var vsids_1 = require("./vsids");
+Object.defineProperty(exports, "VSIDS", { enumerable: true, get: function () { return vsids_1.VSIDS; } });
+var luby_1 = require("./luby");
+Object.defineProperty(exports, "LubyRestartPolicy", { enumerable: true, get: function () { return luby_1.LubyRestartPolicy; } });
+Object.defineProperty(exports, "luby", { enumerable: true, get: function () { return luby_1.luby; } });
+Object.defineProperty(exports, "lubySequence", { enumerable: true, get: function () { return luby_1.lubySequence; } });
+var phase_saving_1 = require("./phase-saving");
+Object.defineProperty(exports, "PhaseSaver", { enumerable: true, get: function () { return phase_saving_1.PhaseSaver; } });
+var clause_learning_1 = require("./clause-learning");
+Object.defineProperty(exports, "analyzeConflict1UIP", { enumerable: true, get: function () { return clause_learning_1.analyzeConflict1UIP; } });
+var lbd_1 = require("./lbd");
+Object.defineProperty(exports, "computeLBD", { enumerable: true, get: function () { return lbd_1.computeLBD; } });
+Object.defineProperty(exports, "selectClausesToRemove", { enumerable: true, get: function () { return lbd_1.selectClausesToRemove; } });
+//# sourceMappingURL=index.js.map

package/dist/solver/cdcl-v2/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/solver/cdcl-v2/index.ts"],"names":[],"mappings":";AAAA,iCAAiC;AACjC,EAAE;AACF,iBAAiB;AACjB,mEAAmE;AACnE,EAAE;AACF,iFAAiF;AACjF,sEAAsE;AACtE,EAAE;AACF,6DAA6D;AAC7D,iDAAiD;AACjD,8DAA8D;AAC9D,6EAA6E;AAC7E,gDAAgD;AAChD,oDAAoD;AACpD,sEAAsE;;;AAEtE,mCAAuC;AAA9B,qGAAA,WAAW,OAAA;AACpB,iCAAyE;AAAhE,sGAAA,aAAa,OAAA;AAAE,oGAAA,WAAW,OAAA;AAAE,iGAAA,QAAQ,OAAA;AAAE,iGAAA,QAAQ,OAAA;AAWvD,iCAAgC;AAAvB,8FAAA,KAAK,OAAA;AACd,+BAA+D;AAAtD,yGAAA,iBAAiB,OAAA;AAAE,4FAAA,IAAI,OAAA;AAAE,oGAAA,YAAY,OAAA;AAC9C,+CAA4C;AAAnC,0GAAA,UAAU,OAAA;AACnB,qDAAmG;AAA1F,sHAAA,mBAAmB,OAAA;AAC5B,6BAA4E;AAAnE,iGAAA,UAAU,OAAA;AAAE,4GAAA,qBAAqB,OAAA"}

package/dist/solver/cdcl-v2/lbd.d.ts

@@ -0,0 +1,34 @@
+/**
+ * Calcula el LBD de una cláusula dado el nivel de decisión actual de cada
+ * variable. Usa un buffer compartido `seenLevels` (reseteado internamente
+ * cada llamada) para evitar allocaciones repetidas.
+ *
+ * Si una variable no está asignada (level = -1), no se cuenta.
+ */
+export declare function computeLBD(clause: Int32Array, varLevel: Int32Array, seenBuffer: Uint8Array): number;
+/**
+ * Metadatos de una cláusula aprendida usados para decidir si conservarla.
+ */
+export interface LearnedMeta {
+    /** Índice en el array de cláusulas. */
+    index: number;
+    /** LBD calculado al momento del aprendizaje (y opcionalmente actualizado). */
+    lbd: number;
+    /** Activity de la cláusula (analogía VSIDS para cláusulas). */
+    activity: number;
+    /** True si actualmente "bloquea" la asignación de alguna variable (no descartable). */
+    locked: boolean;
+    /** Longitud de la cláusula (útil como tiebreaker). */
+    length: number;
+}
+/**
+ * Selecciona cláusulas a eliminar de un conjunto de aprendidas.
+ *
+ * Política: preservar siempre las "glue clauses" (LBD <= 2). Del resto,
+ * ordenar por (lbd desc, activity asc, length desc) y eliminar la mitad
+ * con menor utilidad. Cláusulas locked nunca se eliminan.
+ *
+ * Retorna los `index` (relativos a `metas`) a eliminar.
+ */
+export declare function selectClausesToRemove(metas: ReadonlyArray<LearnedMeta>, lbdProtectThreshold?: number): number[];
+//# sourceMappingURL=lbd.d.ts.map

package/dist/solver/cdcl-v2/lbd.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lbd.d.ts","sourceRoot":"","sources":["../../../src/solver/cdcl-v2/lbd.ts"],"names":[],"mappings":"AAMA;;;;;;GAMG;AACH,wBAAgB,UAAU,CACxB,MAAM,EAAE,UAAU,EAClB,QAAQ,EAAE,UAAU,EACpB,UAAU,EAAE,UAAU,GACrB,MAAM,CAmBR;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,uCAAuC;IACvC,KAAK,EAAE,MAAM,CAAC;IACd,8EAA8E;IAC9E,GAAG,EAAE,MAAM,CAAC;IACZ,+DAA+D;IAC/D,QAAQ,EAAE,MAAM,CAAC;IACjB,uFAAuF;IACvF,MAAM,EAAE,OAAO,CAAC;IAChB,sDAAsD;IACtD,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;;;;;;;GAQG;AACH,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,aAAa,CAAC,WAAW,CAAC,EACjC,mBAAmB,GAAE,MAAU,GAC9B,MAAM,EAAE,CAgBV"}

package/dist/solver/cdcl-v2/lbd.js

@@ -0,0 +1,72 @@
+"use strict";
+// LBD (Literal Block Distance) — Audemard & Simon (2009) "Predicting Learnt
+// Clauses Quality in Modern SAT Solvers" (Glucose). El LBD de una cláusula
+// es la cantidad de niveles de decisión distintos representados por sus
+// literales. Cláusulas con LBD bajo (especialmente LBD <= 2, "glue clauses")
+// son los aprendizajes más útiles y nunca se descartan.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.computeLBD = computeLBD;
+exports.selectClausesToRemove = selectClausesToRemove;
+/**
+ * Calcula el LBD de una cláusula dado el nivel de decisión actual de cada
+ * variable. Usa un buffer compartido `seenLevels` (reseteado internamente
+ * cada llamada) para evitar allocaciones repetidas.
+ *
+ * Si una variable no está asignada (level = -1), no se cuenta.
+ */
+function computeLBD(clause, varLevel, seenBuffer) {
+    // Buffer indexed by level + 1 (para tolerar -1).
+    // El caller garantiza seenBuffer.length >= max nivel + 2.
+    // Reseteamos sólo las posiciones que tocamos para mantener O(|clause|).
+    const touched = [];
+    let lbd = 0;
+    for (let i = 0; i < clause.length; i++) {
+        const v = Math.abs(clause[i] ?? 0);
+        if (v === 0)
+            continue;
+        const lvl = varLevel[v];
+        if (lvl < 0)
+            continue;
+        if (!seenBuffer[lvl]) {
+            seenBuffer[lvl] = 1;
+            touched.push(lvl);
+            lbd++;
+        }
+    }
+    for (const lvl of touched)
+        seenBuffer[lvl] = 0;
+    return lbd;
+}
+/**
+ * Selecciona cláusulas a eliminar de un conjunto de aprendidas.
+ *
+ * Política: preservar siempre las "glue clauses" (LBD <= 2). Del resto,
+ * ordenar por (lbd desc, activity asc, length desc) y eliminar la mitad
+ * con menor utilidad. Cláusulas locked nunca se eliminan.
+ *
+ * Retorna los `index` (relativos a `metas`) a eliminar.
+ */
+function selectClausesToRemove(metas, lbdProtectThreshold = 2) {
+    const candidates = [];
+    for (const m of metas) {
+        if (m.locked)
+            continue;
+        if (m.lbd <= lbdProtectThreshold)
+            continue;
+        if (m.length <= 2)
+            continue;
+        candidates.push(m);
+    }
+    if (candidates.length === 0)
+        return [];
+    candidates.sort((a, b) => {
+        if (a.lbd !== b.lbd)
+            return b.lbd - a.lbd;
+        if (a.activity !== b.activity)
+            return a.activity - b.activity;
+        return b.length - a.length;
+    });
+    const half = Math.floor(candidates.length / 2);
+    return candidates.slice(0, half).map((m) => m.index);
+}
+//# sourceMappingURL=lbd.js.map

package/dist/solver/cdcl-v2/lbd.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lbd.js","sourceRoot":"","sources":["../../../src/solver/cdcl-v2/lbd.ts"],"names":[],"mappings":";AAAA,4EAA4E;AAC5E,2EAA2E;AAC3E,wEAAwE;AACxE,6EAA6E;AAC7E,wDAAwD;;AASxD,gCAuBC;AA2BD,sDAmBC;AA5ED;;;;;;GAMG;AACH,SAAgB,UAAU,CACxB,MAAkB,EAClB,QAAoB,EACpB,UAAsB;IAEtB,iDAAiD;IACjD,0DAA0D;IAC1D,wEAAwE;IACxE,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACnC,IAAI,CAAC,KAAK,CAAC;YAAE,SAAS;QACtB,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,GAAG,GAAG,CAAC;YAAE,SAAS;QACtB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YACrB,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACpB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClB,GAAG,EAAE,CAAC;QACR,CAAC;IACH,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,OAAO;QAAE,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC/C,OAAO,GAAG,CAAC;AACb,CAAC;AAkBD;;;;;;;;GAQG;AACH,SAAgB,qBAAqB,CACnC,KAAiC,EACjC,sBAA8B,CAAC;IAE/B,MAAM,UAAU,GAAkB,EAAE,CAAC;IACrC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,MAAM;YAAE,SAAS;QACvB,IAAI,CAAC,CAAC,GAAG,IAAI,mBAAmB;YAAE,SAAS;QAC3C,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC;YAAE,SAAS;QAC5B,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IACD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACvC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACvB,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG;YAAE,OAAO,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC;QAC1C,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ;YAAE,OAAO,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;QAC9D,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;IAC7B,CAAC,CAAC,CAAC;IACH,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC/C,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AACvD,CAAC"}

package/dist/solver/cdcl-v2/luby.d.ts

@@ -0,0 +1,28 @@
+/**
+ * Calcula el i-ésimo término (1-indexado) de la secuencia de Luby.
+ * Para mantener la indexación pública 0-indexada, internamente trabajamos
+ * con t = i + 1, aplicando la recurrencia clásica de Knuth (1991):
+ *   luby(t) = 2^(k-1)             si t = 2^k - 1
+ *   luby(t) = luby(t - 2^(k-1) + 1) si 2^(k-1) ≤ t < 2^k - 1
+ */
+export declare function luby(i: number): number;
+/**
+ * Genera los primeros `n` términos de la secuencia de Luby.
+ * Útil para tests y previsualización.
+ */
+export declare function lubySequence(n: number): number[];
+/**
+ * Política de restart Luby con multiplicador `base`.
+ * Cada paso devuelve cuántos conflictos esperar antes del próximo restart.
+ */
+export declare class LubyRestartPolicy {
+    private readonly base;
+    private idx;
+    constructor(base?: number);
+    /** Conflictos hasta el próximo restart (avanza el contador interno). */
+    next(): number;
+    /** Estado actual (para inspección/tests). */
+    get index(): number;
+    reset(): void;
+}
+//# sourceMappingURL=luby.d.ts.map

package/dist/solver/cdcl-v2/luby.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"luby.d.ts","sourceRoot":"","sources":["../../../src/solver/cdcl-v2/luby.ts"],"names":[],"mappings":"AAIA;;;;;;GAMG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CActC;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAIhD;AAED;;;GAGG;AACH,qBAAa,iBAAiB;IAEhB,OAAO,CAAC,QAAQ,CAAC,IAAI;IADjC,OAAO,CAAC,GAAG,CAAK;gBACa,IAAI,GAAE,MAAY;IAM/C,wEAAwE;IACxE,IAAI,IAAI,MAAM;IAMd,6CAA6C;IAC7C,IAAI,KAAK,IAAI,MAAM,CAElB;IAED,KAAK,IAAI,IAAI;CAGd"}

package/dist/solver/cdcl-v2/luby.js

@@ -0,0 +1,70 @@
+"use strict";
+// Luby sequence — Knuth (1991) / Luby et al. (1993)
+// Secuencia: 1, 1, 2, 1, 1, 2, 4, 1, 1, 2, 1, 1, 2, 4, 8, ...
+// Usada como cadencia de restart en CDCL (Huang 2007).
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LubyRestartPolicy = void 0;
+exports.luby = luby;
+exports.lubySequence = lubySequence;
+/**
+ * Calcula el i-ésimo término (1-indexado) de la secuencia de Luby.
+ * Para mantener la indexación pública 0-indexada, internamente trabajamos
+ * con t = i + 1, aplicando la recurrencia clásica de Knuth (1991):
+ *   luby(t) = 2^(k-1)             si t = 2^k - 1
+ *   luby(t) = luby(t - 2^(k-1) + 1) si 2^(k-1) ≤ t < 2^k - 1
+ */
+function luby(i) {
+    if (i < 0 || !Number.isFinite(i)) {
+        throw new RangeError(`luby: index debe ser entero >= 0, recibido ${String(i)}`);
+    }
+    let t = i + 1;
+    while (true) {
+        // Encontrar la menor potencia tal que 2^k - 1 >= t.
+        let pow = 2;
+        while (pow - 1 < t) {
+            pow *= 2;
+        }
+        if (pow - 1 === t)
+            return pow >>> 1; // t = 2^k - 1 ⇒ luby = 2^(k-1)
+        t = t - (pow >>> 1) + 1;
+    }
+}
+/**
+ * Genera los primeros `n` términos de la secuencia de Luby.
+ * Útil para tests y previsualización.
+ */
+function lubySequence(n) {
+    const out = new Array(n);
+    for (let i = 0; i < n; i++)
+        out[i] = luby(i);
+    return out;
+}
+/**
+ * Política de restart Luby con multiplicador `base`.
+ * Cada paso devuelve cuántos conflictos esperar antes del próximo restart.
+ */
+class LubyRestartPolicy {
+    base;
+    idx = 0;
+    constructor(base = 100) {
+        this.base = base;
+        if (!(base > 0)) {
+            throw new RangeError(`LubyRestartPolicy: base debe ser > 0, recibido ${base}`);
+        }
+    }
+    /** Conflictos hasta el próximo restart (avanza el contador interno). */
+    next() {
+        const n = this.base * luby(this.idx);
+        this.idx++;
+        return n;
+    }
+    /** Estado actual (para inspección/tests). */
+    get index() {
+        return this.idx;
+    }
+    reset() {
+        this.idx = 0;
+    }
+}
+exports.LubyRestartPolicy = LubyRestartPolicy;
+//# sourceMappingURL=luby.js.map

package/dist/solver/cdcl-v2/luby.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"luby.js","sourceRoot":"","sources":["../../../src/solver/cdcl-v2/luby.ts"],"names":[],"mappings":";AAAA,oDAAoD;AACpD,8DAA8D;AAC9D,uDAAuD;;;AASvD,oBAcC;AAMD,oCAIC;AA/BD;;;;;;GAMG;AACH,SAAgB,IAAI,CAAC,CAAS;IAC5B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;QACjC,MAAM,IAAI,UAAU,CAAC,8CAA8C,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAClF,CAAC;IACD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACd,OAAO,IAAI,EAAE,CAAC;QACZ,oDAAoD;QACpD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACnB,GAAG,IAAI,CAAC,CAAC;QACX,CAAC;QACD,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC;YAAE,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,+BAA+B;QACpE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAgB,YAAY,CAAC,CAAS;IACpC,MAAM,GAAG,GAAa,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,MAAa,iBAAiB;IAEC;IADrB,GAAG,GAAG,CAAC,CAAC;IAChB,YAA6B,OAAe,GAAG;QAAlB,SAAI,GAAJ,IAAI,CAAc;QAC7C,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC;YAChB,MAAM,IAAI,UAAU,CAAC,kDAAkD,IAAI,EAAE,CAAC,CAAC;QACjF,CAAC;IACH,CAAC;IAED,wEAAwE;IACxE,IAAI;QACF,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,OAAO,CAAC,CAAC;IACX,CAAC;IAED,6CAA6C;IAC7C,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,GAAG,CAAC;IAClB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC;IACf,CAAC;CACF;AAvBD,8CAuBC"}

package/dist/solver/cdcl-v2/phase-saving.d.ts

@@ -0,0 +1,14 @@
+export declare class PhaseSaver {
+    /** 1 = positivo, 0 = negativo. -1 codificado como 0 en la práctica. */
+    private readonly phase;
+    readonly numVars: number;
+    private readonly initialPhase;
+    constructor(numVars: number, initialPhase?: 0 | 1);
+    /** Guarda la polaridad efectivamente asignada al literal `lit`. */
+    save(lit: number): void;
+    /** Polaridad guardada (0 o 1) para la variable. */
+    getPhase(v: number): 0 | 1;
+    /** Literal a probar en branching: var positiva si phase=1, negativa si phase=0. */
+    pickLit(v: number): number;
+}
+//# sourceMappingURL=phase-saving.d.ts.map

package/dist/solver/cdcl-v2/phase-saving.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"phase-saving.d.ts","sourceRoot":"","sources":["../../../src/solver/cdcl-v2/phase-saving.ts"],"names":[],"mappings":"AAKA,qBAAa,UAAU;IACrB,uEAAuE;IACvE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAY;IAClC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAQ;gBAEzB,OAAO,EAAE,MAAM,EAAE,YAAY,GAAE,CAAC,GAAG,CAAK;IAYpD,mEAAmE;IACnE,IAAI,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAMvB,mDAAmD;IACnD,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,GAAG,CAAC;IAK1B,mFAAmF;IACnF,OAAO,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;CAG3B"}

package/dist/solver/cdcl-v2/phase-saving.js

@@ -0,0 +1,44 @@
+"use strict";
+// Phase saving — Pipatsrisawat & Darwiche (2007).
+// Guarda la última polaridad asignada a cada variable. Al decidir, el solver
+// la reutiliza, lo que explota localidad: el espacio "cerca" de soluciones
+// parciales válidas suele tener phases similares.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PhaseSaver = void 0;
+class PhaseSaver {
+    /** 1 = positivo, 0 = negativo. -1 codificado como 0 en la práctica. */
+    phase;
+    numVars;
+    initialPhase;
+    constructor(numVars, initialPhase = 0) {
+        if (numVars < 0 || !Number.isInteger(numVars)) {
+            throw new RangeError(`PhaseSaver: numVars inválido ${numVars}`);
+        }
+        this.numVars = numVars;
+        this.initialPhase = initialPhase;
+        this.phase = new Int8Array(numVars + 1);
+        if (initialPhase === 1) {
+            for (let i = 1; i <= numVars; i++)
+                this.phase[i] = 1;
+        }
+    }
+    /** Guarda la polaridad efectivamente asignada al literal `lit`. */
+    save(lit) {
+        const v = Math.abs(lit);
+        if (v <= 0 || v > this.numVars)
+            return;
+        this.phase[v] = lit > 0 ? 1 : 0;
+    }
+    /** Polaridad guardada (0 o 1) para la variable. */
+    getPhase(v) {
+        if (v <= 0 || v > this.numVars)
+            return this.initialPhase;
+        return this.phase[v] === 1 ? 1 : 0;
+    }
+    /** Literal a probar en branching: var positiva si phase=1, negativa si phase=0. */
+    pickLit(v) {
+        return this.getPhase(v) === 1 ? v : -v;
+    }
+}
+exports.PhaseSaver = PhaseSaver;
+//# sourceMappingURL=phase-saving.js.map

package/dist/solver/cdcl-v2/phase-saving.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"phase-saving.js","sourceRoot":"","sources":["../../../src/solver/cdcl-v2/phase-saving.ts"],"names":[],"mappings":";AAAA,kDAAkD;AAClD,6EAA6E;AAC7E,2EAA2E;AAC3E,kDAAkD;;;AAElD,MAAa,UAAU;IACrB,uEAAuE;IACtD,KAAK,CAAY;IACzB,OAAO,CAAS;IACR,YAAY,CAAQ;IAErC,YAAY,OAAe,EAAE,eAAsB,CAAC;QAClD,IAAI,OAAO,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;YAC9C,MAAM,IAAI,UAAU,CAAC,gCAAgC,OAAO,EAAE,CAAC,CAAC;QAClE,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,KAAK,GAAG,IAAI,SAAS,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;QACxC,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;YACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE;gBAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACvD,CAAC;IACH,CAAC;IAED,mEAAmE;IACnE,IAAI,CAAC,GAAW;QACd,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO;YAAE,OAAO;QACvC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;IAED,mDAAmD;IACnD,QAAQ,CAAC,CAAS;QAChB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO;YAAE,OAAO,IAAI,CAAC,YAAY,CAAC;QACzD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC;IAED,mFAAmF;IACnF,OAAO,CAAC,CAAS;QACf,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC;CACF;AAnCD,gCAmCC"}

package/dist/solver/cdcl-v2/solver.d.ts

@@ -0,0 +1,10 @@
+import { type SolverOptions, type SolveResult } from './state';
+/**
+ * Resuelve un conjunto de cláusulas CNF y retorna SAT (con modelo) o UNSAT
+ * (con core de variables involucradas en cláusulas vacías derivadas).
+ *
+ * Convención DIMACS: variables 1..numVars, literal positivo = variable
+ * asignada a true, negativo = false. Cláusula vacía ⇒ UNSAT inmediato.
+ */
+export declare function solveCDCLv2(inputClauses: ReadonlyArray<Int32Array>, numVars: number, opts?: SolverOptions): SolveResult;
+//# sourceMappingURL=solver.d.ts.map

package/dist/solver/cdcl-v2/solver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"solver.d.ts","sourceRoot":"","sources":["../../../src/solver/cdcl-v2/solver.ts"],"names":[],"mappings":"AAQA,OAAO,EAML,KAAK,aAAa,EAElB,KAAK,WAAW,EAEjB,MAAM,SAAS,CAAC;AAmEjB;;;;;;GAMG;AACH,wBAAgB,WAAW,CACzB,YAAY,EAAE,aAAa,CAAC,UAAU,CAAC,EACvC,OAAO,EAAE,MAAM,EACf,IAAI,CAAC,EAAE,aAAa,GACnB,WAAW,CAqYb"}