@stevenvo780/st-lang 2.7.1 → 3.0.0

package/dist/profiles/classical/parallel-sat.js

@@ -0,0 +1,630 @@
+"use strict";
+// ============================================================
+// Parallel SAT Solver — Portfolio Racing con Workers
+// Compatible con Node.js (worker_threads) y Browser (Web Workers)
+// ============================================================
+//
+// Estrategia: lanza N workers con el mismo problema pero diferentes
+// heurísticas (semillas VSIDS, políticas de restart, etc).
+// El primero que resuelva gana; los demás se terminan.
+//
+// Fallback: si workers no están disponibles, ejecuta secuencialmente.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MAX_WORKERS = exports.PARALLEL_THRESHOLD = void 0;
+exports.packClauses = packClauses;
+exports.unpackClauses = unpackClauses;
+exports.workersAvailable = workersAvailable;
+exports.parallelSolve = parallelSolve;
+exports.tryParallelSolve = tryParallelSolve;
+// ── Serialización de cláusulas ──────────────────────────────
+/**
+ * Empaqueta un array de Int32Array clauses en un solo buffer plano.
+ * Formato: [clauseLen, lit1, lit2, ..., clauseLen, lit1, ...]
+ * Esto permite pasar por SharedArrayBuffer o structured clone sin overhead.
+ */
+function packClauses(clauses) {
+    let totalLen = 0;
+    for (const c of clauses)
+        totalLen += 1 + c.length;
+    const packed = new Int32Array(totalLen);
+    let offset = 0;
+    for (const c of clauses) {
+        packed[offset++] = c.length;
+        for (let i = 0; i < c.length; i++)
+            packed[offset++] = c[i];
+    }
+    return packed;
+}
+/**
+ * Desempaqueta un buffer plano de vuelta a Int32Array[].
+ */
+function unpackClauses(packed) {
+    const clauses = [];
+    let offset = 0;
+    while (offset < packed.length) {
+        const len = packed[offset++];
+        clauses.push(packed.slice(offset, offset + len));
+        offset += len;
+    }
+    return clauses;
+}
+let _workersAvailable = null;
+/**
+ * Comprueba si el entorno soporta workers.
+ */
+function workersAvailable() {
+    if (_workersAvailable !== null)
+        return _workersAvailable;
+    try {
+        // Node.js — verificar worker_threads sin require()
+        if (typeof process !== 'undefined' && process.versions?.node) {
+            // eslint-disable-next-line @typescript-eslint/no-require-imports
+            require('worker_threads');
+            _workersAvailable = true;
+            return true;
+        }
+        // Browser
+        if (typeof globalThis !== 'undefined' && 'Worker' in globalThis) {
+            _workersAvailable = true;
+            return true;
+        }
+    }
+    catch {
+        // worker_threads no disponible (browser bundle sin polyfill, etc.)
+    }
+    _workersAvailable = false;
+    return false;
+}
+// ── Código inline del Worker ────────────────────────────────
+// Este string contiene el solver completo self-contained.
+// Se evalúa dentro del worker sin necesidad de importar módulos.
+// ─────────────────────────────────────────────────────────────
+function getWorkerCode() {
+    return `
+'use strict';
+
+// ── Worker SAT Solver (self-contained) ──
+
+function litToIdx(lit, nv) {
+  return lit > 0 ? lit - 1 : nv + (-lit) - 1;
+}
+
+function luby(i) {
+  let size = 1, seq = 0;
+  while (size < i + 1) size = 2 * size + 1;
+  while (size - 1 !== i) { size = (size - 1) >> 1; seq++; if (i >= size) i -= size; }
+  return 1 << seq;
+}
+
+function unpackClauses(packed) {
+  const clauses = [];
+  let offset = 0;
+  while (offset < packed.length) {
+    const len = packed[offset++];
+    clauses.push(packed.slice(offset, offset + len));
+    offset += len;
+  }
+  return clauses;
+}
+
+function workerSolve(task) {
+  const { clauseData, numVars, atomNames, timeoutMs, heuristicSeed, restartPolicy } = task;
+  const startTime = Date.now();
+
+  const allClauses = unpackClauses(new Int32Array(clauseData));
+  const originalCount = allClauses.length;
+
+  const stats = {
+    decisions: 0, propagations: 0, conflicts: 0,
+    learnedClauses: 0, restarts: 0, preprocessEliminated: 0, solveTimeMs: 0,
+  };
+
+  if (allClauses.length === 0) {
+    const model = {};
+    for (let i = 0; i < atomNames.length && i < numVars; i++) model[atomNames[i]] = true;
+    stats.solveTimeMs = Date.now() - startTime;
+    return { satisfiable: true, model, stats };
+  }
+
+  // Detect empty clause
+  for (const c of allClauses) {
+    if (c.length === 0) {
+      stats.solveTimeMs = Date.now() - startTime;
+      return { satisfiable: false, stats };
+    }
+  }
+
+  const varVal = new Int8Array(numVars + 1);
+  const varLevel = new Int32Array(numVars + 1).fill(-1);
+  const varAnte = new Int32Array(numVars + 1).fill(-1);
+  const trail = [];
+  const trailLim = [];
+  let qHead = 0;
+  const phase = new Int8Array(numVars + 1);
+
+  // Watched literals
+  const watchSize = 2 * numVars;
+  const watches = new Array(watchSize);
+
+  function rebuildWatches() {
+    for (let i = 0; i < watchSize; i++) watches[i] = [];
+    for (let ci = 0; ci < allClauses.length; ci++) {
+      const c = allClauses[ci];
+      if (c.length >= 2) {
+        watches[litToIdx(c[0], numVars)].push(ci);
+        watches[litToIdx(c[1], numVars)].push(ci);
+      }
+    }
+  }
+  rebuildWatches();
+
+  // VSIDS with seeded initial activity
+  const activity = new Float64Array(numVars + 1);
+  let varInc = 1.0;
+  const VAR_DECAY = 0.95;
+
+  for (const c of allClauses) {
+    for (let i = 0; i < c.length; i++) activity[Math.abs(c[i])] += 1.0;
+  }
+  // Apply heuristic seed: perturb activities slightly
+  if (heuristicSeed > 0) {
+    let s = heuristicSeed;
+    for (let v = 1; v <= numVars; v++) {
+      s = (s * 1103515245 + 12345) & 0x7fffffff;
+      activity[v] += (s % 1000) / 10000.0;
+    }
+  }
+
+  function bumpVar(v) { activity[v] += varInc; if (activity[v] > 1e100) { for (let i = 1; i <= numVars; i++) activity[i] *= 1e-100; varInc *= 1e-100; } }
+  function decayAct() { varInc /= VAR_DECAY; }
+  function currentDL() { return trailLim.length; }
+  function litIsTrue(lit) { return lit > 0 ? varVal[lit] === 1 : varVal[-lit] === -1; }
+  function litIsFalse(lit) { return lit > 0 ? varVal[lit] === -1 : varVal[-lit] === 1; }
+
+  function enqueue(lit, lev, reason) {
+    const v = Math.abs(lit);
+    if (varVal[v] !== 0) return litIsTrue(lit);
+    varVal[v] = lit > 0 ? 1 : -1;
+    varLevel[v] = lev;
+    varAnte[v] = reason;
+    trail.push(lit);
+    phase[v] = lit > 0 ? 1 : 0;
+    stats.propagations++;
+    return true;
+  }
+
+  function propagate() {
+    while (qHead < trail.length) {
+      const p = trail[qHead++];
+      const falseLit = -p;
+      const wIdx = litToIdx(falseLit, numVars);
+      const wl = watches[wIdx];
+      let j = 0;
+      for (let i = 0; i < wl.length; i++) {
+        const ci = wl[i];
+        const c = allClauses[ci];
+        if (!c || c.length < 2) { wl[j++] = ci; continue; }
+        if (c[0] === falseLit) { c[0] = c[1]; c[1] = falseLit; }
+        if (litIsTrue(c[0])) { wl[j++] = ci; continue; }
+        let found = false;
+        for (let k = 2; k < c.length; k++) {
+          if (!litIsFalse(c[k])) {
+            c[1] = c[k]; c[k] = falseLit;
+            watches[litToIdx(c[1], numVars)].push(ci);
+            found = true; break;
+          }
+        }
+        if (found) continue;
+        wl[j++] = ci;
+        if (litIsFalse(c[0])) {
+          for (let r = i + 1; r < wl.length; r++) wl[j++] = wl[r];
+          wl.length = j; qHead = trail.length; return ci;
+        }
+        if (!enqueue(c[0], currentDL(), ci)) {
+          for (let r = i + 1; r < wl.length; r++) wl[j++] = wl[r];
+          wl.length = j; qHead = trail.length; return ci;
+        }
+      }
+      wl.length = j;
+    }
+    return -1;
+  }
+
+  function analyzeConflict(conflictCi) {
+    const dl = currentDL();
+    const seen = new Uint8Array(numVars + 1);
+    const outLits = [];
+    let counter = 0, btLevel = 0;
+    function addLits(ci, skipVar) {
+      const c = allClauses[ci];
+      for (let i = 0; i < c.length; i++) {
+        const v = Math.abs(c[i]);
+        if (v === skipVar || seen[v]) continue;
+        seen[v] = 1; bumpVar(v);
+        if (varLevel[v] === dl) counter++;
+        else if (varLevel[v] > 0) { outLits.push(c[i]); if (varLevel[v] > btLevel) btLevel = varLevel[v]; }
+      }
+    }
+    addLits(conflictCi, 0);
+    let ti = trail.length - 1, assertLit = 0;
+    while (counter > 0) {
+      while (ti >= 0 && !seen[Math.abs(trail[ti])]) ti--;
+      if (ti < 0) break;
+      const p = trail[ti--], v = Math.abs(p);
+      seen[v] = 0; counter--;
+      if (counter === 0) assertLit = -p;
+      else if (varAnte[v] >= 0) addLits(varAnte[v], v);
+    }
+    const learned = [];
+    if (assertLit !== 0) learned.push(assertLit);
+    learned.push(...outLits);
+    if (learned.length === 0) return { learned: new Int32Array(0), btLevel: -1 };
+    if (learned.length <= 1) btLevel = 0;
+    if (learned.length >= 3) {
+      let mx = 1;
+      for (let i = 2; i < learned.length; i++) if (varLevel[Math.abs(learned[i])] > varLevel[Math.abs(learned[mx])]) mx = i;
+      if (mx !== 1) { const tmp = learned[1]; learned[1] = learned[mx]; learned[mx] = tmp; }
+    }
+    decayAct();
+    return { learned: new Int32Array(learned), btLevel };
+  }
+
+  function backtrack(target) {
+    if (currentDL() <= target) return;
+    const btPoint = target < trailLim.length ? trailLim[target] : trail.length;
+    for (let i = trail.length - 1; i >= btPoint; i--) {
+      const v = Math.abs(trail[i]);
+      varVal[v] = 0; varLevel[v] = -1; varAnte[v] = -1;
+    }
+    trail.length = btPoint; trailLim.length = target; qHead = btPoint;
+  }
+
+  function pickBranch() {
+    let best = 0, bestAct = -1;
+    for (let v = 1; v <= numVars; v++) {
+      if (varVal[v] === 0 && activity[v] > bestAct) { bestAct = activity[v]; best = v; }
+    }
+    return best;
+  }
+
+  function addLearned(learned) {
+    const ci = allClauses.length;
+    allClauses.push(learned);
+    stats.learnedClauses++;
+    if (learned.length >= 2) {
+      watches[litToIdx(learned[0], numVars)].push(ci);
+      watches[litToIdx(learned[1], numVars)].push(ci);
+    }
+    return ci;
+  }
+
+  function reduceDB() {
+    const learnedCount = allClauses.length - originalCount;
+    if (learnedCount < 100) return;
+    const locked = new Uint8Array(allClauses.length);
+    for (let v = 1; v <= numVars; v++) {
+      if (varVal[v] !== 0 && varAnte[v] >= originalCount) locked[varAnte[v]] = 1;
+    }
+    const removable = [];
+    for (let ci = originalCount; ci < allClauses.length; ci++) {
+      if (!locked[ci] && allClauses[ci].length > 2) removable.push(ci);
+    }
+    if (removable.length < 50) return;
+    removable.sort((a, b) => allClauses[b].length - allClauses[a].length);
+    const toRemove = new Set(removable.slice(0, Math.floor(removable.length / 2)));
+    const oldToNew = new Map();
+    const newClauses = [];
+    for (let ci = 0; ci < allClauses.length; ci++) {
+      if (!toRemove.has(ci)) { oldToNew.set(ci, newClauses.length); newClauses.push(allClauses[ci]); }
+    }
+    for (let v = 1; v <= numVars; v++) {
+      if (varAnte[v] >= 0) { const m = oldToNew.get(varAnte[v]); varAnte[v] = m !== undefined ? m : -1; }
+    }
+    allClauses.length = 0; allClauses.push(...newClauses);
+    rebuildWatches();
+  }
+
+  // Process initial unit clauses
+  for (let ci = 0; ci < allClauses.length; ci++) {
+    if (allClauses[ci].length === 1) {
+      if (!enqueue(allClauses[ci][0], 0, ci)) {
+        stats.solveTimeMs = Date.now() - startTime;
+        return { satisfiable: false, stats };
+      }
+    }
+  }
+
+  let conflict = propagate();
+  if (conflict !== -1) {
+    stats.solveTimeMs = Date.now() - startTime;
+    return { satisfiable: false, stats };
+  }
+
+  // Main CDCL loop with configurable restart policy
+  let lubyIdx = 0;
+  const RESTART_BASE = restartPolicy === 2 ? 200 : 100;
+  let conflictsUntilRestart = restartPolicy === 1
+    ? RESTART_BASE
+    : RESTART_BASE * luby(lubyIdx);
+  let conflictsSinceRestart = 0;
+  let nextReduceDB = originalCount * 3;
+  const GEOMETRIC_FACTOR = 1.5;
+
+  while (true) {
+    if (Date.now() - startTime > timeoutMs) {
+      stats.solveTimeMs = Date.now() - startTime;
+      return { satisfiable: false, stats };
+    }
+
+    const v = pickBranch();
+    if (v === 0) break;
+
+    stats.decisions++;
+    trailLim.push(trail.length);
+    // Diversify: use seed to sometimes flip polarity
+    let lit;
+    if (heuristicSeed > 0 && stats.decisions % (3 + heuristicSeed % 5) === 0) {
+      lit = phase[v] === 1 ? -v : v; // flip
+    } else {
+      lit = phase[v] === 1 ? v : -v;
+    }
+    enqueue(lit, currentDL(), -1);
+    conflict = propagate();
+
+    while (conflict !== -1) {
+      stats.conflicts++;
+      conflictsSinceRestart++;
+      if (currentDL() === 0) {
+        stats.solveTimeMs = Date.now() - startTime;
+        return { satisfiable: false, stats };
+      }
+      const { learned, btLevel } = analyzeConflict(conflict);
+      if (learned.length === 0 || btLevel < 0) {
+        stats.solveTimeMs = Date.now() - startTime;
+        return { satisfiable: false, stats };
+      }
+      backtrack(btLevel);
+      const lci = addLearned(learned);
+      enqueue(learned[0], learned.length === 1 ? 0 : btLevel, lci);
+      conflict = propagate();
+    }
+
+    if (conflictsSinceRestart >= conflictsUntilRestart) {
+      stats.restarts++;
+      if (restartPolicy === 1) {
+        conflictsUntilRestart = Math.floor(conflictsUntilRestart * GEOMETRIC_FACTOR);
+      } else {
+        lubyIdx++;
+        conflictsUntilRestart = RESTART_BASE * luby(lubyIdx);
+      }
+      conflictsSinceRestart = 0;
+      backtrack(0);
+    }
+
+    if (allClauses.length > nextReduceDB) {
+      reduceDB();
+      nextReduceDB = originalCount + allClauses.length * 2;
+    }
+  }
+
+  // SAT — build model
+  const model = {};
+  for (let i = 0; i < atomNames.length && i < numVars; i++) {
+    model[atomNames[i]] = varVal[i + 1] === 1 || varVal[i + 1] === 0;
+  }
+  stats.solveTimeMs = Date.now() - startTime;
+  return { satisfiable: true, model, stats };
+}
+
+// ── Worker message handler ──
+
+if (typeof require !== 'undefined') {
+  // Node.js worker_threads
+  try {
+    const { parentPort } = require('worker_threads');
+    if (parentPort) {
+      parentPort.on('message', function(msg) {
+        try {
+          const result = workerSolve(msg);
+          result.workerId = msg.workerId || 0;
+          parentPort.postMessage(result);
+        } catch (e) {
+          parentPort.postMessage({ satisfiable: false, error: e.message, workerId: msg.workerId || 0 });
+        }
+      });
+    }
+  } catch(e) {}
+} else if (typeof self !== 'undefined') {
+  // Browser Web Worker
+  self.onmessage = function(ev) {
+    try {
+      const result = workerSolve(ev.data);
+      result.workerId = ev.data.workerId || 0;
+      self.postMessage(result);
+    } catch (e) {
+      self.postMessage({ satisfiable: false, error: e.message, workerId: ev.data.workerId || 0 });
+    }
+  };
+}
+`;
+}
+// ── Creación de Workers ─────────────────────────────────────
+function createNodeWorker(code) {
+    // eslint-disable-next-line @typescript-eslint/no-require-imports
+    const wt = require('worker_threads');
+    const w = new wt.Worker(code, { eval: true });
+    return {
+        postMessage: (msg) => w.postMessage(msg),
+        terminate: () => void w.terminate(),
+        onMessage: (cb) => {
+            w.on('message', cb);
+        },
+        onError: (cb) => {
+            w.on('error', cb);
+        },
+    };
+}
+function createBrowserWorker(code) {
+    const blob = new Blob([code], { type: 'application/javascript' });
+    const url = URL.createObjectURL(blob);
+    // Browser Worker — globalThis access requiere any cast porque no tenemos lib:dom
+    // eslint-disable-next-line @typescript-eslint/no-unsafe-member-access, @typescript-eslint/no-explicit-any
+    const W = globalThis.Worker;
+    const w = new W(url);
+    return {
+        postMessage: (msg) => w.postMessage(msg),
+        terminate: () => {
+            w.terminate();
+            URL.revokeObjectURL(url);
+        },
+        onMessage: (cb) => {
+            w.onmessage = (ev) => cb(ev.data);
+        },
+        onError: (cb) => {
+            w.onerror = (ev) => cb(new Error(ev.message));
+        },
+    };
+}
+function spawnWorker() {
+    const code = getWorkerCode();
+    try {
+        if (typeof process !== 'undefined' && process.versions?.node) {
+            return createNodeWorker(code);
+        }
+        if (typeof globalThis !== 'undefined' && 'Worker' in globalThis) {
+            return createBrowserWorker(code);
+        }
+    }
+    catch {
+        // Workers no disponibles
+    }
+    return null;
+}
+const PORTFOLIO_CONFIGS = [
+    { heuristicSeed: 0, restartPolicy: 0 }, // Default (Luby)
+    { heuristicSeed: 42, restartPolicy: 1 }, // Geometric restarts
+    { heuristicSeed: 137, restartPolicy: 0 }, // Luby + seed perturbation
+    { heuristicSeed: 7919, restartPolicy: 2 }, // Fixed restarts + big seed
+];
+// ── Solver Paralelo Principal ───────────────────────────────
+/**
+ * Umbral mínimo de variables para activar paralelismo.
+ * Por debajo de este umbral, el overhead de workers no compensa.
+ */
+exports.PARALLEL_THRESHOLD = 80;
+/**
+ * Número máximo de workers a lanzar (limitado por configs de portfolio).
+ */
+exports.MAX_WORKERS = 4;
+/**
+ * Resuelve SAT en paralelo con portfolio racing.
+ *
+ * @param clauses Cláusulas ya codificadas (post-preprocessing)
+ * @param numVars Número de variables
+ * @param atomNames Nombres de los átomos originales
+ * @param timeoutMs Timeout global
+ * @returns Promise con el resultado
+ */
+function parallelSolve(clauses, numVars, atomNames, timeoutMs) {
+    return new Promise((resolve) => {
+        if (!workersAvailable()) {
+            // Fallback: no se resuelve aquí, el caller usará cdclSolve secuencial
+            resolve({ satisfiable: false, stats: undefined });
+            return;
+        }
+        const packed = packClauses(clauses);
+        const numWorkers = Math.min(exports.MAX_WORKERS, PORTFOLIO_CONFIGS.length);
+        const workers = [];
+        let resolved = false;
+        let completedCount = 0;
+        // Timeout global
+        const timer = setTimeout(() => {
+            if (!resolved) {
+                resolved = true;
+                terminateAll();
+                resolve({ satisfiable: false });
+            }
+        }, timeoutMs);
+        function terminateAll() {
+            for (const w of workers) {
+                try {
+                    w.terminate();
+                }
+                catch {
+                    // ignore
+                }
+            }
+            clearTimeout(timer);
+        }
+        for (let i = 0; i < numWorkers; i++) {
+            const w = spawnWorker();
+            if (!w)
+                continue;
+            workers.push(w);
+            const config = PORTFOLIO_CONFIGS[i];
+            w.onMessage((data) => {
+                const result = data;
+                completedCount++;
+                if (!resolved) {
+                    // Estrategia: el primero que encuentre SAT gana inmediatamente.
+                    // Si es UNSAT, esperar a que TODOS confirmen UNSAT.
+                    if (result.satisfiable) {
+                        resolved = true;
+                        terminateAll();
+                        resolve({
+                            satisfiable: true,
+                            model: result.model,
+                            stats: result.stats,
+                        });
+                    }
+                    else if (completedCount >= workers.length) {
+                        // Todos dijeron UNSAT
+                        resolved = true;
+                        terminateAll();
+                        resolve({
+                            satisfiable: false,
+                            stats: result.stats,
+                        });
+                    }
+                }
+            });
+            w.onError(() => {
+                completedCount++;
+                if (!resolved && completedCount >= workers.length) {
+                    resolved = true;
+                    terminateAll();
+                    resolve({ satisfiable: false });
+                }
+            });
+            w.postMessage({
+                clauseData: Array.from(packed), // Structured clone friendly
+                numVars,
+                atomNames,
+                timeoutMs: timeoutMs - 10, // Worker timeout ligeramente menor
+                heuristicSeed: config.heuristicSeed,
+                restartPolicy: config.restartPolicy,
+                workerId: i,
+            });
+        }
+        // Si no se pudieron crear workers, fallback inmediato
+        if (workers.length === 0) {
+            clearTimeout(timer);
+            resolve({ satisfiable: false, stats: undefined });
+        }
+    });
+}
+/**
+ * Versión síncrona que intenta paralelismo y cae a secuencial.
+ * Para integración transparente con el flujo actual de cdcl().
+ *
+ * NOTA: Esta función solo es útil si el caller puede manejar
+ * la Promise. Si no, usar cdclSolve directamente.
+ */
+function tryParallelSolve(clauses, numVars, atomNames, timeoutMs) {
+    if (!workersAvailable() || numVars < exports.PARALLEL_THRESHOLD) {
+        return null; // Caller debe usar solver secuencial
+    }
+    return parallelSolve(clauses, numVars, atomNames, timeoutMs);
+}
+//# sourceMappingURL=parallel-sat.js.map

package/dist/profiles/classical/parallel-sat.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parallel-sat.js","sourceRoot":"","sources":["../../../src/profiles/classical/parallel-sat.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,qDAAqD;AACrD,kEAAkE;AAClE,+DAA+D;AAC/D,EAAE;AACF,oEAAoE;AACpE,2DAA2D;AAC3D,uDAAuD;AACvD,EAAE;AACF,sEAAsE;AACtE,+DAA+D;;;AAkC/D,kCAUC;AAKD,sCASC;AAgBD,4CAoBC;AAydD,sCAmGC;AASD,4CAUC;AAlpBD,+DAA+D;AAE/D;;;;GAIG;AACH,SAAgB,WAAW,CAAC,OAAqB;IAC/C,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,QAAQ,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IAClD,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC;IACxC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,SAAgB,aAAa,CAAC,MAAkB;IAC9C,MAAM,OAAO,GAAiB,EAAE,CAAC;IACjC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,OAAO,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;QAC7B,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC;QACjD,MAAM,IAAI,GAAG,CAAC;IAChB,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAWD,IAAI,iBAAiB,GAAmB,IAAI,CAAC;AAE7C;;GAEG;AACH,SAAgB,gBAAgB;IAC9B,IAAI,iBAAiB,KAAK,IAAI;QAAE,OAAO,iBAAiB,CAAC;IACzD,IAAI,CAAC;QACH,mDAAmD;QACnD,IAAI,OAAO,OAAO,KAAK,WAAW,IAAI,OAAO,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC;YAC7D,iEAAiE;YACjE,OAAO,CAAC,gBAAgB,CAAC,CAAC;YAC1B,iBAAiB,GAAG,IAAI,CAAC;YACzB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,UAAU;QACV,IAAI,OAAO,UAAU,KAAK,WAAW,IAAI,QAAQ,IAAI,UAAU,EAAE,CAAC;YAChE,iBAAiB,GAAG,IAAI,CAAC;YACzB,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,mEAAmE;IACrE,CAAC;IACD,iBAAiB,GAAG,KAAK,CAAC;IAC1B,OAAO,KAAK,CAAC;AACf,CAAC;AAED,+DAA+D;AAC/D,0DAA0D;AAC1D,iEAAiE;AACjE,gEAAgE;AAEhE,SAAS,aAAa;IACpB,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA8WR,CAAC;AACF,CAAC;AAED,+DAA+D;AAE/D,SAAS,gBAAgB,CAAC,IAAY;IACpC,iEAAiE;IACjE,MAAM,EAAE,GAAG,OAAO,CAAC,gBAAgB,CAAoC,CAAC;IACxE,MAAM,CAAC,GAAG,IAAI,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;IAC9C,OAAO;QACL,WAAW,EAAE,CAAC,GAAY,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC;QACjD,SAAS,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,SAAS,EAAE;QACnC,SAAS,EAAE,CAAC,EAA2B,EAAE,EAAE;YACzC,CAAC,CAAC,EAAE,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QACtB,CAAC;QACD,OAAO,EAAE,CAAC,EAAwB,EAAE,EAAE;YACpC,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACpB,CAAC;KACF,CAAC;AACJ,CAAC;AAED,SAAS,mBAAmB,CAAC,IAAY;IACvC,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,wBAAwB,EAAE,CAAC,CAAC;IAClE,MAAM,GAAG,GAAG,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;IACtC,iFAAiF;IACjF,0GAA0G;IAC1G,MAAM,CAAC,GAAI,UAAkB,CAAC,MAAoC,CAAC;IACnE,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAKlB,CAAC;IACF,OAAO;QACL,WAAW,EAAE,CAAC,GAAY,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC;QACjD,SAAS,EAAE,GAAG,EAAE;YACd,CAAC,CAAC,SAAS,EAAE,CAAC;YACd,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;QAC3B,CAAC;QACD,SAAS,EAAE,CAAC,EAA2B,EAAE,EAAE;YACzC,CAAC,CAAC,SAAS,GAAG,CAAC,EAAqB,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QACvD,CAAC;QACD,OAAO,EAAE,CAAC,EAAwB,EAAE,EAAE;YACpC,CAAC,CAAC,OAAO,GAAG,CAAC,EAAuB,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACrE,CAAC;KACF,CAAC;AACJ,CAAC;AAED,SAAS,WAAW;IAClB,MAAM,IAAI,GAAG,aAAa,EAAE,CAAC;IAC7B,IAAI,CAAC;QACH,IAAI,OAAO,OAAO,KAAK,WAAW,IAAI,OAAO,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC;YAC7D,OAAO,gBAAgB,CAAC,IAAI,CAAC,CAAC;QAChC,CAAC;QACD,IAAI,OAAO,UAAU,KAAK,WAAW,IAAI,QAAQ,IAAI,UAAU,EAAE,CAAC;YAChE,OAAO,mBAAmB,CAAC,IAAI,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,yBAAyB;IAC3B,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AASD,MAAM,iBAAiB,GAAsB;IAC3C,EAAE,aAAa,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,EAAE,iBAAiB;IACzD,EAAE,aAAa,EAAE,EAAE,EAAE,aAAa,EAAE,CAAC,EAAE,EAAE,qBAAqB;IAC9D,EAAE,aAAa,EAAE,GAAG,EAAE,aAAa,EAAE,CAAC,EAAE,EAAE,2BAA2B;IACrE,EAAE,aAAa,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC,EAAE,EAAE,4BAA4B;CACxE,CAAC;AAEF,+DAA+D;AAE/D;;;GAGG;AACU,QAAA,kBAAkB,GAAG,EAAE,CAAC;AAErC;;GAEG;AACU,QAAA,WAAW,GAAG,CAAC,CAAC;AAE7B;;;;;;;;GAQG;AACH,SAAgB,aAAa,CAC3B,OAAqB,EACrB,OAAe,EACf,SAAmB,EACnB,SAAiB;IAEjB,OAAO,IAAI,OAAO,CAAa,CAAC,OAAO,EAAE,EAAE;QACzC,IAAI,CAAC,gBAAgB,EAAE,EAAE,CAAC;YACxB,sEAAsE;YACtE,OAAO,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC;YAClD,OAAO;QACT,CAAC;QAED,MAAM,MAAM,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;QACpC,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,mBAAW,EAAE,iBAAiB,CAAC,MAAM,CAAC,CAAC;QACnE,MAAM,OAAO,GAAiB,EAAE,CAAC;QACjC,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,IAAI,cAAc,GAAG,CAAC,CAAC;QAEvB,iBAAiB;QACjB,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE;YAC5B,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,QAAQ,GAAG,IAAI,CAAC;gBAChB,YAAY,EAAE,CAAC;gBACf,OAAO,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC;YAClC,CAAC;QACH,CAAC,EAAE,SAAS,CAAC,CAAC;QAEd,SAAS,YAAY;YACnB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;gBACxB,IAAI,CAAC;oBACH,CAAC,CAAC,SAAS,EAAE,CAAC;gBAChB,CAAC;gBAAC,MAAM,CAAC;oBACP,SAAS;gBACX,CAAC;YACH,CAAC;YACD,YAAY,CAAC,KAAK,CAAC,CAAC;QACtB,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,CAAC,GAAG,WAAW,EAAE,CAAC;YACxB,IAAI,CAAC,CAAC;gBAAE,SAAS;YACjB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAEhB,MAAM,MAAM,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;YAEpC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAa,EAAE,EAAE;gBAC5B,MAAM,MAAM,GAAG,IAAoB,CAAC;gBACpC,cAAc,EAAE,CAAC;gBAEjB,IAAI,CAAC,QAAQ,EAAE,CAAC;oBACd,gEAAgE;oBAChE,oDAAoD;oBACpD,IAAI,MAAM,CAAC,WAAW,EAAE,CAAC;wBACvB,QAAQ,GAAG,IAAI,CAAC;wBAChB,YAAY,EAAE,CAAC;wBACf,OAAO,CAAC;4BACN,WAAW,EAAE,IAAI;4BACjB,KAAK,EAAE,MAAM,CAAC,KAAK;4BACnB,KAAK,EAAE,MAAM,CAAC,KAAK;yBACpB,CAAC,CAAC;oBACL,CAAC;yBAAM,IAAI,cAAc,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;wBAC5C,sBAAsB;wBACtB,QAAQ,GAAG,IAAI,CAAC;wBAChB,YAAY,EAAE,CAAC;wBACf,OAAO,CAAC;4BACN,WAAW,EAAE,KAAK;4BAClB,KAAK,EAAE,MAAM,CAAC,KAAK;yBACpB,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;YACH,CAAC,CAAC,CAAC;YAEH,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE;gBACb,cAAc,EAAE,CAAC;gBACjB,IAAI,CAAC,QAAQ,IAAI,cAAc,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;oBAClD,QAAQ,GAAG,IAAI,CAAC;oBAChB,YAAY,EAAE,CAAC;oBACf,OAAO,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC;gBAClC,CAAC;YACH,CAAC,CAAC,CAAC;YAEH,CAAC,CAAC,WAAW,CAAC;gBACZ,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,4BAA4B;gBAC5D,OAAO;gBACP,SAAS;gBACT,SAAS,EAAE,SAAS,GAAG,EAAE,EAAE,mCAAmC;gBAC9D,aAAa,EAAE,MAAM,CAAC,aAAa;gBACnC,aAAa,EAAE,MAAM,CAAC,aAAa;gBACnC,QAAQ,EAAE,CAAC;aACZ,CAAC,CAAC;QACL,CAAC;QAED,sDAAsD;QACtD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,YAAY,CAAC,KAAK,CAAC,CAAC;YACpB,OAAO,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC;QACpD,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,gBAAgB,CAC9B,OAAqB,EACrB,OAAe,EACf,SAAmB,EACnB,SAAiB;IAEjB,IAAI,CAAC,gBAAgB,EAAE,IAAI,OAAO,GAAG,0BAAkB,EAAE,CAAC;QACxD,OAAO,IAAI,CAAC,CAAC,qCAAqC;IACpD,CAAC;IACD,OAAO,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;AAC/D,CAAC"}

package/dist/profiles/classical/propositional.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"propositional.d.ts","sourceRoot":"","sources":["../../../src/profiles/classical/propositional.ts"],"names":[],"mappings":"AAIA,OAAO,EACL,OAAO,EACP,UAAU,EACV,SAAS,EACT,MAAM,EACN,YAAY,EACZ,gBAAgB,EAEhB,SAAS,EAGV,MAAM,aAAa,CAAC;AASrB,wBAAgB,YAAY,CAAC,CAAC,EAAE,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,CAEpD;AAkBD,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,GAAG,OAAO,CAqCnE;AAyBD;;GAEG;AACH,wBAAiB,sBAAsB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC,SAAS,CAAC,CAc7E;AAwLD,wBAAgB,eAAe,CAAC,CAAC,EAAE,OAAO,GAAG,MAAM,CAElD;AA4GD,wBAAgB,KAAK,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAEzC;AAkJD,wBAAgB,KAAK,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAEzC;AA6BD,wBAAgB,KAAK,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAEzC;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,OAAO,GAAG,MAAM,EAAE,EAAE,CA8BrD;AAmsBD,qBAAa,sBAAuB,YAAW,YAAY;IACzD,IAAI,SAA6B;IACjC,WAAW,SACgG;IAE3G,eAAe,CAAC,OAAO,EAAE,OAAO,GAAG,UAAU,EAAE;IAkD/C,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IAgEvC,gBAAgB,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IAgE7C,KAAK,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,SAAS;IA6B/C,MAAM,CAAC,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,SAAS;IAmDpE,YAAY,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IAwFzC,OAAO,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IA2GpC,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,gBAAgB;IA4E9C,eAAe,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,SAAS;CA6BnD"}
+{"version":3,"file":"propositional.d.ts","sourceRoot":"","sources":["../../../src/profiles/classical/propositional.ts"],"names":[],"mappings":"AAIA,OAAO,EACL,OAAO,EACP,UAAU,EACV,SAAS,EACT,MAAM,EACN,YAAY,EACZ,gBAAgB,EAEhB,SAAS,EAGV,MAAM,aAAa,CAAC;AASrB,wBAAgB,YAAY,CAAC,CAAC,EAAE,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,CAEpD;AAkBD,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,GAAG,OAAO,CAqCnE;AAyBD;;GAEG;AACH,wBAAiB,sBAAsB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC,SAAS,CAAC,CAc7E;AAwMD,wBAAgB,eAAe,CAAC,CAAC,EAAE,OAAO,GAAG,MAAM,CAElD;AA4GD,wBAAgB,KAAK,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAEzC;AAkJD,wBAAgB,KAAK,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAEzC;AA6BD,wBAAgB,KAAK,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAEzC;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,OAAO,GAAG,MAAM,EAAE,EAAE,CA8BrD;AAmsBD,qBAAa,sBAAuB,YAAW,YAAY;IACzD,IAAI,SAA6B;IACjC,WAAW,SACgG;IAE3G,eAAe,CAAC,OAAO,EAAE,OAAO,GAAG,UAAU,EAAE;IAkD/C,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IAgEvC,gBAAgB,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IAgE7C,KAAK,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,SAAS;IA6B/C,MAAM,CAAC,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,SAAS;IAmDpE,YAAY,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IAwFzC,OAAO,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IA2GpC,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,gBAAgB;IA4E9C,eAAe,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,SAAS;CA6BnD"}