tla-ts 0.0.4-dev.6dec595 → 0.0.4-dev.7b5087a

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 (307) hide show
  1. package/README.md +27 -141
  2. package/dist/deciders.cjs +366 -0
  3. package/dist/deciders.js +366 -0
  4. package/dist/index.cjs +1 -1
  5. package/dist/index.d.cts +35 -1
  6. package/dist/index.d.ts +35 -1
  7. package/dist/index.js +1 -1
  8. package/dist/parallel-worker.cjs +1 -4
  9. package/dist/parallel-worker.js +1 -4
  10. package/dist/prove-worker.cjs +9 -0
  11. package/dist/prove-worker.d.cts +9 -0
  12. package/dist/prove-worker.d.ts +9 -0
  13. package/dist/prove-worker.js +9 -0
  14. package/dist/prove.cjs +996 -0
  15. package/dist/prove.js +996 -0
  16. package/dist/run-cli.cjs +517 -47
  17. package/dist/run-cli.js +517 -47
  18. package/dist/tlapm.cjs +10 -0
  19. package/dist/tlapm.js +10 -0
  20. package/dist/transfer.cjs +38 -44
  21. package/dist/transfer.js +38 -44
  22. package/dist/worker.cjs +21 -0
  23. package/dist/worker.js +21 -0
  24. package/package.json +21 -12
  25. package/src/errors.ts +86 -0
  26. package/src/evaluate.ts +28 -7
  27. package/src/index.ts +10 -0
  28. package/src/{obligation-action.ts → obligations/action.ts} +258 -37
  29. package/src/{obligation-anon.ts → obligations/anon.ts} +13 -7
  30. package/src/obligations/ctx.ts +64 -0
  31. package/src/{obligation-deref.ts → obligations/deref.ts} +2 -2
  32. package/src/{obligation-expression.ts → obligations/expression.ts} +54 -8
  33. package/src/{obligation-format.ts → obligations/format.ts} +6 -5
  34. package/src/{obligation-generate.ts → obligations/generate.ts} +134 -61
  35. package/src/{obligations.ts → obligations/index.ts} +28 -12
  36. package/src/{obligation-levels.ts → obligations/levels.ts} +12 -2
  37. package/src/{obligation-module.ts → obligations/module.ts} +46 -20
  38. package/src/obligations/pickle.ts +100 -0
  39. package/src/obligations/pragma.ts +189 -0
  40. package/src/{obligation-printer.ts → obligations/printer.ts} +9 -63
  41. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
  42. package/src/{obligation-source.ts → obligations/source.ts} +91 -35
  43. package/src/obligations/temporal.ts +319 -0
  44. package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
  45. package/src/ocaml-marshal.ts +172 -0
  46. package/src/parallel-worker.ts +2 -18
  47. package/src/parallel.ts +10 -43
  48. package/src/prove/decide-pool.ts +100 -0
  49. package/src/prove/deciders.ts +33 -0
  50. package/src/prove/isabelle/LICENSE +36 -0
  51. package/src/prove/isabelle/LICENSE-tlapm +26 -0
  52. package/src/prove/isabelle/decide.ts +47 -0
  53. package/src/prove/isabelle/encode.ts +512 -0
  54. package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
  55. package/src/prove/isabelle/isar/method.ts +367 -0
  56. package/src/prove/isabelle/isar/proof.ts +28 -0
  57. package/src/prove/isabelle/isar/statement.ts +57 -0
  58. package/src/prove/isabelle/isar/theory.ts +192 -0
  59. package/src/prove/isabelle/isar/type-check.ts +278 -0
  60. package/src/prove/isabelle/provers/blast/blast.ts +258 -0
  61. package/src/prove/isabelle/provers/blast/branch.ts +322 -0
  62. package/src/prove/isabelle/provers/blast/prove.ts +347 -0
  63. package/src/prove/isabelle/provers/blast/rules.ts +330 -0
  64. package/src/prove/isabelle/provers/blast/state.ts +180 -0
  65. package/src/prove/isabelle/provers/blast/term.ts +547 -0
  66. package/src/prove/isabelle/provers/clasimp.ts +150 -0
  67. package/src/prove/isabelle/provers/classical.ts +389 -0
  68. package/src/prove/isabelle/provers/hypsubst.ts +441 -0
  69. package/src/prove/isabelle/pure/bicompose.ts +174 -0
  70. package/src/prove/isabelle/pure/consts.ts +32 -0
  71. package/src/prove/isabelle/pure/conv.ts +79 -0
  72. package/src/prove/isabelle/pure/drule.ts +264 -0
  73. package/src/prove/isabelle/pure/envir.ts +363 -0
  74. package/src/prove/isabelle/pure/goal.ts +53 -0
  75. package/src/prove/isabelle/pure/interrupt.ts +16 -0
  76. package/src/prove/isabelle/pure/list.ts +12 -0
  77. package/src/prove/isabelle/pure/logic.ts +402 -0
  78. package/src/prove/isabelle/pure/name.ts +110 -0
  79. package/src/prove/isabelle/pure/net.ts +262 -0
  80. package/src/prove/isabelle/pure/object-logic.ts +41 -0
  81. package/src/prove/isabelle/pure/pattern.ts +650 -0
  82. package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
  83. package/src/prove/isabelle/pure/rewriter.ts +602 -0
  84. package/src/prove/isabelle/pure/search.ts +68 -0
  85. package/src/prove/isabelle/pure/seq.ts +156 -0
  86. package/src/prove/isabelle/pure/simplifier.ts +112 -0
  87. package/src/prove/isabelle/pure/table.ts +208 -0
  88. package/src/prove/isabelle/pure/tactic.ts +276 -0
  89. package/src/prove/isabelle/pure/tactical.ts +347 -0
  90. package/src/prove/isabelle/pure/term-ord.ts +159 -0
  91. package/src/prove/isabelle/pure/term.ts +808 -0
  92. package/src/prove/isabelle/pure/thm.ts +806 -0
  93. package/src/prove/isabelle/pure/type.ts +133 -0
  94. package/src/prove/isabelle/pure/unify.ts +753 -0
  95. package/src/prove/isabelle/pure/variable.ts +25 -0
  96. package/src/prove/isabelle/tla/classical-setup.ts +101 -0
  97. package/src/prove/isabelle/tla/context.ts +74 -0
  98. package/src/prove/isabelle/tla/logic-data.ts +5 -0
  99. package/src/prove/isabelle/tla/logic.ts +215 -0
  100. package/src/prove/isabelle/tla/simpdata.ts +241 -0
  101. package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
  102. package/src/prove/ocaml.ts +22 -0
  103. package/src/prove/prep/action.ts +520 -0
  104. package/src/prove/prep/defs.ts +33 -0
  105. package/src/prove/prep/elab.ts +156 -0
  106. package/src/prove/prep/enabled-axioms.ts +189 -0
  107. package/src/prove/prep/enabled.ts +43 -0
  108. package/src/prove/prep/fingerprint.ts +388 -0
  109. package/src/prove/prep/flatten.ts +70 -0
  110. package/src/prove/prep/level-comparison.ts +552 -0
  111. package/src/prove/prep/md5.ts +67 -0
  112. package/src/prove/prep/pragma.ts +221 -0
  113. package/src/prove/prep/trivial.ts +22 -0
  114. package/src/prove/prove-worker.ts +27 -0
  115. package/src/prove/prove.ts +528 -0
  116. package/src/prove/ptl/decide.ts +68 -0
  117. package/src/prove/ptl/encode.ts +256 -0
  118. package/src/prove/ptl/sat.ts +151 -0
  119. package/src/prove/ptl/tableau.ts +276 -0
  120. package/src/prove/smt/axiomatize.ts +69 -0
  121. package/src/prove/smt/axioms.ts +210 -0
  122. package/src/prove/smt/context.ts +108 -0
  123. package/src/prove/smt/data.ts +665 -0
  124. package/src/prove/smt/encode.ts +169 -0
  125. package/src/prove/smt/extensionality.ts +63 -0
  126. package/src/prove/smt/flatten.ts +127 -0
  127. package/src/prove/smt/format.ts +143 -0
  128. package/src/prove/smt/instances.ts +182 -0
  129. package/src/prove/smt/rewrite.ts +784 -0
  130. package/src/prove/smt/simplify.ts +57 -0
  131. package/src/prove/smt/solver/act-cache.ts +265 -0
  132. package/src/prove/smt/solver/arith-rewriter.ts +962 -0
  133. package/src/prove/smt/solver/array.ts +22 -0
  134. package/src/prove/smt/solver/asserted-formulas.ts +469 -0
  135. package/src/prove/smt/solver/ast-lt.ts +157 -0
  136. package/src/prove/smt/solver/ast-util.ts +147 -0
  137. package/src/prove/smt/solver/ast.ts +1315 -0
  138. package/src/prove/smt/solver/auf-solver.ts +572 -0
  139. package/src/prove/smt/solver/case-split-queue.ts +178 -0
  140. package/src/prove/smt/solver/cg-table.ts +175 -0
  141. package/src/prove/smt/solver/clause.ts +276 -0
  142. package/src/prove/smt/solver/conflict-resolution.ts +343 -0
  143. package/src/prove/smt/solver/context.ts +1292 -0
  144. package/src/prove/smt/solver/ctx-simplify.ts +334 -0
  145. package/src/prove/smt/solver/der.ts +224 -0
  146. package/src/prove/smt/solver/dyn-ack.ts +141 -0
  147. package/src/prove/smt/solver/e-matching.ts +659 -0
  148. package/src/prove/smt/solver/enode.ts +259 -0
  149. package/src/prove/smt/solver/expr-ref.ts +21 -0
  150. package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
  151. package/src/prove/smt/solver/fingerprints.ts +92 -0
  152. package/src/prove/smt/solver/flat-literals.ts +51 -0
  153. package/src/prove/smt/solver/goal.ts +138 -0
  154. package/src/prove/smt/solver/hash.ts +173 -0
  155. package/src/prove/smt/solver/hashtable.ts +166 -0
  156. package/src/prove/smt/solver/internalizer.ts +1381 -0
  157. package/src/prove/smt/solver/lbool.ts +5 -0
  158. package/src/prove/smt/solver/literal.ts +24 -0
  159. package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
  160. package/src/prove/smt/solver/lp/constraints.ts +78 -0
  161. package/src/prove/smt/solver/lp/containers.ts +296 -0
  162. package/src/prove/smt/solver/lp/core-solver.ts +504 -0
  163. package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
  164. package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
  165. package/src/prove/smt/solver/lp/dependency.ts +51 -0
  166. package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
  167. package/src/prove/smt/solver/lp/explanation.ts +46 -0
  168. package/src/prove/smt/solver/lp/gomory.ts +255 -0
  169. package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
  170. package/src/prove/smt/solver/lp/hnf.ts +281 -0
  171. package/src/prove/smt/solver/lp/int-cube.ts +295 -0
  172. package/src/prove/smt/solver/lp/int-solver.ts +514 -0
  173. package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
  174. package/src/prove/smt/solver/lp/lar-term.ts +62 -0
  175. package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
  176. package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
  177. package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
  178. package/src/prove/smt/solver/lp/nex.ts +120 -0
  179. package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
  180. package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
  181. package/src/prove/smt/solver/lp/nla-core.ts +968 -0
  182. package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
  183. package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
  184. package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
  185. package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
  186. package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
  187. package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
  188. package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  189. package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
  190. package/src/prove/smt/solver/lp/nla-order.ts +307 -0
  191. package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
  192. package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
  193. package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
  194. package/src/prove/smt/solver/lp/nla-types.ts +124 -0
  195. package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
  196. package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
  197. package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
  198. package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
  199. package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
  200. package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
  201. package/src/prove/smt/solver/lp/pdd.ts +971 -0
  202. package/src/prove/smt/solver/lp/random-updater.ts +138 -0
  203. package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
  204. package/src/prove/smt/solver/lp/union-find.ts +96 -0
  205. package/src/prove/smt/solver/mam-compiler.ts +847 -0
  206. package/src/prove/smt/solver/mam-interpreter.ts +400 -0
  207. package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
  208. package/src/prove/smt/solver/model-checker.ts +347 -0
  209. package/src/prove/smt/solver/model-evaluator.ts +262 -0
  210. package/src/prove/smt/solver/model-finder.ts +155 -0
  211. package/src/prove/smt/solver/model-generator.ts +97 -0
  212. package/src/prove/smt/solver/model-macro-solver.ts +728 -0
  213. package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
  214. package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
  215. package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
  216. package/src/prove/smt/solver/nlsat/explain.ts +607 -0
  217. package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
  218. package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
  219. package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
  220. package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
  221. package/src/prove/smt/solver/nlsat/solver.ts +911 -0
  222. package/src/prove/smt/solver/nlsat/types.ts +43 -0
  223. package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  224. package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
  225. package/src/prove/smt/solver/nnf.ts +469 -0
  226. package/src/prove/smt/solver/pattern-inference.ts +351 -0
  227. package/src/prove/smt/solver/poly-rewriter.ts +477 -0
  228. package/src/prove/smt/solver/propagate-values.ts +83 -0
  229. package/src/prove/smt/solver/proto-model.ts +551 -0
  230. package/src/prove/smt/solver/pull-quant.ts +139 -0
  231. package/src/prove/smt/solver/qe-lite-der.ts +526 -0
  232. package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
  233. package/src/prove/smt/solver/qe-lite.ts +381 -0
  234. package/src/prove/smt/solver/qi-queue.ts +362 -0
  235. package/src/prove/smt/solver/quant-tactics.ts +117 -0
  236. package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
  237. package/src/prove/smt/solver/quantifier-manager.ts +186 -0
  238. package/src/prove/smt/solver/random-gen.ts +10 -0
  239. package/src/prove/smt/solver/rational.ts +165 -0
  240. package/src/prove/smt/solver/ref-vector.ts +62 -0
  241. package/src/prove/smt/solver/relevancy.ts +247 -0
  242. package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
  243. package/src/prove/smt/solver/rewriter.ts +843 -0
  244. package/src/prove/smt/solver/rlimit.ts +79 -0
  245. package/src/prove/smt/solver/smtlib-parser.ts +526 -0
  246. package/src/prove/smt/solver/solver.ts +71 -0
  247. package/src/prove/smt/solver/sort.ts +35 -0
  248. package/src/prove/smt/solver/sticky-generations.ts +69 -0
  249. package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
  250. package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
  251. package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
  252. package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
  253. package/src/prove/smt/solver/theory-lra-model.ts +243 -0
  254. package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
  255. package/src/prove/smt/solver/theory-lra-state.ts +43 -0
  256. package/src/prove/smt/solver/theory-lra.ts +56 -0
  257. package/src/prove/smt/solver/var-subst.ts +258 -0
  258. package/src/prove/smt/solver/z3-license.txt +10 -0
  259. package/src/prove/smt/table.ts +170 -0
  260. package/src/prove/tlapm/tlapm.ts +97 -0
  261. package/src/prove/tlaps-module.ts +510 -0
  262. package/src/prove/verdict.ts +19 -0
  263. package/src/prove/zenon/LICENSE +32 -0
  264. package/src/prove/zenon/check/check.ts +105 -0
  265. package/src/prove/zenon/check/definitions.ts +144 -0
  266. package/src/prove/zenon/check/equality.ts +182 -0
  267. package/src/prove/zenon/check/functions.ts +62 -0
  268. package/src/prove/zenon/check/keys.ts +125 -0
  269. package/src/prove/zenon/check/propositional.ts +104 -0
  270. package/src/prove/zenon/check/records.ts +188 -0
  271. package/src/prove/zenon/check/relations.ts +121 -0
  272. package/src/prove/zenon/check/rewrites.ts +224 -0
  273. package/src/prove/zenon/check/sets.ts +302 -0
  274. package/src/prove/zenon/check/terms.ts +127 -0
  275. package/src/prove/zenon/check/tla.ts +126 -0
  276. package/src/prove/zenon/decide.ts +113 -0
  277. package/src/prove/zenon/encode.ts +444 -0
  278. package/src/prove/zenon/eqrel.ts +300 -0
  279. package/src/prove/zenon/equality-rules.ts +435 -0
  280. package/src/prove/zenon/expr.ts +551 -0
  281. package/src/prove/zenon/index-table.ts +350 -0
  282. package/src/prove/zenon/isar-case.ts +513 -0
  283. package/src/prove/zenon/isar.ts +1249 -0
  284. package/src/prove/zenon/limits.ts +15 -0
  285. package/src/prove/zenon/llproof.ts +173 -0
  286. package/src/prove/zenon/mltoll.ts +1566 -0
  287. package/src/prove/zenon/node.ts +297 -0
  288. package/src/prove/zenon/ocaml.ts +169 -0
  289. package/src/prove/zenon/parse.ts +247 -0
  290. package/src/prove/zenon/phrase.ts +191 -0
  291. package/src/prove/zenon/proof.ts +198 -0
  292. package/src/prove/zenon/propositional-rules.ts +387 -0
  293. package/src/prove/zenon/rules.ts +94 -0
  294. package/src/prove/zenon/search.ts +288 -0
  295. package/src/prove/zenon/tla/functions.ts +151 -0
  296. package/src/prove/zenon/tla/llproof.ts +480 -0
  297. package/src/prove/zenon/tla/records.ts +225 -0
  298. package/src/prove/zenon/tla/rewrites.ts +447 -0
  299. package/src/prove/zenon/tla/sets.ts +304 -0
  300. package/src/prove/zenon/tla/terms.ts +181 -0
  301. package/src/prove/zenon/tla/tla.ts +506 -0
  302. package/src/run-cli.ts +338 -52
  303. package/src/tlapm-cache.ts +250 -0
  304. package/src/values.ts +8 -3
  305. package/src/worker.ts +65 -0
  306. package/dist/parallel.cjs +0 -12
  307. package/dist/parallel.js +0 -12
@@ -0,0 +1,288 @@
1
+ // Ported from Zenon's prove.ml, as shipped in tlapm. Copyright 2002 INRIA, see LICENSE.
2
+ //
3
+ // The tableau search. Each formula added to a branch suggests nodes, which wait in the queue by
4
+ // priority. The search takes the next node, and refutes each of its branches in turn. A branch is
5
+ // closed when it holds a formula and its negation. Zenon's mutually recursive search functions are
6
+ // one loop here, with an explicit stack of frames.
7
+
8
+ import { TlaZenonError } from "../../errors";
9
+ import { difference, isApp, isDisjoint, isMeta, union, type Expr } from "./expr";
10
+ import { getLimitFailure, type Limits } from "./limits";
11
+ import { EMPTY_QUEUE, getQueueHead, removeNode, type Node, type Queue } from "./node";
12
+ import { stableSort } from "./ocaml";
13
+ import type { Definition } from "./parse";
14
+ import type { Hypothesis } from "./phrase";
15
+ import type { Proof, Rule } from "./proof";
16
+ import { addNodes, type SearchContext } from "./rules";
17
+
18
+ const isTrivial = (context: SearchContext, formula: Expr) =>
19
+ formula.kind === "true" ||
20
+ (formula.kind === "not" && formula.args[0].kind === "false") ||
21
+ (formula.kind === "app" &&
22
+ formula.args.length === 2 &&
23
+ formula.args[0] === formula.args[1] &&
24
+ context.relations.isReflexive(formula.symbol));
25
+
26
+ // Zenon's reduce_list: drops the formulas a branch already has, and reverses the rest.
27
+ const reduceBranch = (context: SearchContext, branch: Expr[]) => {
28
+ const exprs = context.exprs;
29
+ const index = context.index;
30
+ const relations = context.relations;
31
+ const kept: Expr[] = [];
32
+ const isKnown = (formula: Expr) => index.isMember(formula) || kept.includes(formula);
33
+ for (const formula of branch) {
34
+ if (
35
+ formula.kind === "true" ||
36
+ (formula.kind === "not" && formula.args[0].kind === "false") ||
37
+ (formula.kind === "not" &&
38
+ isApp(formula.args[0], "TLA.in", 2) &&
39
+ formula.args[0].args[1].kind === "var" &&
40
+ formula.args[0].args[1].symbol === "TLA.emptyset")
41
+ )
42
+ continue;
43
+ const atom = formula.kind === "not" ? formula.args[0] : formula;
44
+ const isRelation = atom.kind === "app" && atom.args.length === 2;
45
+ if (
46
+ formula.kind === "app" &&
47
+ isRelation &&
48
+ formula.args[0] === formula.args[1] &&
49
+ relations.isReflexive(formula.symbol)
50
+ )
51
+ continue;
52
+ if (isRelation && relations.isSymmetric(atom.symbol)) {
53
+ const swapped = exprs.eapp(atom.symbol, [atom.args[1], atom.args[0]]);
54
+ const reversed = formula.kind === "not" ? exprs.enot(swapped) : swapped;
55
+ if (!isKnown(formula) && !isKnown(reversed)) kept.unshift(formula);
56
+ continue;
57
+ }
58
+ if (!isKnown(formula)) kept.unshift(formula);
59
+ }
60
+ return kept;
61
+ };
62
+
63
+ const isNotMetaEquality = (formula: Expr): boolean => {
64
+ if (formula.kind === "app" && formula.args.length === 2 && formula.symbol === "=")
65
+ return !isMeta(formula.args[0]) && !isMeta(formula.args[1]);
66
+ if (formula.kind === "app" && formula.args.length === 3 && formula.args[0].kind === "var")
67
+ return !(formula.args[0].symbol === "_" && isMeta(formula.args[1]));
68
+ if (formula.kind === "app" && formula.args.length === 2) return !isMeta(formula.args[1]);
69
+ if (formula.kind === "and" || formula.kind === "or")
70
+ return isNotMetaEquality(formula.args[0]) || isNotMetaEquality(formula.args[1]);
71
+ return true;
72
+ };
73
+
74
+ const isNotTrivial = (formula: Expr): boolean => {
75
+ if (formula.kind === "not" && isApp(formula.args[0], "=", 2)) {
76
+ const atom = formula.args[0];
77
+ return !isMeta(atom.args[0]) && !isMeta(atom.args[1]);
78
+ }
79
+ if (formula.kind === "not" && isApp(formula.args[0], "TLA.in", 2)) {
80
+ const atom = formula.args[0];
81
+ if (isMeta(atom.args[0]) && atom.args[1].kind === "var")
82
+ return atom.args[1].symbol === "TLA.emptyset";
83
+ return true;
84
+ }
85
+ if (formula.kind === "and" || formula.kind === "or")
86
+ return isNotTrivial(formula.args[0]) || isNotTrivial(formula.args[1]);
87
+ return true;
88
+ };
89
+
90
+ const countMetas = (formulas: Expr[]) => {
91
+ const metas = new Set(formulas.filter(isNotMetaEquality).flatMap((formula) => formula.metas));
92
+ return [...metas].filter((meta) => meta.metas.length === 0).length;
93
+ };
94
+
95
+ type BranchState = "open" | Proof;
96
+
97
+ const findOpenBranch = (searchNode: Node, states: BranchState[]) => {
98
+ const last = states.length - 1;
99
+ if (last < 0) return undefined;
100
+ if (states[last] === "open" && searchNode.branches[last].some(isNotMetaEquality)) return last;
101
+ const open: number[] = [];
102
+ for (let index = 0; index <= last; index++) if (states[index] === "open") open.push(index);
103
+ if (open.length <= 1) return open[0];
104
+ const scores = open
105
+ .map((index) => {
106
+ const formulas = searchNode.branches[index];
107
+ return {
108
+ index,
109
+ nontrivial: formulas.filter(isNotTrivial).length,
110
+ metas: countMetas(formulas),
111
+ size: formulas.reduce((total, formula) => total + formula.size, 0),
112
+ };
113
+ })
114
+ .reverse();
115
+ const sorted = stableSort(scores, (left, right) => {
116
+ if (left.nontrivial === 0) return 1;
117
+ if (right.nontrivial === 0) return -1;
118
+ if (left.metas !== right.metas) return right.metas - left.metas;
119
+ return left.size - right.size;
120
+ });
121
+ return sorted[0].index;
122
+ };
123
+
124
+ const isGoodLemma = (rule: Rule) =>
125
+ rule.name !== "close" &&
126
+ rule.name !== "close_refl" &&
127
+ rule.name !== "close_sym" &&
128
+ rule.name !== "false" &&
129
+ rule.name !== "not_true";
130
+
131
+ interface Frame {
132
+ node: Node;
133
+ queue: Queue;
134
+ states: BranchState[];
135
+ current: number;
136
+ }
137
+
138
+ export interface SearchStatistics {
139
+ inferences: number;
140
+ proofNodes: number;
141
+ // The proofs that closed another branch from the lemma cache. Zenon counts the uses in mlrefc and
142
+ // prints each of these proofs once, as a lemma.
143
+ reusedProofs: Set<Proof>;
144
+ }
145
+
146
+ export type SearchFailure = "exhausted" | "time limit" | "memory limit" | "aborted";
147
+
148
+ // Zenon gives up once its heap passes 1 GB. The port bounds the nodes that the queues of the
149
+ // current branch hold instead. On the corpus files where Zenon runs out of memory, its heap passes
150
+ // 1 GB with 1.9 to 5.5 million of them, and no proof that Zenon finds needs more than 1.3 million.
151
+ const MAX_QUEUED_NODES = 1_900_000;
152
+
153
+ // The proof of the hypotheses' inconsistency, or why the search gave up.
154
+ export const search = (
155
+ context: SearchContext,
156
+ definitions: Definition[],
157
+ hypotheses: Hypothesis[],
158
+ limits: Limits,
159
+ statistics: SearchStatistics,
160
+ ): Proof | SearchFailure => {
161
+ const index = context.index;
162
+ definitions.forEach(index.addDefinition);
163
+ const initial: [Expr, number][] = [];
164
+ for (const hypothesis of hypotheses)
165
+ if (!initial.some((entry) => entry[0] === hypothesis.formula))
166
+ initial.unshift([hypothesis.formula, hypothesis.goalness]);
167
+
168
+ const stack: Frame[] = [];
169
+ let forms = initial;
170
+ let formIndex = 0;
171
+ let queue = EMPTY_QUEUE;
172
+
173
+ const makeResult = (searchNode: Node, states: BranchState[]): Proof => {
174
+ let conclusions: Expr[] = [];
175
+ const subproofs: Proof[] = [];
176
+ states.forEach((state, branchIndex) => {
177
+ if (state === "open") throw new TlaZenonError("Zenon: an open branch in a closed node");
178
+ subproofs.push(state);
179
+ conclusions = union(
180
+ difference(state.conclusions, searchNode.branches[branchIndex]),
181
+ conclusions,
182
+ );
183
+ });
184
+ statistics.proofNodes++;
185
+ const proof: Proof = {
186
+ conclusions: union(searchNode.conclusions, conclusions),
187
+ rule: searchNode.rule,
188
+ uses: searchNode.conclusions,
189
+ subproofs,
190
+ };
191
+ if (isGoodLemma(searchNode.rule)) index.addLemma(proof);
192
+ return proof;
193
+ };
194
+
195
+ // Zenon's next_branch and unwind: descend into the next open branch of a node, or close the node
196
+ // and pop frames until one has an open branch left.
197
+ const advance = (
198
+ searchNode: Node,
199
+ nodeQueue: Queue,
200
+ states: BranchState[],
201
+ ): Proof | undefined => {
202
+ let currentNode = searchNode;
203
+ let currentQueue = nodeQueue;
204
+ let currentStates = states;
205
+ for (;;) {
206
+ const open = findOpenBranch(currentNode, currentStates);
207
+ if (open !== undefined) {
208
+ stack.push({
209
+ node: currentNode,
210
+ queue: currentQueue,
211
+ states: currentStates,
212
+ current: open,
213
+ });
214
+ forms = currentNode.branches[open].map((formula) => [formula, currentNode.goalness]);
215
+ formIndex = 0;
216
+ queue = currentQueue;
217
+ return undefined;
218
+ }
219
+ const result = makeResult(currentNode, currentStates);
220
+ const closed = unwind(result);
221
+ if (closed !== undefined) return closed;
222
+ const frame = stack[stack.length - 1];
223
+ currentNode = frame.node;
224
+ currentQueue = frame.queue;
225
+ currentStates = frame.states;
226
+ stack.pop();
227
+ }
228
+ };
229
+
230
+ // Pops the frames that the proof closes. Returns the proof when it closes the root, and leaves the
231
+ // frame to continue on top of the stack otherwise, with the proof recorded.
232
+ const unwind = (proof: Proof): Proof | undefined => {
233
+ for (;;) {
234
+ const frame = stack.pop();
235
+ if (frame === undefined) return proof;
236
+ const branch = frame.node.branches[frame.current];
237
+ for (let position = branch.length - 1; position >= 0; position--)
238
+ if (index.isMember(branch[position])) index.remove(branch[position]);
239
+ if (isDisjoint(branch, proof.conclusions)) continue;
240
+ frame.states[frame.current] = proof;
241
+ stack.push(frame);
242
+ return undefined;
243
+ }
244
+ };
245
+
246
+ for (;;) {
247
+ const limitFailure = getLimitFailure(limits);
248
+ if (limitFailure !== undefined) return limitFailure;
249
+ if (queue.insertedCount > MAX_QUEUED_NODES) return "memory limit";
250
+ if (formIndex < forms.length) {
251
+ const entry = forms[formIndex++];
252
+ const formula = entry[0];
253
+ if (isTrivial(context, formula)) continue;
254
+ index.add(formula, entry[1]);
255
+ queue = addNodes(context, queue, formula, entry[1]);
256
+ continue;
257
+ }
258
+ const head = getQueueHead(queue);
259
+ const lemma = head === undefined || isGoodLemma(head.rule) ? index.searchLemma() : undefined;
260
+ if (lemma !== undefined) {
261
+ statistics.reusedProofs.add(lemma);
262
+ const closed = unwind(lemma);
263
+ if (closed !== undefined) return closed;
264
+ const frame = stack[stack.length - 1];
265
+ stack.pop();
266
+ const result = advance(frame.node, frame.queue, frame.states);
267
+ if (result !== undefined) return result;
268
+ continue;
269
+ }
270
+ // Zenon's next_node: the next node whose branches all add something new.
271
+ for (;;) {
272
+ statistics.inferences++;
273
+ const removed = removeNode(queue);
274
+ if (removed === undefined) return "exhausted";
275
+ queue = removed[1];
276
+ const reduced = removed[0].branches.map((branch) => reduceBranch(context, branch));
277
+ if (reduced.some((branch) => branch.length === 0)) continue;
278
+ const searchNode = { ...removed[0], branches: reduced };
279
+ const result = advance(
280
+ searchNode,
281
+ queue,
282
+ reduced.map((): BranchState => "open"),
283
+ );
284
+ if (result !== undefined) return result;
285
+ break;
286
+ }
287
+ }
288
+ };
@@ -0,0 +1,151 @@
1
+ // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
+ //
3
+ // The rules for functions: membership in a function set, isAFcn and function equality.
4
+
5
+ import { isApp, type Expr } from "../expr";
6
+ import type { Priority } from "../node";
7
+ import { makeRule, type Rule } from "../proof";
8
+ import {
9
+ domain,
10
+ equal,
11
+ fapply,
12
+ FUNCTION_CONSTRUCTORS,
13
+ isConstructor,
14
+ makeExtensionNode,
15
+ member,
16
+ type Item,
17
+ type Literal,
18
+ } from "./terms";
19
+
20
+ export const getFunctionSetNodes = (literal: Literal): Item[] | undefined => {
21
+ const exprs = literal.context.exprs;
22
+ const formula = literal.formula;
23
+ const isNegated = literal.isNegated;
24
+ const relation = literal.relation;
25
+ const node = (priority: Priority, rule: Rule, branches: Expr[][]) =>
26
+ makeExtensionNode(literal, priority, rule, branches);
27
+ if (relation?.symbol === "TLA.in") {
28
+ const element = relation.args[0];
29
+ const set = relation.args[1];
30
+ if (isApp(set, "TLA.FuncSet", 2)) {
31
+ const fcn = element;
32
+ const source = set.args[0];
33
+ const target = set.args[1];
34
+ const isFcn = exprs.eapp("TLA.isAFcn", [fcn]);
35
+ const hasDomain = equal(exprs, domain(exprs, fcn), source);
36
+ const bound = exprs.newVar();
37
+ const maps = exprs.eall(
38
+ bound,
39
+ "",
40
+ exprs.eimply(
41
+ member(exprs, bound, source),
42
+ member(exprs, fapply(exprs, fcn, bound), target),
43
+ ),
44
+ );
45
+ if (!isNegated) {
46
+ const rule = makeRule("in_funcset", [formula, isFcn, hasDomain, maps, fcn, source, target]);
47
+ return [
48
+ ...node("arity", rule, [[isFcn, hasDomain]]),
49
+ ...node({ instance: maps }, rule, [[isFcn, hasDomain, maps]]),
50
+ ];
51
+ }
52
+ const notFcn = exprs.enot(isFcn);
53
+ const notDomain = exprs.enot(hasDomain);
54
+ const notMaps = exprs.enot(maps);
55
+ const priority: Priority =
56
+ fcn.kind === "app" && FUNCTION_CONSTRUCTORS.includes(fcn.symbol)
57
+ ? "arity"
58
+ : { instance: notMaps };
59
+ const shortcut = isApp(fcn, "TLA.except", 3)
60
+ ? node(
61
+ "arity",
62
+ makeRule("except_notin_funcset", [
63
+ formula,
64
+ exprs.enot(member(exprs, fcn.args[0], exprs.eapp("TLA.FuncSet", [source, target]))),
65
+ exprs.enot(member(exprs, fcn.args[2], target)),
66
+ fcn.args[0],
67
+ fcn.args[1],
68
+ fcn.args[2],
69
+ source,
70
+ target,
71
+ ]),
72
+ [
73
+ [exprs.enot(member(exprs, fcn.args[0], exprs.eapp("TLA.FuncSet", [source, target])))],
74
+ [exprs.enot(member(exprs, fcn.args[2], target))],
75
+ ],
76
+ )
77
+ : [];
78
+ return [
79
+ ...shortcut,
80
+ ...node(
81
+ priority,
82
+ makeRule("notin_funcset", [formula, notFcn, notDomain, notMaps, fcn, source, target]),
83
+ [[notFcn], [notDomain], [notMaps]],
84
+ ),
85
+ ];
86
+ }
87
+ }
88
+ return undefined;
89
+ };
90
+
91
+ export const getFunctionNodes = (literal: Literal): Item[] | undefined => {
92
+ const exprs = literal.context.exprs;
93
+ const formula = literal.formula;
94
+ const isNegated = literal.isNegated;
95
+ const atom = literal.atom;
96
+ const relation = literal.relation;
97
+ const node = (priority: Priority, rule: Rule, branches: Expr[][]) =>
98
+ makeExtensionNode(literal, priority, rule, branches);
99
+ if (isNegated && isApp(atom, "TLA.isAFcn", 1)) {
100
+ const fcn = atom.args[0];
101
+ if (isApp(fcn, "TLA.Fcn", 2))
102
+ return node("prop", makeRule("notisafcn_fcn", [formula, fcn.args[0], fcn.args[1]]), []);
103
+ if (isApp(fcn, "TLA.except", 3))
104
+ return node(
105
+ "prop",
106
+ makeRule("notisafcn_except", [formula, fcn.args[0], fcn.args[1], fcn.args[2]]),
107
+ [],
108
+ );
109
+ if (isApp(fcn, "TLA.oneArg", 2))
110
+ return node("prop", makeRule("notisafcn_onearg", [formula, fcn.args[0], fcn.args[1]]), []);
111
+ if (isApp(fcn, "TLA.extend", 2))
112
+ return node("prop", makeRule("notisafcn_extend", [formula, fcn.args[0], fcn.args[1]]), []);
113
+ }
114
+ if (relation?.symbol !== "=") return undefined;
115
+ const left = relation.args[0];
116
+ const right = relation.args[1];
117
+ if (isConstructor(FUNCTION_CONSTRUCTORS, left) || isConstructor(FUNCTION_CONSTRUCTORS, right)) {
118
+ const bound = exprs.newVar();
119
+ const sameDomain = equal(exprs, domain(exprs, left), domain(exprs, right));
120
+ const sameValue = equal(exprs, fapply(exprs, left, bound), fapply(exprs, right, bound));
121
+ if (!isNegated) {
122
+ const isFcn = exprs.eequiv(
123
+ exprs.eapp("TLA.isAFcn", [left]),
124
+ exprs.eapp("TLA.isAFcn", [right]),
125
+ );
126
+ const values = exprs.eall(bound, "", sameValue);
127
+ const result = exprs.eand(exprs.eand(isFcn, sameDomain), values);
128
+ return node({ instance: values }, makeRule("funequal", [formula, result, left, right]), [
129
+ [result],
130
+ ]);
131
+ }
132
+ const values = exprs.eall(
133
+ bound,
134
+ "",
135
+ exprs.eimply(member(exprs, bound, domain(exprs, right)), sameValue),
136
+ );
137
+ const result = exprs.enot(
138
+ exprs.eand(
139
+ exprs.eand(
140
+ exprs.eand(exprs.eapp("TLA.isAFcn", [left]), exprs.eapp("TLA.isAFcn", [right])),
141
+ sameDomain,
142
+ ),
143
+ values,
144
+ ),
145
+ );
146
+ return node({ instance: values }, makeRule("notfunequal", [formula, result, left, right]), [
147
+ [result],
148
+ ]);
149
+ }
150
+ return undefined;
151
+ };