tla-ts 0.0.4-dev.4c0ab96 → 0.0.4-dev.55f2117

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (359) hide show
  1. package/README.md +37 -126
  2. package/dist/cli.cjs +1 -1
  3. package/dist/cli.js +1 -1
  4. package/dist/deciders.cjs +366 -0
  5. package/dist/deciders.js +366 -0
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +33 -1
  8. package/dist/index.d.ts +33 -1
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -4
  11. package/dist/parallel-worker.js +1 -4
  12. package/dist/prove-worker.cjs +9 -0
  13. package/dist/prove-worker.d.cts +9 -0
  14. package/dist/prove-worker.d.ts +9 -0
  15. package/dist/prove-worker.js +9 -0
  16. package/dist/prove.cjs +996 -0
  17. package/dist/prove.js +996 -0
  18. package/dist/run.cjs +45 -0
  19. package/dist/run.js +45 -0
  20. package/dist/tlapm.cjs +10 -0
  21. package/dist/tlapm.js +10 -0
  22. package/dist/transfer.cjs +38 -44
  23. package/dist/transfer.js +38 -44
  24. package/dist/worker.cjs +21 -0
  25. package/dist/worker.js +21 -0
  26. package/package.json +21 -12
  27. package/src/ast.ts +2 -2
  28. package/src/check.ts +7 -7
  29. package/src/{cli-options.ts → cli/options.ts} +1 -1
  30. package/src/{run-cli.ts → cli/run.ts} +293 -91
  31. package/src/cli.ts +1 -1
  32. package/src/config.ts +2 -2
  33. package/src/environment.ts +9 -9
  34. package/src/errors.ts +89 -30
  35. package/src/evaluate.ts +32 -11
  36. package/src/index.ts +10 -0
  37. package/src/levels.ts +1 -1
  38. package/src/live-check.ts +1 -1
  39. package/src/liveness.ts +1 -1
  40. package/src/{obligation-action.ts → obligations/action.ts} +247 -69
  41. package/src/{obligation-anon.ts → obligations/anon.ts} +49 -47
  42. package/src/obligations/ctx.ts +64 -0
  43. package/src/{obligation-deref.ts → obligations/deref.ts} +51 -92
  44. package/src/{obligation-expression.ts → obligations/expression.ts} +117 -57
  45. package/src/{obligation-format.ts → obligations/format.ts} +7 -8
  46. package/src/{obligation-generate.ts → obligations/generate.ts} +170 -192
  47. package/src/{obligations.ts → obligations/index.ts} +32 -16
  48. package/src/{obligation-levels.ts → obligations/levels.ts} +26 -28
  49. package/src/{obligation-module.ts → obligations/module.ts} +113 -121
  50. package/src/obligations/pickle.ts +98 -0
  51. package/src/obligations/pragma.ts +189 -0
  52. package/src/{obligation-printer.ts → obligations/printer.ts} +22 -80
  53. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
  54. package/src/{obligation-source.ts → obligations/source.ts} +154 -99
  55. package/src/obligations/temporal.ts +321 -0
  56. package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
  57. package/src/parallel-worker.ts +4 -20
  58. package/src/parallel.ts +13 -46
  59. package/src/parser.ts +1 -1
  60. package/src/{pcal-ast.ts → pcal/ast.ts} +2 -2
  61. package/src/{pcal-parse.ts → pcal/parse.ts} +3 -3
  62. package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +2 -2
  63. package/src/{pcal-translate.ts → pcal/translate.ts} +2 -2
  64. package/src/{pcal-validate.ts → pcal/validate.ts} +6 -6
  65. package/src/prove/decide-pool.ts +95 -0
  66. package/src/prove/deciders.ts +33 -0
  67. package/src/prove/first-order.ts +78 -0
  68. package/src/prove/isabelle/LICENSE +36 -0
  69. package/src/prove/isabelle/LICENSE-tlapm +26 -0
  70. package/src/prove/isabelle/decide.ts +47 -0
  71. package/src/prove/isabelle/encode.ts +446 -0
  72. package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
  73. package/src/prove/isabelle/isar/method.ts +367 -0
  74. package/src/prove/isabelle/isar/proof.ts +28 -0
  75. package/src/prove/isabelle/isar/statement.ts +57 -0
  76. package/src/prove/isabelle/isar/theory.ts +192 -0
  77. package/src/prove/isabelle/isar/type-check.ts +278 -0
  78. package/src/prove/isabelle/provers/blast/blast.ts +258 -0
  79. package/src/prove/isabelle/provers/blast/branch.ts +322 -0
  80. package/src/prove/isabelle/provers/blast/prove.ts +347 -0
  81. package/src/prove/isabelle/provers/blast/rules.ts +330 -0
  82. package/src/prove/isabelle/provers/blast/state.ts +180 -0
  83. package/src/prove/isabelle/provers/blast/term.ts +546 -0
  84. package/src/prove/isabelle/provers/clasimp.ts +150 -0
  85. package/src/prove/isabelle/provers/classical.ts +389 -0
  86. package/src/prove/isabelle/provers/hypsubst.ts +433 -0
  87. package/src/prove/isabelle/pure/bicompose.ts +174 -0
  88. package/src/prove/isabelle/pure/consts.ts +32 -0
  89. package/src/prove/isabelle/pure/conv.ts +79 -0
  90. package/src/prove/isabelle/pure/drule.ts +264 -0
  91. package/src/prove/isabelle/pure/envir.ts +331 -0
  92. package/src/prove/isabelle/pure/goal.ts +53 -0
  93. package/src/prove/isabelle/pure/interrupt.ts +16 -0
  94. package/src/prove/isabelle/pure/list.ts +12 -0
  95. package/src/prove/isabelle/pure/logic.ts +330 -0
  96. package/src/prove/isabelle/pure/name.ts +98 -0
  97. package/src/prove/isabelle/pure/net.ts +215 -0
  98. package/src/prove/isabelle/pure/object-logic.ts +41 -0
  99. package/src/prove/isabelle/pure/pattern.ts +631 -0
  100. package/src/prove/isabelle/pure/raw-simplifier.ts +338 -0
  101. package/src/prove/isabelle/pure/rewriter.ts +602 -0
  102. package/src/prove/isabelle/pure/search.ts +68 -0
  103. package/src/prove/isabelle/pure/seq.ts +133 -0
  104. package/src/prove/isabelle/pure/simplifier.ts +106 -0
  105. package/src/prove/isabelle/pure/table.ts +201 -0
  106. package/src/prove/isabelle/pure/tactic.ts +168 -0
  107. package/src/prove/isabelle/pure/tactical.ts +264 -0
  108. package/src/prove/isabelle/pure/term-ord.ts +105 -0
  109. package/src/prove/isabelle/pure/term.ts +688 -0
  110. package/src/prove/isabelle/pure/thm.ts +783 -0
  111. package/src/prove/isabelle/pure/type.ts +121 -0
  112. package/src/prove/isabelle/pure/unify.ts +753 -0
  113. package/src/prove/isabelle/pure/variable.ts +25 -0
  114. package/src/prove/isabelle/tla/classical-setup.ts +101 -0
  115. package/src/prove/isabelle/tla/context.ts +74 -0
  116. package/src/prove/isabelle/tla/logic-data.ts +5 -0
  117. package/src/prove/isabelle/tla/logic.ts +215 -0
  118. package/src/prove/isabelle/tla/simpdata.ts +241 -0
  119. package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
  120. package/src/prove/ocaml.ts +22 -0
  121. package/src/prove/prep/action.ts +508 -0
  122. package/src/prove/prep/defs.ts +33 -0
  123. package/src/prove/prep/elab.ts +156 -0
  124. package/src/prove/prep/enabled-axioms.ts +189 -0
  125. package/src/prove/prep/enabled.ts +43 -0
  126. package/src/prove/prep/fingerprint.ts +388 -0
  127. package/src/prove/prep/flatten.ts +70 -0
  128. package/src/prove/prep/level-comparison.ts +529 -0
  129. package/src/prove/prep/md5.ts +67 -0
  130. package/src/prove/prep/pragma.ts +221 -0
  131. package/src/prove/prep/trivial.ts +22 -0
  132. package/src/prove/prove-worker.ts +22 -0
  133. package/src/prove/prove.ts +498 -0
  134. package/src/prove/ptl/decide.ts +68 -0
  135. package/src/prove/ptl/encode.ts +255 -0
  136. package/src/prove/ptl/sat.ts +151 -0
  137. package/src/prove/ptl/tableau.ts +276 -0
  138. package/src/prove/smt/axiomatize.ts +69 -0
  139. package/src/prove/smt/axioms.ts +209 -0
  140. package/src/prove/smt/context.ts +108 -0
  141. package/src/prove/smt/data.ts +636 -0
  142. package/src/prove/smt/encode.ts +164 -0
  143. package/src/prove/smt/extensionality.ts +65 -0
  144. package/src/prove/smt/flatten.ts +112 -0
  145. package/src/prove/smt/format.ts +154 -0
  146. package/src/prove/smt/instances.ts +181 -0
  147. package/src/prove/smt/rewrite.ts +772 -0
  148. package/src/prove/smt/simplify.ts +57 -0
  149. package/src/prove/smt/solver/act-cache.ts +265 -0
  150. package/src/prove/smt/solver/arith-rewriter.ts +962 -0
  151. package/src/prove/smt/solver/array.ts +22 -0
  152. package/src/prove/smt/solver/asserted-formulas.ts +469 -0
  153. package/src/prove/smt/solver/ast-lt.ts +157 -0
  154. package/src/prove/smt/solver/ast-util.ts +91 -0
  155. package/src/prove/smt/solver/ast.ts +1315 -0
  156. package/src/prove/smt/solver/auf-solver.ts +572 -0
  157. package/src/prove/smt/solver/case-split-queue.ts +178 -0
  158. package/src/prove/smt/solver/cg-table.ts +175 -0
  159. package/src/prove/smt/solver/clause.ts +276 -0
  160. package/src/prove/smt/solver/conflict-resolution.ts +343 -0
  161. package/src/prove/smt/solver/context.ts +1292 -0
  162. package/src/prove/smt/solver/ctx-simplify.ts +334 -0
  163. package/src/prove/smt/solver/der.ts +224 -0
  164. package/src/prove/smt/solver/dyn-ack.ts +141 -0
  165. package/src/prove/smt/solver/e-matching.ts +659 -0
  166. package/src/prove/smt/solver/enode.ts +259 -0
  167. package/src/prove/smt/solver/expr-ref.ts +21 -0
  168. package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
  169. package/src/prove/smt/solver/fingerprints.ts +92 -0
  170. package/src/prove/smt/solver/flat-literals.ts +51 -0
  171. package/src/prove/smt/solver/goal.ts +138 -0
  172. package/src/prove/smt/solver/hash.ts +173 -0
  173. package/src/prove/smt/solver/hashtable.ts +166 -0
  174. package/src/prove/smt/solver/internalizer.ts +1381 -0
  175. package/src/prove/smt/solver/lbool.ts +5 -0
  176. package/src/prove/smt/solver/literal.ts +24 -0
  177. package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
  178. package/src/prove/smt/solver/lp/constraints.ts +78 -0
  179. package/src/prove/smt/solver/lp/containers.ts +296 -0
  180. package/src/prove/smt/solver/lp/core-solver.ts +504 -0
  181. package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
  182. package/src/prove/smt/solver/lp/dep-intervals.ts +642 -0
  183. package/src/prove/smt/solver/lp/dependency.ts +51 -0
  184. package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
  185. package/src/prove/smt/solver/lp/explanation.ts +46 -0
  186. package/src/prove/smt/solver/lp/gomory.ts +255 -0
  187. package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
  188. package/src/prove/smt/solver/lp/hnf.ts +281 -0
  189. package/src/prove/smt/solver/lp/int-cube.ts +295 -0
  190. package/src/prove/smt/solver/lp/int-solver.ts +514 -0
  191. package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
  192. package/src/prove/smt/solver/lp/lar-term.ts +62 -0
  193. package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
  194. package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
  195. package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
  196. package/src/prove/smt/solver/lp/nex.ts +120 -0
  197. package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
  198. package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
  199. package/src/prove/smt/solver/lp/nla-core.ts +968 -0
  200. package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
  201. package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
  202. package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
  203. package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
  204. package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
  205. package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
  206. package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  207. package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
  208. package/src/prove/smt/solver/lp/nla-order.ts +307 -0
  209. package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
  210. package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
  211. package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
  212. package/src/prove/smt/solver/lp/nla-types.ts +124 -0
  213. package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
  214. package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
  215. package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
  216. package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
  217. package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
  218. package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
  219. package/src/prove/smt/solver/lp/pdd.ts +971 -0
  220. package/src/prove/smt/solver/lp/random-updater.ts +138 -0
  221. package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
  222. package/src/prove/smt/solver/lp/union-find.ts +96 -0
  223. package/src/prove/smt/solver/mam-compiler.ts +847 -0
  224. package/src/prove/smt/solver/mam-interpreter.ts +400 -0
  225. package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
  226. package/src/prove/smt/solver/model-checker.ts +347 -0
  227. package/src/prove/smt/solver/model-evaluator.ts +262 -0
  228. package/src/prove/smt/solver/model-finder.ts +155 -0
  229. package/src/prove/smt/solver/model-generator.ts +97 -0
  230. package/src/prove/smt/solver/model-macro-solver.ts +728 -0
  231. package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
  232. package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
  233. package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
  234. package/src/prove/smt/solver/nlsat/explain.ts +607 -0
  235. package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
  236. package/src/prove/smt/solver/nlsat/levelwise.ts +737 -0
  237. package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
  238. package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
  239. package/src/prove/smt/solver/nlsat/solver.ts +911 -0
  240. package/src/prove/smt/solver/nlsat/types.ts +43 -0
  241. package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  242. package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
  243. package/src/prove/smt/solver/nnf.ts +469 -0
  244. package/src/prove/smt/solver/pattern-inference.ts +351 -0
  245. package/src/prove/smt/solver/poly-rewriter.ts +477 -0
  246. package/src/prove/smt/solver/propagate-values.ts +83 -0
  247. package/src/prove/smt/solver/proto-model.ts +551 -0
  248. package/src/prove/smt/solver/pull-quant.ts +139 -0
  249. package/src/prove/smt/solver/qe-lite-der.ts +526 -0
  250. package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
  251. package/src/prove/smt/solver/qe-lite.ts +381 -0
  252. package/src/prove/smt/solver/qi-queue.ts +362 -0
  253. package/src/prove/smt/solver/quant-tactics.ts +117 -0
  254. package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
  255. package/src/prove/smt/solver/quantifier-manager.ts +186 -0
  256. package/src/prove/smt/solver/random-gen.ts +10 -0
  257. package/src/prove/smt/solver/rational.ts +165 -0
  258. package/src/prove/smt/solver/ref-vector.ts +62 -0
  259. package/src/prove/smt/solver/relevancy.ts +247 -0
  260. package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
  261. package/src/prove/smt/solver/rewriter.ts +843 -0
  262. package/src/prove/smt/solver/rlimit.ts +79 -0
  263. package/src/prove/smt/solver/smtlib-parser.ts +526 -0
  264. package/src/prove/smt/solver/solver.ts +71 -0
  265. package/src/prove/smt/solver/sort.ts +35 -0
  266. package/src/prove/smt/solver/sticky-generations.ts +69 -0
  267. package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
  268. package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
  269. package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
  270. package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
  271. package/src/prove/smt/solver/theory-lra-model.ts +243 -0
  272. package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
  273. package/src/prove/smt/solver/theory-lra-state.ts +43 -0
  274. package/src/prove/smt/solver/theory-lra.ts +56 -0
  275. package/src/prove/smt/solver/var-subst.ts +258 -0
  276. package/src/prove/smt/solver/z3-license.txt +10 -0
  277. package/src/prove/smt/table.ts +170 -0
  278. package/src/prove/tlapm/cache.ts +236 -0
  279. package/src/prove/tlapm/ocaml-marshal.ts +166 -0
  280. package/src/prove/tlapm/tlapm.ts +96 -0
  281. package/src/prove/tlaps-module.ts +510 -0
  282. package/src/prove/verdict.ts +18 -0
  283. package/src/prove/zenon/LICENSE +32 -0
  284. package/src/prove/zenon/check/check.ts +105 -0
  285. package/src/prove/zenon/check/definitions.ts +144 -0
  286. package/src/prove/zenon/check/equality.ts +182 -0
  287. package/src/prove/zenon/check/functions.ts +62 -0
  288. package/src/prove/zenon/check/keys.ts +125 -0
  289. package/src/prove/zenon/check/propositional.ts +104 -0
  290. package/src/prove/zenon/check/records.ts +188 -0
  291. package/src/prove/zenon/check/relations.ts +121 -0
  292. package/src/prove/zenon/check/rewrites.ts +224 -0
  293. package/src/prove/zenon/check/sets.ts +302 -0
  294. package/src/prove/zenon/check/terms.ts +127 -0
  295. package/src/prove/zenon/check/tla.ts +126 -0
  296. package/src/prove/zenon/decide.ts +113 -0
  297. package/src/prove/zenon/encode.ts +379 -0
  298. package/src/prove/zenon/eqrel.ts +300 -0
  299. package/src/prove/zenon/equality-rules.ts +435 -0
  300. package/src/prove/zenon/expr.ts +551 -0
  301. package/src/prove/zenon/index-table.ts +350 -0
  302. package/src/prove/zenon/isar-case.ts +513 -0
  303. package/src/prove/zenon/isar.ts +1249 -0
  304. package/src/prove/zenon/limits.ts +15 -0
  305. package/src/prove/zenon/llproof.ts +173 -0
  306. package/src/prove/zenon/mltoll.ts +1566 -0
  307. package/src/prove/zenon/node.ts +297 -0
  308. package/src/prove/zenon/ocaml.ts +169 -0
  309. package/src/prove/zenon/parse.ts +247 -0
  310. package/src/prove/zenon/phrase.ts +191 -0
  311. package/src/prove/zenon/proof.ts +198 -0
  312. package/src/prove/zenon/propositional-rules.ts +387 -0
  313. package/src/prove/zenon/rules.ts +94 -0
  314. package/src/prove/zenon/search.ts +288 -0
  315. package/src/prove/zenon/tla/functions.ts +151 -0
  316. package/src/prove/zenon/tla/llproof.ts +480 -0
  317. package/src/prove/zenon/tla/records.ts +225 -0
  318. package/src/prove/zenon/tla/rewrites.ts +447 -0
  319. package/src/prove/zenon/tla/sets.ts +304 -0
  320. package/src/prove/zenon/tla/terms.ts +162 -0
  321. package/src/prove/zenon/tla/tla.ts +506 -0
  322. package/src/randomization.ts +1 -1
  323. package/src/resolve.ts +1 -1
  324. package/src/runtime.ts +2 -2
  325. package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
  326. package/src/{sany-generator.ts → sany/generator.ts} +14 -14
  327. package/src/{sany-levels.ts → sany/levels.ts} +2 -2
  328. package/src/{sany-lexer.ts → sany/lexer.ts} +1 -1
  329. package/src/{sany-linter.ts → sany/linter.ts} +1 -1
  330. package/src/{sany-modules.ts → sany/modules.ts} +2 -2
  331. package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
  332. package/src/{sany-report.ts → sany/report.ts} +15 -15
  333. package/src/{sany-selectors.ts → sany/selectors.ts} +3 -3
  334. package/src/{sany-source.ts → sany/source.ts} +6 -6
  335. package/src/{sany-xml.ts → sany/xml.ts} +5 -5
  336. package/src/spec-description.ts +1 -1
  337. package/src/{standard-levels.ts → standard/levels.ts} +1 -1
  338. package/src/{standard-modules.ts → standard/modules.ts} +12 -12
  339. package/src/{standard-ranges.ts → standard/ranges.ts} +1 -1
  340. package/src/state-graph.ts +1 -1
  341. package/src/successors.ts +1 -1
  342. package/src/symmetry.ts +1 -1
  343. package/src/{tlc-messages.ts → tlc/messages.ts} +2 -2
  344. package/src/{tlc-order.ts → tlc/order.ts} +7 -7
  345. package/src/{tlc-random.ts → tlc/random.ts} +3 -3
  346. package/src/{tlc-replay.ts → tlc/replay.ts} +5 -5
  347. package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
  348. package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +14 -8
  349. package/src/values.ts +1 -1
  350. package/src/worker.ts +65 -0
  351. package/dist/parallel.cjs +0 -12
  352. package/dist/parallel.js +0 -12
  353. package/dist/run-cli.cjs +0 -55
  354. package/dist/run-cli.js +0 -55
  355. package/src/value-sources.ts +0 -29
  356. /package/src/{sany-nodes.ts → sany/nodes.ts} +0 -0
  357. /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
  358. /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
  359. /package/src/{tlc-version.ts → tlc/version.ts} +0 -0
@@ -0,0 +1,5 @@
1
+ // Ported from Z3 (src/util/lbool.h), MIT license, see z3-license.txt. The three truth values of a
2
+ // literal, an assignment or a search.
3
+ export const L_TRUE = 1;
4
+ export const L_FALSE = -1;
5
+ export const L_UNDEF = 0;
@@ -0,0 +1,24 @@
1
+ // Ported from Z3 (src/smt/smt_literal.h, src/smt/smt_types.h), MIT license, see z3-license.txt.
2
+ // A Boolean variable numbers an atom. A literal is a variable or its negation, encoded as twice the
3
+ // variable plus one when negated, so a literal indexes per-literal arrays directly.
4
+ declare const boolVarBrand: unique symbol;
5
+ declare const literalBrand: unique symbol;
6
+
7
+ export type BoolVar = number & { readonly [boolVarBrand]: true };
8
+ export type Literal = number & { readonly [literalBrand]: true };
9
+
10
+ // The variable of true. Its positive literal is true and its negative literal false.
11
+ export const TRUE_BOOL_VAR = 0 as BoolVar;
12
+ export const TRUE_LITERAL = 0 as Literal;
13
+ export const FALSE_LITERAL = 1 as Literal;
14
+
15
+ export const toBoolVar = (index: number) => index as BoolVar;
16
+
17
+ export const mkLiteral = (boolVar: BoolVar, isNegated = false) =>
18
+ (boolVar * 2 + (isNegated ? 1 : 0)) as Literal;
19
+
20
+ export const negate = (literal: Literal) => (literal ^ 1) as Literal;
21
+
22
+ export const getVar = (literal: Literal) => (literal >> 1) as BoolVar;
23
+
24
+ export const isNegated = (literal: Literal) => (literal & 1) === 1;
@@ -0,0 +1,391 @@
1
+ // Ported from Z3 (src/math/lp/bound_analyzer_on_row.h, src/math/lp/lp_bound_propagator.h,
2
+ // src/math/lp/implied_bound.h, and propagate_bounds_for_touched_rows in src/math/lp/lar_solver.h),
3
+ // MIT license, see z3-license.txt. Bounds that a row implies on its columns from the bounds of the
4
+ // others, and equalities between columns that rows with fixed columns imply.
5
+ import { Rational } from "../rational";
6
+ import { COLUMN_FIXED, COLUMN_FREE, COLUMN_LOWER, COLUMN_UPPER } from "./core-solver";
7
+ import { type ConstraintKind, KIND_GE, KIND_GT, KIND_LE, KIND_LT } from "./constraints";
8
+ import { Dependency, linearize } from "./dependency";
9
+ import { Explanation } from "./explanation";
10
+ import type { LarSolver } from "./lar-solver";
11
+ import type { RowCell } from "./static-matrix";
12
+
13
+ // The theory side of lp_bound_propagator.
14
+ interface BoundPropagatorHost {
15
+ columnIsInteresting(column: number): boolean;
16
+ boundIsInteresting(column: number, kind: ConstraintKind, value: Rational): boolean;
17
+ isEqual(first: number, second: number): boolean;
18
+ addEq(first: number, second: number, explanation: Explanation, isFixed: boolean): boolean;
19
+ }
20
+
21
+ // implied_bound: the explanation is a weighted list of the witnesses of the other columns.
22
+ const getBoundKind = (isLower: boolean, isStrict: boolean) => {
23
+ if (isLower) return isStrict ? KIND_GT : KIND_GE;
24
+ return isStrict ? KIND_LT : KIND_LE;
25
+ };
26
+
27
+ export interface ImpliedBound {
28
+ column: number;
29
+ bound: Rational;
30
+ isLower: boolean;
31
+ isStrict: boolean;
32
+ explain: () => [Rational, Dependency][];
33
+ }
34
+
35
+ // bound_kind: the kind of a lower or upper bound, strict or not.
36
+ export const getImpliedKind = (bound: ImpliedBound) => getBoundKind(bound.isLower, bound.isStrict);
37
+
38
+ export class BoundPropagator {
39
+ ibounds: ImpliedBound[] = [];
40
+ private improvedLower = new Map<number, number>();
41
+ private improvedUpper = new Map<number, number>();
42
+ private visitedRows = new Set<number>();
43
+ private val2fixedRow = new Map<string, number>();
44
+ private row2indexPos = new Map<string, number>();
45
+ private row2indexNeg = new Map<string, number>();
46
+
47
+ constructor(
48
+ private solver: LarSolver,
49
+ private host: BoundPropagatorHost,
50
+ ) {}
51
+
52
+ init() {
53
+ this.improvedLower.clear();
54
+ this.improvedUpper.clear();
55
+ this.ibounds = [];
56
+ }
57
+
58
+ // propagate_bounds_for_touched_rows.
59
+ propagateBoundsForTouchedRows() {
60
+ const solver = this.solver;
61
+ const settings = solver.settings;
62
+ if (settings.isPropagatingEqs) {
63
+ if (settings.getRandomNext() % 10 === 0) solver.removeFixedVarsFromBase();
64
+ this.visitedRows.clear();
65
+ for (const rowIndex of solver.touchedRows.elems.slice()) {
66
+ const offsetEqs = settings.stats.offsetEqs;
67
+ this.cheapEqOnNbase(rowIndex);
68
+ if (settings.isCanceled()) return;
69
+ if (settings.stats.offsetEqs > offsetEqs) solver.rowBoundsToReplay.push(rowIndex);
70
+ }
71
+ }
72
+ for (const rowIndex of solver.touchedRows.elems.slice()) {
73
+ const row = solver.getRow(rowIndex);
74
+ if (row.length <= settings.maxRowLengthForBoundPropagation) {
75
+ settings.stats.bpRowsAnalyzed++;
76
+ this.analyzeRow(row);
77
+ }
78
+ if (settings.isCanceled()) return;
79
+ }
80
+ solver.touchedRows.clear();
81
+ }
82
+
83
+ // Bound analysis of a row whose sum is zero.
84
+
85
+ private analyzeRow(row: RowCell[]) {
86
+ const core = this.solver.core;
87
+ let columnOfU = -1;
88
+ let columnOfL = -1;
89
+ const advanceU = (column: number) => {
90
+ columnOfU = columnOfU === -1 ? column : -2;
91
+ };
92
+ const advanceL = (column: number) => {
93
+ columnOfL = columnOfL === -1 ? column : -2;
94
+ };
95
+ for (const cell of row) {
96
+ if (columnOfL === -2 && columnOfU === -2) return;
97
+ if (cell.coeff.isBig()) return;
98
+ switch (core.getColumnType(cell.column)) {
99
+ case COLUMN_LOWER:
100
+ if (cell.coeff.isPositive()) advanceU(cell.column);
101
+ else advanceL(cell.column);
102
+ break;
103
+ case COLUMN_UPPER:
104
+ if (cell.coeff.isNegative()) advanceU(cell.column);
105
+ else advanceL(cell.column);
106
+ break;
107
+ case COLUMN_FREE:
108
+ advanceU(cell.column);
109
+ advanceL(cell.column);
110
+ break;
111
+ }
112
+ }
113
+ let someIsInteresting: boolean | undefined;
114
+ const isSomeInteresting = () => {
115
+ someIsInteresting ??= row.some((cell) => this.host.columnIsInteresting(cell.column));
116
+ return someIsInteresting;
117
+ };
118
+ if (columnOfU >= 0) {
119
+ if (this.host.columnIsInteresting(columnOfU)) this.limitMonoidFromOne(row, columnOfU, true);
120
+ } else if (columnOfU === -1 && isSomeInteresting()) this.limitAllMonoids(row, true);
121
+ if (columnOfL >= 0) {
122
+ if (this.host.columnIsInteresting(columnOfL)) this.limitMonoidFromOne(row, columnOfL, false);
123
+ } else if (columnOfL === -1 && isSomeInteresting()) this.limitAllMonoids(row, false);
124
+ }
125
+
126
+ // The bound of a monoid a * x at its maximum, or its minimum, and whether it is strict.
127
+ private getMonoidBound(coeff: Rational, column: number, isMax: boolean) {
128
+ const solver = this.solver;
129
+ const isUpper = coeff.isPositive() === isMax;
130
+ const bound = isUpper ? solver.getUpperBound(column) : solver.getLowerBound(column);
131
+ return { value: bound.x, isStrict: !bound.y.isZero() };
132
+ }
133
+
134
+ // limit_all_monoids_from_below (isFromBelow) and limit_all_monoids_from_above.
135
+ private limitAllMonoids(row: RowCell[], isFromBelow: boolean) {
136
+ let numStrict = 0;
137
+ let total = Rational.zero;
138
+ for (const cell of row) {
139
+ const bound = this.getMonoidBound(cell.coeff, cell.column, isFromBelow);
140
+ total = total.sub(cell.coeff.mul(bound.value));
141
+ if (bound.isStrict) numStrict++;
142
+ }
143
+ for (const cell of row) {
144
+ if (!this.host.columnIsInteresting(cell.column)) continue;
145
+ const own = this.getMonoidBound(cell.coeff, cell.column, isFromBelow);
146
+ const bound = total.div(cell.coeff).add(own.value);
147
+ const isPositive = cell.coeff.isPositive();
148
+ const isStrict = numStrict - (own.isStrict ? 1 : 0) > 0;
149
+ this.limitJ(row, cell.column, bound, isPositive, isPositive === isFromBelow, isStrict);
150
+ }
151
+ }
152
+
153
+ // limit_monoid_u_from_below (isFromBelow) and limit_monoid_l_from_above.
154
+ private limitMonoidFromOne(row: RowCell[], target: number, isFromBelow: boolean) {
155
+ let bound = Rational.zero;
156
+ let targetCoeff = Rational.zero;
157
+ let isStrict = false;
158
+ for (const cell of row) {
159
+ if (cell.column === target) {
160
+ targetCoeff = cell.coeff;
161
+ continue;
162
+ }
163
+ const monoid = this.getMonoidBound(cell.coeff, cell.column, isFromBelow);
164
+ bound = bound.sub(cell.coeff.mul(monoid.value));
165
+ if (monoid.isStrict) isStrict = true;
166
+ }
167
+ bound = bound.div(targetCoeff);
168
+ const isPositive = targetCoeff.isPositive();
169
+ this.limitJ(row, target, bound, isPositive, isPositive === isFromBelow, isStrict);
170
+ }
171
+
172
+ private limitJ(
173
+ row: RowCell[],
174
+ column: number,
175
+ value: Rational,
176
+ isCoeffPositive: boolean,
177
+ isLower: boolean,
178
+ isStrict: boolean,
179
+ ) {
180
+ if (!this.host.boundIsInteresting(column, getBoundKind(isLower, isStrict), value)) return;
181
+ const solver = this.solver;
182
+ const explain = () => {
183
+ const jSign = (isCoeffPositive ? 1 : -1) * (isLower ? 1 : -1);
184
+ const own = row.find((cell) => cell.column === column)?.coeff.abs() ?? Rational.one;
185
+ const result: [Rational, Dependency][] = [];
186
+ for (const cell of row) {
187
+ if (cell.column === column) continue;
188
+ const sign = jSign * (cell.coeff.isPositive() ? 1 : -1);
189
+ const witness =
190
+ sign > 0 ? solver.getUpperWitness(cell.column) : solver.getLowerWitness(cell.column);
191
+ result.push([cell.coeff.abs().div(own), witness]);
192
+ }
193
+ return result;
194
+ };
195
+ this.addBound(value, column, isLower, isStrict, explain);
196
+ }
197
+
198
+ private addBound(
199
+ value: Rational,
200
+ column: number,
201
+ isLower: boolean,
202
+ isStrict: boolean,
203
+ explain: ImpliedBound["explain"],
204
+ ) {
205
+ const improved = isLower ? this.improvedLower : this.improvedUpper;
206
+ const index = improved.get(column);
207
+ if (index === undefined) {
208
+ improved.set(column, this.ibounds.length);
209
+ this.ibounds.push({ column, bound: value, isLower, isStrict, explain });
210
+ return;
211
+ }
212
+ const found = this.ibounds[index];
213
+ const comparison = value.compare(found.bound);
214
+ if (
215
+ (isLower ? comparison > 0 : comparison < 0) ||
216
+ (comparison === 0 && !found.isStrict && isStrict)
217
+ ) {
218
+ found.bound = value;
219
+ found.isStrict = isStrict;
220
+ found.explain = explain;
221
+ }
222
+ }
223
+
224
+ // Equalities from rows.
225
+
226
+ // column_is_fixed: fixed, without an infinitesimal.
227
+ private isFixed(column: number) {
228
+ const solver = this.solver;
229
+ return (
230
+ solver.core.getColumnType(column) === COLUMN_FIXED && solver.getLowerBound(column).y.isZero()
231
+ );
232
+ }
233
+
234
+ private getVal(column: number) {
235
+ return this.solver.getValue(column).x.toString();
236
+ }
237
+
238
+ private isEqNew(first: number, second: number) {
239
+ const external1 = this.solver.getExternal(first);
240
+ const external2 = this.solver.getExternal(second);
241
+ return external1 !== -1 && external2 !== -1 && !this.host.isEqual(external1, external2);
242
+ }
243
+
244
+ private explainFixedInRow(rowIndex: number, explanation: Explanation) {
245
+ const solver = this.solver;
246
+ const witnesses: Dependency[] = [];
247
+ for (const cell of solver.getRow(rowIndex)) {
248
+ if (!solver.isFixed(cell.column)) continue;
249
+ witnesses.push(solver.getLowerWitness(cell.column), solver.getUpperWitness(cell.column));
250
+ }
251
+ for (const constraint of linearize(witnesses)) explanation.push(constraint);
252
+ }
253
+
254
+ private addEqOnColumns(
255
+ explanation: Explanation,
256
+ first: number,
257
+ second: number,
258
+ isFixed: boolean,
259
+ ) {
260
+ const isAdded = this.host.addEq(first, second, explanation, isFixed);
261
+ if (!isAdded) return;
262
+ const stats = this.solver.settings.stats;
263
+ if (isFixed) stats.fixedEqs++;
264
+ else stats.offsetEqs++;
265
+ }
266
+
267
+ private getOnlyOneNonFixed(rowIndex: number) {
268
+ let result = -1;
269
+ for (const cell of this.solver.getRow(rowIndex)) {
270
+ if (this.isFixed(cell.column)) continue;
271
+ if (result !== -1) return -1;
272
+ result = cell.column;
273
+ }
274
+ return result;
275
+ }
276
+
277
+ private tryAddEquationWithInternalFixedTables(row1: number) {
278
+ const solver = this.solver;
279
+ const v1 = this.getOnlyOneNonFixed(row1);
280
+ if (v1 === -1) return;
281
+ const key = this.getVal(v1);
282
+ const row2 = this.val2fixedRow.get(key);
283
+ if (row2 === undefined || row2 >= solver.getRowCount()) {
284
+ this.val2fixedRow.set(key, row1);
285
+ return;
286
+ }
287
+ const v2 = this.getOnlyOneNonFixed(row2);
288
+ if (
289
+ v2 === -1 ||
290
+ !solver.getValue(v1).equals(solver.getValue(v2)) ||
291
+ solver.isInt(v1) !== solver.isInt(v2)
292
+ ) {
293
+ this.val2fixedRow.set(key, row1);
294
+ return;
295
+ }
296
+ if (v1 === v2 || !this.isEqNew(v1, v2)) return;
297
+ const explanation = new Explanation();
298
+ this.explainFixedInRow(row1, explanation);
299
+ this.explainFixedInRow(row2, explanation);
300
+ this.addEqOnColumns(explanation, v1, v2, true);
301
+ }
302
+
303
+ private tryAddEquationWithLpFixedTables(rowIndex: number, column: number) {
304
+ const solver = this.solver;
305
+ if (this.isFixed(column)) return;
306
+ const value = solver.getValue(column);
307
+ const other = value.y.isZero()
308
+ ? solver.findInFixedTables(value.x, solver.isInt(column))
309
+ : undefined;
310
+ if (other === undefined) {
311
+ this.tryAddEquationWithInternalFixedTables(rowIndex);
312
+ return;
313
+ }
314
+ if (!this.isEqNew(other, column)) return;
315
+ const explanation = new Explanation();
316
+ this.explainFixedInRow(rowIndex, explanation);
317
+ for (const constraint of linearize([
318
+ solver.getLowerWitness(other),
319
+ solver.getUpperWitness(other),
320
+ ]))
321
+ explanation.push(constraint);
322
+ this.addEqOnColumns(explanation, other, column, true);
323
+ }
324
+
325
+ // extract_non_fixed: the basic column, the other non-fixed column and the sign of its unit
326
+ // coefficient, when the row has at most two non-fixed columns.
327
+ private extractNonFixed(rowIndex: number) {
328
+ const solver = this.solver;
329
+ const x = solver.core.basis[rowIndex];
330
+ if (this.isFixed(x)) return { count: 0, x, y: -1, ySign: 0 };
331
+ let count = 1;
332
+ let y = -1;
333
+ let ySign = 0;
334
+ for (const cell of solver.getRow(rowIndex)) {
335
+ if (cell.column === x || this.isFixed(cell.column)) continue;
336
+ if (++count > 2) return { count, x, y, ySign };
337
+ y = cell.column;
338
+ ySign = cell.coeff.equals(Rational.one) ? 1 : cell.coeff.equals(Rational.minusOne) ? -1 : 0;
339
+ if (ySign === 0) return { count, x, y, ySign };
340
+ }
341
+ return { count, x, y, ySign };
342
+ }
343
+
344
+ private cheapEqOnNbase(rowIndex: number) {
345
+ this.cheapEqOnNbaseCore(rowIndex);
346
+ this.row2indexPos.clear();
347
+ this.row2indexNeg.clear();
348
+ }
349
+
350
+ private cheapEqOnNbaseCore(rowIndex: number) {
351
+ const solver = this.solver;
352
+ if (this.visitedRows.has(rowIndex)) return;
353
+ this.visitedRows.add(rowIndex);
354
+ const extracted = this.extractNonFixed(rowIndex);
355
+ if (extracted.count === 0 || extracted.count > 2) return;
356
+ if (extracted.count === 1) {
357
+ this.tryAddEquationWithLpFixedTables(rowIndex, extracted.x);
358
+ return;
359
+ }
360
+ if (extracted.ySign === 0) return;
361
+ (extracted.ySign === 1 ? this.row2indexPos : this.row2indexNeg).set(
362
+ this.getVal(extracted.x),
363
+ rowIndex,
364
+ );
365
+ for (const cell of solver.core.matrix.columns[extracted.y]) {
366
+ const other = cell.row;
367
+ if (other === rowIndex || this.visitedRows.has(other)) continue;
368
+ this.visitedRows.add(other);
369
+ const next = this.extractNonFixed(other);
370
+ if (next.count !== 2 || next.ySign === 0) continue;
371
+ const table = next.ySign === 1 ? this.row2indexPos : this.row2indexNeg;
372
+ const key = this.getVal(next.x);
373
+ const found = table.get(key);
374
+ if (found === undefined) {
375
+ table.set(key, other);
376
+ continue;
377
+ }
378
+ const baseOfFound = solver.core.basis[found];
379
+ if (
380
+ solver.isInt(next.x) !== solver.isInt(baseOfFound) ||
381
+ !solver.getValue(next.x).y.equals(solver.getValue(baseOfFound).y)
382
+ )
383
+ continue;
384
+ if (!this.isEqNew(next.x, baseOfFound)) continue;
385
+ const explanation = new Explanation();
386
+ this.explainFixedInRow(found, explanation);
387
+ this.explainFixedInRow(other, explanation);
388
+ this.addEqOnColumns(explanation, next.x, baseOfFound, false);
389
+ }
390
+ }
391
+ }
@@ -0,0 +1,78 @@
1
+ // Ported from Z3 (src/math/lp/lar_constraints.h), MIT license, see z3-license.txt. The bounds
2
+ // that the theory asserts on columns, each with a leaf dependency on its own index, and the set of
3
+ // active ones, both undone by pop.
4
+ import { Dependency, mkLeaf } from "./dependency";
5
+ import { Impq } from "./numeric-pair";
6
+ import { shrink } from "../array";
7
+
8
+ // lconstraint_kind: flipping negates the kind, and halving a non-strict kind gives the strict one.
9
+ export const KIND_LE = -2;
10
+ export const KIND_LT = -1;
11
+ export const KIND_EQ = 0;
12
+ export const KIND_GT = 1;
13
+ export const KIND_GE = 2;
14
+ // NE: a kind of nla's inequalities, never of a bound the theory asserts.
15
+ export const KIND_NE = 3;
16
+
17
+ export type ConstraintKind =
18
+ | typeof KIND_LE
19
+ | typeof KIND_LT
20
+ | typeof KIND_EQ
21
+ | typeof KIND_GT
22
+ | typeof KIND_GE;
23
+
24
+ export interface LarConstraint {
25
+ readonly column: number;
26
+ readonly kind: ConstraintKind;
27
+ readonly rhs: Impq;
28
+ readonly dep: Dependency;
29
+ isActive: boolean;
30
+ // Made for the atom of an nla lemma.
31
+ readonly isAuxiliary: boolean;
32
+ }
33
+
34
+ interface ConstraintScope {
35
+ size: number;
36
+ activeSize: number;
37
+ }
38
+
39
+ export class ConstraintSet {
40
+ readonly constraints: LarConstraint[] = [];
41
+ private active: number[] = [];
42
+ private scopes: ConstraintScope[] = [];
43
+ // m_is_auxiliary_mode: whether new constraints are auxiliary.
44
+ isAuxiliaryMode = false;
45
+
46
+ add(column: number, kind: ConstraintKind, rhs: Impq) {
47
+ const index = this.constraints.length;
48
+ this.constraints.push({
49
+ column,
50
+ kind,
51
+ rhs,
52
+ dep: mkLeaf(index),
53
+ isActive: false,
54
+ isAuxiliary: this.isAuxiliaryMode,
55
+ });
56
+ return index;
57
+ }
58
+
59
+ activate(index: number) {
60
+ const constraint = this.constraints[index];
61
+ if (constraint.isActive) return;
62
+ constraint.isActive = true;
63
+ this.active.push(index);
64
+ }
65
+
66
+ pushScope() {
67
+ this.scopes.push({ size: this.constraints.length, activeSize: this.active.length });
68
+ }
69
+
70
+ popScope(count: number) {
71
+ const scope = this.scopes[this.scopes.length - count];
72
+ shrink(this.scopes, this.scopes.length - count);
73
+ for (let index = this.active.length; index-- > scope.activeSize;)
74
+ this.constraints[this.active[index]].isActive = false;
75
+ shrink(this.active, scope.activeSize);
76
+ shrink(this.constraints, scope.size);
77
+ }
78
+ }