tla-ts 0.0.4-dev.6dec595 → 0.0.4-dev.7714e32

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 (378) 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 +44 -12
  8. package/dist/index.d.ts +44 -12
  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 +1006 -0
  17. package/dist/prove.js +1006 -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 +76 -92
  23. package/dist/transfer.js +76 -92
  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/bags.ts +22 -23
  29. package/src/builtins.ts +16 -8
  30. package/src/check.ts +131 -1154
  31. package/src/{cli-options.ts → cli/options.ts} +54 -9
  32. package/src/cli/run.ts +63 -0
  33. package/src/cli/shared.ts +106 -0
  34. package/src/cli/tlapm.ts +374 -0
  35. package/src/{run-cli.ts → cli/tlc.ts} +112 -718
  36. package/src/cli/xml-exporter.ts +221 -0
  37. package/src/cli.ts +1 -1
  38. package/src/codegen.ts +17 -15
  39. package/src/config.ts +5 -5
  40. package/src/dependencies.ts +4 -6
  41. package/src/environment.ts +55 -60
  42. package/src/errors.ts +97 -35
  43. package/src/evaluate.ts +109 -108
  44. package/src/exit-codes.ts +1 -1
  45. package/src/fingerprints.ts +3 -3
  46. package/src/index.ts +10 -0
  47. package/src/instances.ts +56 -46
  48. package/src/java-overrides.ts +79 -41
  49. package/src/json.ts +31 -36
  50. package/src/levels.ts +10 -13
  51. package/src/{live-check.ts → liveness-checker.ts} +169 -142
  52. package/src/liveness.ts +38 -34
  53. package/src/{obligation-action.ts → obligations/action.ts} +248 -74
  54. package/src/{obligation-anon.ts → obligations/anonymize.ts} +55 -57
  55. package/src/obligations/equality.ts +260 -0
  56. package/src/obligations/expression.ts +618 -0
  57. package/src/{obligation-format.ts → obligations/format.ts} +7 -8
  58. package/src/obligations/generate.ts +457 -0
  59. package/src/{obligations.ts → obligations/index.ts} +46 -32
  60. package/src/{obligation-levels.ts → obligations/levels.ts} +44 -40
  61. package/src/obligations/module.ts +445 -0
  62. package/src/obligations/normalize.ts +554 -0
  63. package/src/obligations/operators.ts +176 -0
  64. package/src/obligations/pragma.ts +195 -0
  65. package/src/{obligation-printer.ts → obligations/printer.ts} +65 -230
  66. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
  67. package/src/obligations/regroup.ts +100 -0
  68. package/src/{obligation-generate.ts → obligations/simplify.ts} +130 -536
  69. package/src/{obligation-source.ts → obligations/source.ts} +172 -216
  70. package/src/{obligation-deref.ts → obligations/subexpression.ts} +84 -115
  71. package/src/obligations/substitution.ts +261 -0
  72. package/src/obligations/temporal.ts +321 -0
  73. package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
  74. package/src/parallel-worker.ts +39 -51
  75. package/src/parallel.ts +39 -66
  76. package/src/parser.ts +67 -74
  77. package/src/{pcal-ast.ts → pcal/ast.ts} +2 -17
  78. package/src/{pcal-parse.ts → pcal/parse.ts} +28 -64
  79. package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +10 -39
  80. package/src/{pcal-translate.ts → pcal/translate.ts} +30 -109
  81. package/src/{pcal-validate.ts → pcal/validate.ts} +10 -20
  82. package/src/prover/decide-pool.ts +95 -0
  83. package/src/prover/deciders.ts +33 -0
  84. package/src/prover/first-order.ts +175 -0
  85. package/src/prover/isabelle/LICENSE +36 -0
  86. package/src/prover/isabelle/LICENSE-tlapm +26 -0
  87. package/src/prover/isabelle/decide.ts +44 -0
  88. package/src/prover/isabelle/encode.ts +445 -0
  89. package/src/prover/isabelle/isar/inner-syntax.ts +579 -0
  90. package/src/prover/isabelle/isar/method.ts +367 -0
  91. package/src/prover/isabelle/isar/proof.ts +28 -0
  92. package/src/prover/isabelle/isar/statement.ts +57 -0
  93. package/src/prover/isabelle/isar/theory.ts +192 -0
  94. package/src/prover/isabelle/isar/type-check.ts +278 -0
  95. package/src/prover/isabelle/provers/blast/blast.ts +258 -0
  96. package/src/prover/isabelle/provers/blast/branch.ts +322 -0
  97. package/src/prover/isabelle/provers/blast/prove.ts +347 -0
  98. package/src/prover/isabelle/provers/blast/rules.ts +330 -0
  99. package/src/prover/isabelle/provers/blast/state.ts +180 -0
  100. package/src/prover/isabelle/provers/blast/term.ts +546 -0
  101. package/src/prover/isabelle/provers/clasimp.ts +150 -0
  102. package/src/prover/isabelle/provers/classical.ts +389 -0
  103. package/src/prover/isabelle/provers/hypsubst.ts +433 -0
  104. package/src/prover/isabelle/pure/bicompose.ts +174 -0
  105. package/src/prover/isabelle/pure/consts.ts +32 -0
  106. package/src/prover/isabelle/pure/conv.ts +79 -0
  107. package/src/prover/isabelle/pure/drule.ts +264 -0
  108. package/src/prover/isabelle/pure/envir.ts +331 -0
  109. package/src/prover/isabelle/pure/goal.ts +53 -0
  110. package/src/prover/isabelle/pure/interrupt.ts +16 -0
  111. package/src/prover/isabelle/pure/list.ts +12 -0
  112. package/src/prover/isabelle/pure/logic.ts +330 -0
  113. package/src/prover/isabelle/pure/name.ts +98 -0
  114. package/src/prover/isabelle/pure/net.ts +215 -0
  115. package/src/prover/isabelle/pure/object-logic.ts +41 -0
  116. package/src/prover/isabelle/pure/pattern.ts +631 -0
  117. package/src/prover/isabelle/pure/raw-simplifier.ts +338 -0
  118. package/src/prover/isabelle/pure/rewriter.ts +602 -0
  119. package/src/prover/isabelle/pure/search.ts +68 -0
  120. package/src/prover/isabelle/pure/seq.ts +133 -0
  121. package/src/prover/isabelle/pure/simplifier.ts +106 -0
  122. package/src/prover/isabelle/pure/table.ts +201 -0
  123. package/src/prover/isabelle/pure/tactic.ts +168 -0
  124. package/src/prover/isabelle/pure/tactical.ts +264 -0
  125. package/src/prover/isabelle/pure/term-ord.ts +105 -0
  126. package/src/prover/isabelle/pure/term.ts +688 -0
  127. package/src/prover/isabelle/pure/thm.ts +783 -0
  128. package/src/prover/isabelle/pure/type.ts +121 -0
  129. package/src/prover/isabelle/pure/unify.ts +753 -0
  130. package/src/prover/isabelle/pure/variable.ts +25 -0
  131. package/src/prover/isabelle/tla/classical-setup.ts +101 -0
  132. package/src/prover/isabelle/tla/context.ts +74 -0
  133. package/src/prover/isabelle/tla/logic-data.ts +5 -0
  134. package/src/prover/isabelle/tla/logic.ts +215 -0
  135. package/src/prover/isabelle/tla/simpdata.ts +241 -0
  136. package/src/prover/isabelle/tools/intuitionistic.ts +132 -0
  137. package/src/prover/ocaml.ts +22 -0
  138. package/src/prover/prep/action.ts +508 -0
  139. package/src/prover/prep/enabled-axioms.ts +189 -0
  140. package/src/prover/prep/fingerprint.ts +388 -0
  141. package/src/prover/prep/level-comparison.ts +529 -0
  142. package/src/prover/prep/md5.ts +60 -0
  143. package/src/prover/prep/methods.ts +221 -0
  144. package/src/prover/prep/normalize.ts +309 -0
  145. package/src/prover/prove-worker.ts +22 -0
  146. package/src/prover/prove.ts +492 -0
  147. package/src/prover/ptl/decide.ts +68 -0
  148. package/src/prover/ptl/encode.ts +244 -0
  149. package/src/prover/ptl/sat.ts +151 -0
  150. package/src/prover/ptl/tableau.ts +276 -0
  151. package/src/prover/smt/axioms.ts +209 -0
  152. package/src/prover/smt/context.ts +108 -0
  153. package/src/prover/smt/data.ts +636 -0
  154. package/src/prover/smt/encode.ts +275 -0
  155. package/src/prover/smt/extensionality.ts +65 -0
  156. package/src/prover/smt/flatten.ts +112 -0
  157. package/src/prover/smt/format.ts +154 -0
  158. package/src/prover/smt/instances.ts +181 -0
  159. package/src/prover/smt/rewrite.ts +766 -0
  160. package/src/prover/smt/solver/act-cache.ts +265 -0
  161. package/src/prover/smt/solver/arith-rewriter.ts +962 -0
  162. package/src/prover/smt/solver/array.ts +22 -0
  163. package/src/prover/smt/solver/asserted-formulas.ts +469 -0
  164. package/src/prover/smt/solver/ast-lt.ts +157 -0
  165. package/src/prover/smt/solver/ast-util.ts +91 -0
  166. package/src/prover/smt/solver/ast.ts +1315 -0
  167. package/src/prover/smt/solver/auf-solver.ts +572 -0
  168. package/src/prover/smt/solver/case-split-queue.ts +178 -0
  169. package/src/prover/smt/solver/cg-table.ts +175 -0
  170. package/src/prover/smt/solver/clause.ts +276 -0
  171. package/src/prover/smt/solver/conflict-resolution.ts +343 -0
  172. package/src/prover/smt/solver/context.ts +1292 -0
  173. package/src/prover/smt/solver/ctx-simplify.ts +334 -0
  174. package/src/prover/smt/solver/der.ts +224 -0
  175. package/src/prover/smt/solver/dyn-ack.ts +141 -0
  176. package/src/prover/smt/solver/e-matching.ts +659 -0
  177. package/src/prover/smt/solver/enode.ts +259 -0
  178. package/src/prover/smt/solver/expr-ref.ts +21 -0
  179. package/src/prover/smt/solver/expr-safe-replace.ts +172 -0
  180. package/src/prover/smt/solver/fingerprints.ts +92 -0
  181. package/src/prover/smt/solver/flat-literals.ts +51 -0
  182. package/src/prover/smt/solver/goal.ts +138 -0
  183. package/src/prover/smt/solver/hash.ts +173 -0
  184. package/src/prover/smt/solver/hashtable.ts +166 -0
  185. package/src/prover/smt/solver/internalizer.ts +1381 -0
  186. package/src/prover/smt/solver/lbool.ts +5 -0
  187. package/src/prover/smt/solver/literal.ts +24 -0
  188. package/src/prover/smt/solver/lp/bound-propagator.ts +391 -0
  189. package/src/prover/smt/solver/lp/constraints.ts +78 -0
  190. package/src/prover/smt/solver/lp/containers.ts +296 -0
  191. package/src/prover/smt/solver/lp/core-solver.ts +504 -0
  192. package/src/prover/smt/solver/lp/cross-nested.ts +224 -0
  193. package/src/prover/smt/solver/lp/dep-intervals.ts +642 -0
  194. package/src/prover/smt/solver/lp/dependency.ts +51 -0
  195. package/src/prover/smt/solver/lp/dioph-eq.ts +1181 -0
  196. package/src/prover/smt/solver/lp/explanation.ts +46 -0
  197. package/src/prover/smt/solver/lp/gomory.ts +255 -0
  198. package/src/prover/smt/solver/lp/hnf-cutter.ts +125 -0
  199. package/src/prover/smt/solver/lp/hnf.ts +281 -0
  200. package/src/prover/smt/solver/lp/int-cube.ts +295 -0
  201. package/src/prover/smt/solver/lp/int-solver.ts +514 -0
  202. package/src/prover/smt/solver/lp/lar-solver.ts +816 -0
  203. package/src/prover/smt/solver/lp/lar-term.ts +62 -0
  204. package/src/prover/smt/solver/lp/lp-settings.ts +91 -0
  205. package/src/prover/smt/solver/lp/maximize-term.ts +347 -0
  206. package/src/prover/smt/solver/lp/nex-creator.ts +381 -0
  207. package/src/prover/smt/solver/lp/nex.ts +120 -0
  208. package/src/prover/smt/solver/lp/nla-backoff.ts +43 -0
  209. package/src/prover/smt/solver/lp/nla-basics.ts +398 -0
  210. package/src/prover/smt/solver/lp/nla-core.ts +968 -0
  211. package/src/prover/smt/solver/lp/nla-divisions.ts +332 -0
  212. package/src/prover/smt/solver/lp/nla-emonics.ts +373 -0
  213. package/src/prover/smt/solver/lp/nla-factorization.ts +30 -0
  214. package/src/prover/smt/solver/lp/nla-grobner.ts +904 -0
  215. package/src/prover/smt/solver/lp/nla-horner.ts +126 -0
  216. package/src/prover/smt/solver/lp/nla-intervals.ts +265 -0
  217. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  218. package/src/prover/smt/solver/lp/nla-monotone.ts +59 -0
  219. package/src/prover/smt/solver/lp/nla-order.ts +307 -0
  220. package/src/prover/smt/solver/lp/nla-patcher.ts +112 -0
  221. package/src/prover/smt/solver/lp/nla-tangents.ts +251 -0
  222. package/src/prover/smt/solver/lp/nla-throttle.ts +85 -0
  223. package/src/prover/smt/solver/lp/nla-types.ts +124 -0
  224. package/src/prover/smt/solver/lp/nla-var-eqs.ts +141 -0
  225. package/src/prover/smt/solver/lp/nra-solver.ts +440 -0
  226. package/src/prover/smt/solver/lp/numeric-pair.ts +65 -0
  227. package/src/prover/smt/solver/lp/pdd-interval.ts +31 -0
  228. package/src/prover/smt/solver/lp/pdd-simplifier.ts +184 -0
  229. package/src/prover/smt/solver/lp/pdd-solver.ts +408 -0
  230. package/src/prover/smt/solver/lp/pdd.ts +971 -0
  231. package/src/prover/smt/solver/lp/random-updater.ts +138 -0
  232. package/src/prover/smt/solver/lp/static-matrix.ts +246 -0
  233. package/src/prover/smt/solver/lp/union-find.ts +96 -0
  234. package/src/prover/smt/solver/mam-compiler.ts +847 -0
  235. package/src/prover/smt/solver/mam-interpreter.ts +400 -0
  236. package/src/prover/smt/solver/maximize-ac-sharing.ts +118 -0
  237. package/src/prover/smt/solver/model-checker.ts +347 -0
  238. package/src/prover/smt/solver/model-evaluator.ts +262 -0
  239. package/src/prover/smt/solver/model-finder.ts +155 -0
  240. package/src/prover/smt/solver/model-generator.ts +97 -0
  241. package/src/prover/smt/solver/model-macro-solver.ts +728 -0
  242. package/src/prover/smt/solver/nlsat/algebraic.ts +1161 -0
  243. package/src/prover/smt/solver/nlsat/atoms.ts +238 -0
  244. package/src/prover/smt/solver/nlsat/evaluator.ts +303 -0
  245. package/src/prover/smt/solver/nlsat/explain.ts +607 -0
  246. package/src/prover/smt/solver/nlsat/interval-set.ts +351 -0
  247. package/src/prover/smt/solver/nlsat/levelwise.ts +737 -0
  248. package/src/prover/smt/solver/nlsat/mpbq.ts +161 -0
  249. package/src/prover/smt/solver/nlsat/polynomial.ts +1722 -0
  250. package/src/prover/smt/solver/nlsat/solver.ts +911 -0
  251. package/src/prover/smt/solver/nlsat/types.ts +43 -0
  252. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  253. package/src/prover/smt/solver/nlsat/upolynomial.ts +996 -0
  254. package/src/prover/smt/solver/nnf.ts +469 -0
  255. package/src/prover/smt/solver/pattern-inference.ts +351 -0
  256. package/src/prover/smt/solver/poly-rewriter.ts +477 -0
  257. package/src/prover/smt/solver/propagate-values.ts +83 -0
  258. package/src/prover/smt/solver/proto-model.ts +551 -0
  259. package/src/prover/smt/solver/pull-quant.ts +139 -0
  260. package/src/prover/smt/solver/qe-lite-der.ts +526 -0
  261. package/src/prover/smt/solver/qe-lite-fm.ts +576 -0
  262. package/src/prover/smt/solver/qe-lite.ts +381 -0
  263. package/src/prover/smt/solver/qi-queue.ts +362 -0
  264. package/src/prover/smt/solver/quant-tactics.ts +117 -0
  265. package/src/prover/smt/solver/quantifier-analyzer.ts +562 -0
  266. package/src/prover/smt/solver/quantifier-manager.ts +186 -0
  267. package/src/prover/smt/solver/random-gen.ts +10 -0
  268. package/src/prover/smt/solver/rational.ts +165 -0
  269. package/src/prover/smt/solver/ref-vector.ts +62 -0
  270. package/src/prover/smt/solver/relevancy.ts +247 -0
  271. package/src/prover/smt/solver/rewriter-tpl.ts +1159 -0
  272. package/src/prover/smt/solver/rewriter.ts +843 -0
  273. package/src/prover/smt/solver/rlimit.ts +79 -0
  274. package/src/prover/smt/solver/smtlib-parser.ts +526 -0
  275. package/src/prover/smt/solver/solver.ts +71 -0
  276. package/src/prover/smt/solver/sort.ts +35 -0
  277. package/src/prover/smt/solver/sticky-generations.ts +69 -0
  278. package/src/prover/smt/solver/theory-lra-axioms.ts +340 -0
  279. package/src/prover/smt/solver/theory-lra-bounds.ts +226 -0
  280. package/src/prover/smt/solver/theory-lra-final-check.ts +252 -0
  281. package/src/prover/smt/solver/theory-lra-internalize.ts +476 -0
  282. package/src/prover/smt/solver/theory-lra-model.ts +243 -0
  283. package/src/prover/smt/solver/theory-lra-propagate.ts +405 -0
  284. package/src/prover/smt/solver/theory-lra-state.ts +43 -0
  285. package/src/prover/smt/solver/theory-lra.ts +56 -0
  286. package/src/prover/smt/solver/var-subst.ts +258 -0
  287. package/src/prover/smt/solver/z3-license.txt +10 -0
  288. package/src/prover/smt/table.ts +170 -0
  289. package/src/prover/tlapm/cache.ts +236 -0
  290. package/src/prover/tlapm/ocaml-marshal.ts +166 -0
  291. package/src/prover/tlapm/tlapm.ts +96 -0
  292. package/src/prover/tlaps-module.ts +510 -0
  293. package/src/prover/verdict.ts +13 -0
  294. package/src/prover/zenon/LICENSE +32 -0
  295. package/src/prover/zenon/check/check.ts +105 -0
  296. package/src/prover/zenon/check/definitions.ts +144 -0
  297. package/src/prover/zenon/check/equality.ts +182 -0
  298. package/src/prover/zenon/check/functions.ts +62 -0
  299. package/src/prover/zenon/check/keys.ts +125 -0
  300. package/src/prover/zenon/check/propositional.ts +104 -0
  301. package/src/prover/zenon/check/records.ts +188 -0
  302. package/src/prover/zenon/check/relations.ts +121 -0
  303. package/src/prover/zenon/check/rewrites.ts +224 -0
  304. package/src/prover/zenon/check/sets.ts +302 -0
  305. package/src/prover/zenon/check/terms.ts +127 -0
  306. package/src/prover/zenon/check/tla.ts +126 -0
  307. package/src/prover/zenon/decide.ts +107 -0
  308. package/src/prover/zenon/encode.ts +378 -0
  309. package/src/prover/zenon/eqrel.ts +300 -0
  310. package/src/prover/zenon/equality-rules.ts +435 -0
  311. package/src/prover/zenon/expr.ts +551 -0
  312. package/src/prover/zenon/index-table.ts +350 -0
  313. package/src/prover/zenon/isar-case.ts +513 -0
  314. package/src/prover/zenon/isar.ts +1249 -0
  315. package/src/prover/zenon/limits.ts +15 -0
  316. package/src/prover/zenon/llproof.ts +173 -0
  317. package/src/prover/zenon/mltoll.ts +1566 -0
  318. package/src/prover/zenon/node.ts +297 -0
  319. package/src/prover/zenon/ocaml.ts +169 -0
  320. package/src/prover/zenon/parse.ts +247 -0
  321. package/src/prover/zenon/phrase.ts +191 -0
  322. package/src/prover/zenon/proof.ts +198 -0
  323. package/src/prover/zenon/propositional-rules.ts +387 -0
  324. package/src/prover/zenon/rules.ts +94 -0
  325. package/src/prover/zenon/search.ts +288 -0
  326. package/src/prover/zenon/tla/functions.ts +151 -0
  327. package/src/prover/zenon/tla/llproof.ts +480 -0
  328. package/src/prover/zenon/tla/records.ts +225 -0
  329. package/src/prover/zenon/tla/rewrites.ts +447 -0
  330. package/src/prover/zenon/tla/sets.ts +304 -0
  331. package/src/prover/zenon/tla/terms.ts +162 -0
  332. package/src/prover/zenon/tla/tla.ts +506 -0
  333. package/src/randomization.ts +19 -24
  334. package/src/resolve.ts +15 -22
  335. package/src/runtime.ts +8 -8
  336. package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
  337. package/src/{sany-generator.ts → sany/generator.ts} +38 -55
  338. package/src/{sany-levels.ts → sany/levels.ts} +45 -48
  339. package/src/{sany-lexer.ts → sany/lexer.ts} +2 -3
  340. package/src/{sany-linter.ts → sany/linter.ts} +1 -1
  341. package/src/{sany-modules.ts → sany/modules.ts} +2 -2
  342. package/src/{sany-nodes.ts → sany/nodes.ts} +2 -2
  343. package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
  344. package/src/{sany-report.ts → sany/report.ts} +16 -17
  345. package/src/{sany-selectors.ts → sany/selectors.ts} +3 -5
  346. package/src/{sany-source.ts → sany/source.ts} +6 -7
  347. package/src/{sany-xml.ts → sany/xml.ts} +5 -6
  348. package/src/search.ts +969 -0
  349. package/src/spec-description.ts +26 -20
  350. package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
  351. package/src/standard-modules.ts +16 -20
  352. package/src/state-graph.ts +9 -8
  353. package/src/substitution-levels.ts +2 -2
  354. package/src/successors.ts +16 -19
  355. package/src/symmetry.ts +1 -1
  356. package/src/tableau.ts +6 -7
  357. package/src/tlc/fingerprint.ts +214 -0
  358. package/src/{tlc-messages.ts → tlc/messages.ts} +119 -7
  359. package/src/{tlc-order.ts → tlc/order.ts} +7 -7
  360. package/src/{tlc-random.ts → tlc/random.ts} +3 -213
  361. package/src/{tlc-replay.ts → tlc/replay.ts} +40 -36
  362. package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
  363. package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +30 -25
  364. package/src/transfer.ts +32 -32
  365. package/src/values.ts +80 -70
  366. package/src/worker.ts +62 -0
  367. package/dist/parallel.cjs +0 -12
  368. package/dist/parallel.js +0 -12
  369. package/dist/run-cli.cjs +0 -55
  370. package/dist/run-cli.js +0 -55
  371. package/src/canonical.ts +0 -40
  372. package/src/obligation-expression.ts +0 -1060
  373. package/src/obligation-module.ts +0 -1042
  374. package/src/standard-ranges.ts +0 -116
  375. package/src/value-sources.ts +0 -29
  376. /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
  377. /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
  378. /package/src/{tlc-version.ts → tlc/version.ts} +0 -0
@@ -0,0 +1,398 @@
1
+ // Ported from Z3 (src/math/lp/nla_basics_lemmas.h, src/math/lp/nla_basics_lemmas.cpp), MIT
2
+ // license, see z3-license.txt. The basic lemmas of nla on monomials whose values are wrong: signs
3
+ // (-ab = (-a)b), zeros (xy = 0 iff x = 0 or y = 0), neutral factors (|xa| = |x| and x != 0 imply
4
+ // |a| = 1) and proportions (|xy| >= |y| when x != 0). Only the model-based lemmas are ported: with
5
+ // derived = true, basic_lemma returns after the sign lemma, so Z3 never reaches its derived
6
+ // zero and neutral lemmas.
7
+ import { Rational } from "../rational";
8
+ import { KIND_EQ, KIND_GE, KIND_GT, KIND_LE, KIND_LT, KIND_NE } from "./constraints";
9
+ import { LarTerm } from "./lar-term";
10
+ import { type NlaCore } from "./nla-core";
11
+ import { type Factorization } from "./nla-factorization";
12
+ import { getRatSign, LemmaBuilder, mkIneq, signToRat } from "./nla-types";
13
+ import type { Monic } from "./nla-emonics";
14
+
15
+ interface FactorValue {
16
+ variable: number;
17
+ value: Rational;
18
+ }
19
+
20
+ export class Basics {
21
+ constructor(private core: NlaCore) {}
22
+
23
+ basicLemma(isDerived: boolean) {
24
+ const core = this.core;
25
+ if (this.basicSignLemma(isDerived)) return;
26
+ if (isDerived) return;
27
+ const toRefine = core.toRefine;
28
+ const start = core.random();
29
+ const size = toRefine.size;
30
+ for (let index = 0; index < size; index++)
31
+ this.basicLemmaForMonModelBased(
32
+ core.emons.get(toRefine.elems[(index + start) % toRefine.size]),
33
+ );
34
+ }
35
+
36
+ // Signs.
37
+
38
+ private basicSignLemmaOnTwoMonics(first: Monic, second: Monic) {
39
+ const sign = signToRat(first.rsign !== second.rsign);
40
+ if (this.core.varVal(first).equals(this.core.varVal(second).mul(sign))) return false;
41
+ this.generateSignLemma(first, second, sign);
42
+ return true;
43
+ }
44
+
45
+ private generateZeroLemmas(monic: Monic) {
46
+ let sign = getRatSign(this.core.varVal(monic));
47
+ const fixedZeros: number[] = [];
48
+ const zeroVar = this.findBestZero(monic, fixedZeros);
49
+ let zeroPower = 0;
50
+ for (const lpVar of monic.vars) {
51
+ if (lpVar === zeroVar) {
52
+ zeroPower++;
53
+ continue;
54
+ }
55
+ sign = this.getNonStrictSign(lpVar, sign);
56
+ if (sign === 0) break;
57
+ }
58
+ if (sign !== 0 && zeroPower % 2 === 0) sign = 0;
59
+ if (sign === 0) this.addTrivialZeroLemma(zeroVar, monic);
60
+ else this.generateStrictCaseZeroLemma(monic, zeroVar, sign);
61
+ for (const lpVar of fixedZeros) this.addFixedZeroLemma(monic, lpVar);
62
+ }
63
+
64
+ // try_get_non_strict_sign_from_bounds and get_non_strict_sign: the sign times the sign of the
65
+ // variable, from its value or else its bounds, or 0.
66
+ private getNonStrictSign(lpVar: number, sign: number) {
67
+ const core = this.core;
68
+ const value = core.val(lpVar);
69
+ if (!value.isZero()) return sign * getRatSign(value);
70
+ if (core.hasLowerBound(lpVar) && !core.getLowerBound(lpVar).isNegative()) return sign;
71
+ if (core.hasUpperBound(lpVar) && !core.getUpperBound(lpVar).isPositive()) return -sign;
72
+ return 0;
73
+ }
74
+
75
+ private basicSignLemmaModelBasedOneMon(monic: Monic, productSign: number) {
76
+ if (productSign === 0) {
77
+ this.generateZeroLemmas(monic);
78
+ return;
79
+ }
80
+ const lemma = new LemmaBuilder(this.core);
81
+ for (const lpVar of monic.vars) this.negateStrictSign(lemma, lpVar);
82
+ lemma.addIneq(mkIneq(monic.variable, productSign === 1 ? KIND_GT : KIND_LT, 0));
83
+ }
84
+
85
+ private basicSignLemmaModelBased() {
86
+ const core = this.core;
87
+ const start = core.random();
88
+ const size = core.toRefine.size;
89
+ for (let index = size; index-- > 0;) {
90
+ const monic = core.emons.get(core.toRefine.elems[(start + index) % size]);
91
+ const productSign = core.getMonicSign(monic);
92
+ if (getRatSign(core.varVal(monic)) === productSign) continue;
93
+ this.basicSignLemmaModelBasedOneMon(monic, productSign);
94
+ if (core.done()) return true;
95
+ }
96
+ return core.lemmas.length > 0;
97
+ }
98
+
99
+ private basicSignLemmaOnMon(lpVar: number, explored: Set<number>) {
100
+ if (explored.has(lpVar)) return false;
101
+ explored.add(lpVar);
102
+ const core = this.core;
103
+ const monic = core.emons.get(lpVar);
104
+ for (const other of core.emons.getSignEquivMonics(monic))
105
+ if (
106
+ monic.variable !== other.variable &&
107
+ this.basicSignLemmaOnTwoMonics(monic, other) &&
108
+ core.done()
109
+ )
110
+ return true;
111
+ return false;
112
+ }
113
+
114
+ private basicSignLemma(isDerived: boolean) {
115
+ if (!isDerived) return this.basicSignLemmaModelBased();
116
+ const explored = new Set<number>();
117
+ for (const lpVar of this.core.toRefine.elems)
118
+ if (this.basicSignLemmaOnMon(lpVar, explored)) return true;
119
+ return false;
120
+ }
121
+
122
+ private generateSignLemma(first: Monic, second: Monic, sign: Rational) {
123
+ const lemma = new LemmaBuilder(this.core);
124
+ lemma.addIneq(
125
+ mkIneq(
126
+ new LarTerm([
127
+ [first.variable, Rational.one],
128
+ [second.variable, sign.neg()],
129
+ ]),
130
+ KIND_EQ,
131
+ 0,
132
+ ),
133
+ );
134
+ lemma.explainMonic(first);
135
+ lemma.explainMonic(second);
136
+ }
137
+
138
+ // Zeros.
139
+
140
+ // find_best_zero: a variable of value 0, preferably with 0 inside its bounds, and the variables
141
+ // fixed to 0.
142
+ private findBestZero(monic: Monic, fixedZeros: number[]) {
143
+ const core = this.core;
144
+ let zeroVar = -1;
145
+ for (const lpVar of monic.vars) {
146
+ if (!core.val(lpVar).isZero()) continue;
147
+ if (core.varIsFixedToZero(lpVar)) fixedZeros.push(lpVar);
148
+ if (zeroVar === -1 || core.zeroIsAnInnerPointOfBounds(lpVar)) zeroVar = lpVar;
149
+ }
150
+ return zeroVar;
151
+ }
152
+
153
+ private addTrivialZeroLemma(zeroVar: number, monic: Monic) {
154
+ const lemma = new LemmaBuilder(this.core);
155
+ lemma.addIneq(mkIneq(zeroVar, KIND_NE, 0));
156
+ lemma.addIneq(mkIneq(monic.variable, KIND_EQ, 0));
157
+ }
158
+
159
+ private generateStrictCaseZeroLemma(monic: Monic, zeroVar: number, zeroSign: number) {
160
+ const lemma = new LemmaBuilder(this.core);
161
+ lemma.addIneq(mkIneq(zeroVar, zeroSign === 1 ? KIND_GT : KIND_LT, 0));
162
+ for (const lpVar of monic.vars) if (lpVar !== zeroVar) this.negateStrictSign(lemma, lpVar);
163
+ this.negateStrictSign(lemma, monic.variable);
164
+ }
165
+
166
+ private addFixedZeroLemma(monic: Monic, lpVar: number) {
167
+ const lemma = new LemmaBuilder(this.core);
168
+ lemma.explainFixed(lpVar);
169
+ lemma.addIneq(mkIneq(monic.variable, KIND_EQ, 0));
170
+ }
171
+
172
+ private negateStrictSign(lemma: LemmaBuilder, lpVar: number) {
173
+ const core = this.core;
174
+ const value = core.val(lpVar);
175
+ if (!value.isZero()) {
176
+ lemma.addIneq(mkIneq(lpVar, getRatSign(value) === 1 ? KIND_LE : KIND_GE, 0));
177
+ return;
178
+ }
179
+ if (core.hasLowerBound(lpVar) && !core.getLowerBound(lpVar).isNegative()) {
180
+ lemma.explainExistingLowerBound(lpVar);
181
+ lemma.addIneq(mkIneq(lpVar, KIND_GT, 0));
182
+ return;
183
+ }
184
+ lemma.explainExistingUpperBound(lpVar);
185
+ lemma.addIneq(mkIneq(lpVar, KIND_LT, 0));
186
+ }
187
+
188
+ // Model-based lemmas on the factorizations of a monic.
189
+
190
+ private basicLemmaForMonModelBased(rooted: Monic) {
191
+ const core = this.core;
192
+ const isZero = core.varVal(rooted).isZero();
193
+ for (const factorization of core.getFactorizations(rooted)) {
194
+ if (factorization.factors.length === 0) continue;
195
+ if (isZero) {
196
+ this.basicLemmaForMonZeroModelBased(rooted, factorization);
197
+ this.basicLemmaForMonNeutralModelBased(rooted, factorization);
198
+ continue;
199
+ }
200
+ this.basicLemmaForMonNonZeroModelBased(factorization);
201
+ this.basicLemmaForMonNeutralModelBased(rooted, factorization);
202
+ this.proportionLemmaModelBased(rooted, factorization);
203
+ }
204
+ }
205
+
206
+ // x != 0 or y = 0 => |xy| >= |y|
207
+ private proportionLemmaModelBased(rooted: Monic, factorization: Factorization) {
208
+ const core = this.core;
209
+ if (core.hasRealFactorization(factorization)) return;
210
+ const rootedValue = core.varVal(rooted).abs();
211
+ if (rootedValue.isZero()) return;
212
+ const factorIndex = factorization.factors.findIndex(
213
+ (factor) => core.valFactor(factor).abs().compare(rootedValue) > 0,
214
+ );
215
+ if (factorIndex !== -1) this.generatePl(rooted, factorization, factorIndex);
216
+ }
217
+
218
+ // sign_m*m < 0 or \/_{i != k} f_i = 0 or sign_m*m >= sign_k*f_k
219
+ private generatePlOnMon(monic: Monic, factorIndex: number) {
220
+ const core = this.core;
221
+ const lemma = new LemmaBuilder(core);
222
+ const monicVar = monic.variable;
223
+ const monicSign = Rational.fromNumber(getRatSign(core.val(monicVar)));
224
+ lemma.addIneq(mkIneq(new LarTerm([[monicVar, monicSign]]), KIND_LT, 0));
225
+ monic.vars.forEach((lpVar, index) => {
226
+ if (index !== factorIndex) {
227
+ lemma.addIneq(mkIneq(lpVar, KIND_EQ, 0));
228
+ return;
229
+ }
230
+ const varSign = Rational.fromNumber(getRatSign(core.val(lpVar)));
231
+ lemma.addIneq(
232
+ mkIneq(
233
+ new LarTerm([
234
+ [monicVar, monicSign],
235
+ [lpVar, varSign.neg()],
236
+ ]),
237
+ KIND_GE,
238
+ 0,
239
+ ),
240
+ );
241
+ });
242
+ }
243
+
244
+ private generatePl(monic: Monic, factorization: Factorization, factorIndex: number) {
245
+ if (factorization.mon !== null) {
246
+ this.generatePlOnMon(monic, factorIndex);
247
+ return;
248
+ }
249
+ const core = this.core;
250
+ const lemma = new LemmaBuilder(core);
251
+ const monicSign = Rational.fromNumber(getRatSign(core.varVal(monic)));
252
+ const monicVar = monic.variable;
253
+ lemma.addIneq(mkIneq(new LarTerm([[monicVar, monicSign]]), KIND_LT, 0));
254
+ factorization.factors.forEach((factor, index) => {
255
+ if (index !== factorIndex) {
256
+ lemma.addIneq(mkIneq(factor.variable, KIND_EQ, 0));
257
+ return;
258
+ }
259
+ const varSign = Rational.fromNumber(getRatSign(core.val(factor.variable)));
260
+ lemma.addIneq(
261
+ mkIneq(
262
+ new LarTerm([
263
+ [monicVar, monicSign],
264
+ [factor.variable, varSign.neg()],
265
+ ]),
266
+ KIND_GE,
267
+ 0,
268
+ ),
269
+ );
270
+ });
271
+ lemma.explainFactorization(factorization);
272
+ lemma.explainMonic(monic);
273
+ }
274
+
275
+ private isSeparatedFromZero(factorization: Factorization) {
276
+ const core = this.core;
277
+ return factorization.factors.every(
278
+ (factor) =>
279
+ core.varHasPositiveLowerBound(factor.variable) ||
280
+ core.varHasNegativeUpperBound(factor.variable),
281
+ );
282
+ }
283
+
284
+ // xy = 0 -> x = 0 or y = 0
285
+ private basicLemmaForMonZeroModelBased(rooted: Monic, factorization: Factorization) {
286
+ const lemma = new LemmaBuilder(this.core);
287
+ lemma.addIneq(mkIneq(rooted.variable, KIND_NE, 0));
288
+ if (!this.isSeparatedFromZero(factorization))
289
+ for (const factor of factorization.factors)
290
+ lemma.addIneq(mkIneq(factor.variable, KIND_EQ, 0));
291
+ else
292
+ for (const factor of factorization.factors)
293
+ lemma.explainVarSeparatedFromZero(factor.variable);
294
+ lemma.explainFactorization(factorization);
295
+ }
296
+
297
+ // /\_{j != i} f_j = val(f_j) => m = sign * f_i, or /\_j f_j = val(f_j) => m = sign, over the
298
+ // variables of a monic.
299
+ private basicLemmaForMonNeutralFromFactorsToMonicModelBasedFm(monic: Monic) {
300
+ const core = this.core;
301
+ const neutral = this.getNeutralNotOne(
302
+ monic,
303
+ monic.vars.map((lpVar) => ({ variable: lpVar, value: core.val(lpVar) })),
304
+ );
305
+ if (neutral === undefined) return;
306
+ const lemma = new LemmaBuilder(core);
307
+ for (const lpVar of monic.vars)
308
+ if (neutral.notOne !== lpVar) lemma.addIneq(mkIneq(lpVar, KIND_NE, core.val(lpVar)));
309
+ this.addNeutralConclusion(lemma, monic, neutral.notOne, neutral.sign);
310
+ }
311
+
312
+ private addNeutralConclusion(lemma: LemmaBuilder, monic: Monic, notOne: number, sign: Rational) {
313
+ if (notOne === -1) {
314
+ lemma.addIneq(mkIneq(monic.variable, KIND_EQ, sign));
315
+ return;
316
+ }
317
+ lemma.addIneq(
318
+ mkIneq(
319
+ new LarTerm([
320
+ [monic.variable, Rational.one],
321
+ [notOne, sign.neg()],
322
+ ]),
323
+ KIND_EQ,
324
+ 0,
325
+ ),
326
+ );
327
+ }
328
+
329
+ // basic_lemma_for_mon_neutral_monic_to_factor_model_based tests `j == null_lpvar` for the factor
330
+ // equal to the monic in absolute value, which no factor's variable is, so it never makes a
331
+ // lemma (nla_basics_lemmas.cpp, the loop over f).
332
+ private basicLemmaForMonNeutralModelBased(rooted: Monic, factorization: Factorization) {
333
+ if (factorization.mon !== null)
334
+ this.basicLemmaForMonNeutralFromFactorsToMonicModelBasedFm(factorization.mon);
335
+ else this.basicLemmaForMonNeutralFromFactorsToMonicModelBased(rooted, factorization);
336
+ }
337
+
338
+ // can_create_lemma_for_mon_neutral_from_factors_to_monic_model_based: the one factor whose
339
+ // value is not +-1, or -1 when there is none, and the product of the other values, when the
340
+ // monic's value disagrees with them.
341
+ private getNeutralNotOne(monic: Monic, factors: FactorValue[]) {
342
+ let sign = Rational.one;
343
+ let notOne = -1;
344
+ for (const factor of factors) {
345
+ if (factor.value.equals(Rational.one)) continue;
346
+ if (factor.value.equals(Rational.minusOne)) {
347
+ sign = sign.neg();
348
+ continue;
349
+ }
350
+ if (notOne === -1) {
351
+ notOne = factor.variable;
352
+ continue;
353
+ }
354
+ return undefined;
355
+ }
356
+ const monicValue = this.core.varVal(monic);
357
+ if (notOne === -1 && monicValue.equals(sign)) return undefined;
358
+ if (notOne !== -1 && monicValue.equals(this.core.val(notOne).mul(sign))) return undefined;
359
+ return { notOne, sign };
360
+ }
361
+
362
+ private basicLemmaForMonNeutralFromFactorsToMonicModelBased(
363
+ monic: Monic,
364
+ factorization: Factorization,
365
+ ) {
366
+ const core = this.core;
367
+ const neutral = this.getNeutralNotOne(
368
+ monic,
369
+ factorization.factors.map((factor) => ({
370
+ variable: factor.variable,
371
+ value: core.valFactor(factor),
372
+ })),
373
+ );
374
+ if (neutral === undefined) return;
375
+ if (factorization.factors.some((factor) => factor.isNegated)) return;
376
+ const lemma = new LemmaBuilder(core);
377
+ for (const factor of factorization.factors) {
378
+ if (neutral.notOne === factor.variable) continue;
379
+ lemma.addIneq(mkIneq(factor.variable, KIND_NE, core.val(factor.variable)));
380
+ }
381
+ this.addNeutralConclusion(lemma, monic, neutral.notOne, neutral.sign);
382
+ lemma.explainMonic(monic);
383
+ lemma.explainFactorization(factorization);
384
+ }
385
+
386
+ // x = 0 or y = 0 -> xy = 0
387
+ private basicLemmaForMonNonZeroModelBased(factorization: Factorization) {
388
+ const monic = factorization.mon;
389
+ if (monic === null) return;
390
+ const core = this.core;
391
+ const zero = factorization.factors.find((factor) => core.valFactor(factor).isZero());
392
+ if (zero === undefined) return;
393
+ const lemma = new LemmaBuilder(core);
394
+ lemma.addIneq(mkIneq(zero.variable, KIND_NE, 0));
395
+ lemma.addIneq(mkIneq(monic.variable, KIND_EQ, 0));
396
+ lemma.explainFactorization(factorization);
397
+ }
398
+ }