tla-ts 0.0.4-dev.a0009b7 → 0.0.4-dev.c4929d7

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 (313) 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 +37 -1
  6. package/dist/index.d.ts +37 -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 +37 -47
  17. package/dist/run-cli.js +37 -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/check.ts +1 -0
  26. package/src/codegen.ts +26 -7
  27. package/src/errors.ts +86 -0
  28. package/src/evaluate.ts +63 -20
  29. package/src/index.ts +10 -0
  30. package/src/{obligation-action.ts → obligations/action.ts} +265 -55
  31. package/src/{obligation-anon.ts → obligations/anon.ts} +47 -37
  32. package/src/obligations/ctx.ts +64 -0
  33. package/src/{obligation-deref.ts → obligations/deref.ts} +38 -61
  34. package/src/{obligation-expression.ts → obligations/expression.ts} +78 -45
  35. package/src/{obligation-format.ts → obligations/format.ts} +7 -8
  36. package/src/{obligation-generate.ts → obligations/generate.ts} +147 -74
  37. package/src/{obligations.ts → obligations/index.ts} +29 -13
  38. package/src/{obligation-levels.ts → obligations/levels.ts} +14 -5
  39. package/src/{obligation-module.ts → obligations/module.ts} +56 -33
  40. package/src/obligations/pickle.ts +98 -0
  41. package/src/obligations/pragma.ts +189 -0
  42. package/src/{obligation-printer.ts → obligations/printer.ts} +22 -80
  43. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
  44. package/src/{obligation-source.ts → obligations/source.ts} +159 -97
  45. package/src/obligations/temporal.ts +319 -0
  46. package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
  47. package/src/ocaml-marshal.ts +166 -0
  48. package/src/parallel-worker.ts +2 -18
  49. package/src/parallel.ts +10 -43
  50. package/src/prove/decide-pool.ts +100 -0
  51. package/src/prove/deciders.ts +33 -0
  52. package/src/prove/isabelle/LICENSE +36 -0
  53. package/src/prove/isabelle/LICENSE-tlapm +26 -0
  54. package/src/prove/isabelle/decide.ts +47 -0
  55. package/src/prove/isabelle/encode.ts +503 -0
  56. package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
  57. package/src/prove/isabelle/isar/method.ts +367 -0
  58. package/src/prove/isabelle/isar/proof.ts +28 -0
  59. package/src/prove/isabelle/isar/statement.ts +57 -0
  60. package/src/prove/isabelle/isar/theory.ts +192 -0
  61. package/src/prove/isabelle/isar/type-check.ts +278 -0
  62. package/src/prove/isabelle/provers/blast/blast.ts +258 -0
  63. package/src/prove/isabelle/provers/blast/branch.ts +322 -0
  64. package/src/prove/isabelle/provers/blast/prove.ts +347 -0
  65. package/src/prove/isabelle/provers/blast/rules.ts +330 -0
  66. package/src/prove/isabelle/provers/blast/state.ts +180 -0
  67. package/src/prove/isabelle/provers/blast/term.ts +547 -0
  68. package/src/prove/isabelle/provers/clasimp.ts +150 -0
  69. package/src/prove/isabelle/provers/classical.ts +389 -0
  70. package/src/prove/isabelle/provers/hypsubst.ts +441 -0
  71. package/src/prove/isabelle/pure/bicompose.ts +174 -0
  72. package/src/prove/isabelle/pure/consts.ts +32 -0
  73. package/src/prove/isabelle/pure/conv.ts +79 -0
  74. package/src/prove/isabelle/pure/drule.ts +264 -0
  75. package/src/prove/isabelle/pure/envir.ts +363 -0
  76. package/src/prove/isabelle/pure/goal.ts +53 -0
  77. package/src/prove/isabelle/pure/interrupt.ts +16 -0
  78. package/src/prove/isabelle/pure/list.ts +12 -0
  79. package/src/prove/isabelle/pure/logic.ts +402 -0
  80. package/src/prove/isabelle/pure/name.ts +110 -0
  81. package/src/prove/isabelle/pure/net.ts +262 -0
  82. package/src/prove/isabelle/pure/object-logic.ts +41 -0
  83. package/src/prove/isabelle/pure/pattern.ts +650 -0
  84. package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
  85. package/src/prove/isabelle/pure/rewriter.ts +602 -0
  86. package/src/prove/isabelle/pure/search.ts +68 -0
  87. package/src/prove/isabelle/pure/seq.ts +156 -0
  88. package/src/prove/isabelle/pure/simplifier.ts +112 -0
  89. package/src/prove/isabelle/pure/table.ts +208 -0
  90. package/src/prove/isabelle/pure/tactic.ts +276 -0
  91. package/src/prove/isabelle/pure/tactical.ts +347 -0
  92. package/src/prove/isabelle/pure/term-ord.ts +159 -0
  93. package/src/prove/isabelle/pure/term.ts +808 -0
  94. package/src/prove/isabelle/pure/thm.ts +806 -0
  95. package/src/prove/isabelle/pure/type.ts +133 -0
  96. package/src/prove/isabelle/pure/unify.ts +753 -0
  97. package/src/prove/isabelle/pure/variable.ts +25 -0
  98. package/src/prove/isabelle/tla/classical-setup.ts +101 -0
  99. package/src/prove/isabelle/tla/context.ts +74 -0
  100. package/src/prove/isabelle/tla/logic-data.ts +5 -0
  101. package/src/prove/isabelle/tla/logic.ts +215 -0
  102. package/src/prove/isabelle/tla/simpdata.ts +241 -0
  103. package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
  104. package/src/prove/ocaml.ts +22 -0
  105. package/src/prove/prep/action.ts +521 -0
  106. package/src/prove/prep/defs.ts +33 -0
  107. package/src/prove/prep/elab.ts +156 -0
  108. package/src/prove/prep/enabled-axioms.ts +189 -0
  109. package/src/prove/prep/enabled.ts +43 -0
  110. package/src/prove/prep/fingerprint.ts +388 -0
  111. package/src/prove/prep/flatten.ts +70 -0
  112. package/src/prove/prep/level-comparison.ts +557 -0
  113. package/src/prove/prep/md5.ts +67 -0
  114. package/src/prove/prep/pragma.ts +221 -0
  115. package/src/prove/prep/trivial.ts +22 -0
  116. package/src/prove/prove-worker.ts +25 -0
  117. package/src/prove/prove.ts +505 -0
  118. package/src/prove/ptl/decide.ts +68 -0
  119. package/src/prove/ptl/encode.ts +256 -0
  120. package/src/prove/ptl/sat.ts +151 -0
  121. package/src/prove/ptl/tableau.ts +276 -0
  122. package/src/prove/smt/axiomatize.ts +69 -0
  123. package/src/prove/smt/axioms.ts +222 -0
  124. package/src/prove/smt/context.ts +108 -0
  125. package/src/prove/smt/data.ts +636 -0
  126. package/src/prove/smt/encode.ts +166 -0
  127. package/src/prove/smt/extensionality.ts +65 -0
  128. package/src/prove/smt/flatten.ts +112 -0
  129. package/src/prove/smt/format.ts +154 -0
  130. package/src/prove/smt/instances.ts +182 -0
  131. package/src/prove/smt/rewrite.ts +773 -0
  132. package/src/prove/smt/simplify.ts +57 -0
  133. package/src/prove/smt/solver/act-cache.ts +265 -0
  134. package/src/prove/smt/solver/arith-rewriter.ts +962 -0
  135. package/src/prove/smt/solver/array.ts +22 -0
  136. package/src/prove/smt/solver/asserted-formulas.ts +469 -0
  137. package/src/prove/smt/solver/ast-lt.ts +157 -0
  138. package/src/prove/smt/solver/ast-util.ts +147 -0
  139. package/src/prove/smt/solver/ast.ts +1315 -0
  140. package/src/prove/smt/solver/auf-solver.ts +572 -0
  141. package/src/prove/smt/solver/case-split-queue.ts +178 -0
  142. package/src/prove/smt/solver/cg-table.ts +175 -0
  143. package/src/prove/smt/solver/clause.ts +276 -0
  144. package/src/prove/smt/solver/conflict-resolution.ts +343 -0
  145. package/src/prove/smt/solver/context.ts +1292 -0
  146. package/src/prove/smt/solver/ctx-simplify.ts +334 -0
  147. package/src/prove/smt/solver/der.ts +224 -0
  148. package/src/prove/smt/solver/dyn-ack.ts +141 -0
  149. package/src/prove/smt/solver/e-matching.ts +659 -0
  150. package/src/prove/smt/solver/enode.ts +259 -0
  151. package/src/prove/smt/solver/expr-ref.ts +21 -0
  152. package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
  153. package/src/prove/smt/solver/fingerprints.ts +92 -0
  154. package/src/prove/smt/solver/flat-literals.ts +51 -0
  155. package/src/prove/smt/solver/goal.ts +138 -0
  156. package/src/prove/smt/solver/hash.ts +173 -0
  157. package/src/prove/smt/solver/hashtable.ts +166 -0
  158. package/src/prove/smt/solver/internalizer.ts +1381 -0
  159. package/src/prove/smt/solver/lbool.ts +5 -0
  160. package/src/prove/smt/solver/literal.ts +24 -0
  161. package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
  162. package/src/prove/smt/solver/lp/constraints.ts +78 -0
  163. package/src/prove/smt/solver/lp/containers.ts +296 -0
  164. package/src/prove/smt/solver/lp/core-solver.ts +504 -0
  165. package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
  166. package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
  167. package/src/prove/smt/solver/lp/dependency.ts +51 -0
  168. package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
  169. package/src/prove/smt/solver/lp/explanation.ts +46 -0
  170. package/src/prove/smt/solver/lp/gomory.ts +255 -0
  171. package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
  172. package/src/prove/smt/solver/lp/hnf.ts +281 -0
  173. package/src/prove/smt/solver/lp/int-cube.ts +295 -0
  174. package/src/prove/smt/solver/lp/int-solver.ts +514 -0
  175. package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
  176. package/src/prove/smt/solver/lp/lar-term.ts +62 -0
  177. package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
  178. package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
  179. package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
  180. package/src/prove/smt/solver/lp/nex.ts +120 -0
  181. package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
  182. package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
  183. package/src/prove/smt/solver/lp/nla-core.ts +968 -0
  184. package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
  185. package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
  186. package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
  187. package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
  188. package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
  189. package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
  190. package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  191. package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
  192. package/src/prove/smt/solver/lp/nla-order.ts +307 -0
  193. package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
  194. package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
  195. package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
  196. package/src/prove/smt/solver/lp/nla-types.ts +124 -0
  197. package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
  198. package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
  199. package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
  200. package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
  201. package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
  202. package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
  203. package/src/prove/smt/solver/lp/pdd.ts +971 -0
  204. package/src/prove/smt/solver/lp/random-updater.ts +138 -0
  205. package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
  206. package/src/prove/smt/solver/lp/union-find.ts +96 -0
  207. package/src/prove/smt/solver/mam-compiler.ts +847 -0
  208. package/src/prove/smt/solver/mam-interpreter.ts +400 -0
  209. package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
  210. package/src/prove/smt/solver/model-checker.ts +347 -0
  211. package/src/prove/smt/solver/model-evaluator.ts +262 -0
  212. package/src/prove/smt/solver/model-finder.ts +155 -0
  213. package/src/prove/smt/solver/model-generator.ts +97 -0
  214. package/src/prove/smt/solver/model-macro-solver.ts +728 -0
  215. package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
  216. package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
  217. package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
  218. package/src/prove/smt/solver/nlsat/explain.ts +607 -0
  219. package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
  220. package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
  221. package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
  222. package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
  223. package/src/prove/smt/solver/nlsat/solver.ts +911 -0
  224. package/src/prove/smt/solver/nlsat/types.ts +43 -0
  225. package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  226. package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
  227. package/src/prove/smt/solver/nnf.ts +469 -0
  228. package/src/prove/smt/solver/pattern-inference.ts +351 -0
  229. package/src/prove/smt/solver/poly-rewriter.ts +477 -0
  230. package/src/prove/smt/solver/propagate-values.ts +83 -0
  231. package/src/prove/smt/solver/proto-model.ts +551 -0
  232. package/src/prove/smt/solver/pull-quant.ts +139 -0
  233. package/src/prove/smt/solver/qe-lite-der.ts +526 -0
  234. package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
  235. package/src/prove/smt/solver/qe-lite.ts +381 -0
  236. package/src/prove/smt/solver/qi-queue.ts +362 -0
  237. package/src/prove/smt/solver/quant-tactics.ts +117 -0
  238. package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
  239. package/src/prove/smt/solver/quantifier-manager.ts +186 -0
  240. package/src/prove/smt/solver/random-gen.ts +10 -0
  241. package/src/prove/smt/solver/rational.ts +165 -0
  242. package/src/prove/smt/solver/ref-vector.ts +62 -0
  243. package/src/prove/smt/solver/relevancy.ts +247 -0
  244. package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
  245. package/src/prove/smt/solver/rewriter.ts +843 -0
  246. package/src/prove/smt/solver/rlimit.ts +79 -0
  247. package/src/prove/smt/solver/smtlib-parser.ts +526 -0
  248. package/src/prove/smt/solver/solver.ts +71 -0
  249. package/src/prove/smt/solver/sort.ts +35 -0
  250. package/src/prove/smt/solver/sticky-generations.ts +69 -0
  251. package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
  252. package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
  253. package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
  254. package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
  255. package/src/prove/smt/solver/theory-lra-model.ts +243 -0
  256. package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
  257. package/src/prove/smt/solver/theory-lra-state.ts +43 -0
  258. package/src/prove/smt/solver/theory-lra.ts +56 -0
  259. package/src/prove/smt/solver/var-subst.ts +258 -0
  260. package/src/prove/smt/solver/z3-license.txt +10 -0
  261. package/src/prove/smt/table.ts +170 -0
  262. package/src/prove/tlapm/tlapm.ts +96 -0
  263. package/src/prove/tlaps-module.ts +510 -0
  264. package/src/prove/verdict.ts +18 -0
  265. package/src/prove/zenon/LICENSE +32 -0
  266. package/src/prove/zenon/check/check.ts +105 -0
  267. package/src/prove/zenon/check/definitions.ts +144 -0
  268. package/src/prove/zenon/check/equality.ts +182 -0
  269. package/src/prove/zenon/check/functions.ts +62 -0
  270. package/src/prove/zenon/check/keys.ts +125 -0
  271. package/src/prove/zenon/check/propositional.ts +104 -0
  272. package/src/prove/zenon/check/records.ts +188 -0
  273. package/src/prove/zenon/check/relations.ts +121 -0
  274. package/src/prove/zenon/check/rewrites.ts +224 -0
  275. package/src/prove/zenon/check/sets.ts +302 -0
  276. package/src/prove/zenon/check/terms.ts +127 -0
  277. package/src/prove/zenon/check/tla.ts +126 -0
  278. package/src/prove/zenon/decide.ts +113 -0
  279. package/src/prove/zenon/encode.ts +437 -0
  280. package/src/prove/zenon/eqrel.ts +300 -0
  281. package/src/prove/zenon/equality-rules.ts +435 -0
  282. package/src/prove/zenon/expr.ts +551 -0
  283. package/src/prove/zenon/index-table.ts +350 -0
  284. package/src/prove/zenon/isar-case.ts +513 -0
  285. package/src/prove/zenon/isar.ts +1249 -0
  286. package/src/prove/zenon/limits.ts +15 -0
  287. package/src/prove/zenon/llproof.ts +173 -0
  288. package/src/prove/zenon/mltoll.ts +1566 -0
  289. package/src/prove/zenon/node.ts +297 -0
  290. package/src/prove/zenon/ocaml.ts +169 -0
  291. package/src/prove/zenon/parse.ts +247 -0
  292. package/src/prove/zenon/phrase.ts +191 -0
  293. package/src/prove/zenon/proof.ts +198 -0
  294. package/src/prove/zenon/propositional-rules.ts +387 -0
  295. package/src/prove/zenon/rules.ts +94 -0
  296. package/src/prove/zenon/search.ts +288 -0
  297. package/src/prove/zenon/tla/functions.ts +151 -0
  298. package/src/prove/zenon/tla/llproof.ts +480 -0
  299. package/src/prove/zenon/tla/records.ts +225 -0
  300. package/src/prove/zenon/tla/rewrites.ts +447 -0
  301. package/src/prove/zenon/tla/sets.ts +304 -0
  302. package/src/prove/zenon/tla/terms.ts +181 -0
  303. package/src/prove/zenon/tla/tla.ts +506 -0
  304. package/src/run-cli.ts +334 -75
  305. package/src/standard-modules.ts +5 -2
  306. package/src/successors.ts +24 -5
  307. package/src/tlapm-cache.ts +236 -0
  308. package/src/tlc-random.ts +55 -32
  309. package/src/tlc-version.ts +8 -7
  310. package/src/values.ts +97 -47
  311. package/src/worker.ts +65 -0
  312. package/dist/parallel.cjs +0 -12
  313. package/dist/parallel.js +0 -12
@@ -0,0 +1,387 @@
1
+ // Ported from Zenon's prove.ml, as shipped in tlapm. Copyright 2002 INRIA, see LICENSE.
2
+ //
3
+ // The rules for connectives and quantifiers, closing a branch, and unfolding definitions.
4
+
5
+ import { getStringValue } from "./equality-rules";
6
+ import { isApp, type Expr, type Expressions } from "./expr";
7
+ import { insertNode, type Queue } from "./node";
8
+ import type { Definition } from "./parse";
9
+ import { makeRelationRule, makeRule, type Rule } from "./proof";
10
+ import { makeNode, type RuleResult, type SearchRule } from "./rules";
11
+
12
+ // Zenon's is_conj and is_disj: how many more conjuncts or disjuncts a formula needs to reach m.
13
+ const countConjuncts = (formula: Expr, needed: number): number => {
14
+ if (needed <= 0) return 0;
15
+ if (formula.kind === "and")
16
+ return countConjuncts(formula.args[1], countConjuncts(formula.args[0], needed));
17
+ if (formula.kind === "not") return countDisjuncts(formula.args[0], needed);
18
+ return needed - 1;
19
+ };
20
+
21
+ const countDisjuncts = (formula: Expr, needed: number): number => {
22
+ if (needed <= 0) return 0;
23
+ if (formula.kind === "or")
24
+ return countDisjuncts(formula.args[1], countDisjuncts(formula.args[0], needed));
25
+ if (formula.kind === "imply")
26
+ return countDisjuncts(formula.args[1], countConjuncts(formula.args[0], needed));
27
+ if (formula.kind === "not") return countConjuncts(formula.args[0], needed);
28
+ return needed - 1;
29
+ };
30
+
31
+ const decomposeConjunction = (
32
+ exprs: Expressions,
33
+ isNegated: boolean,
34
+ accumulator: Expr[],
35
+ formula: Expr,
36
+ ): Expr[] => {
37
+ if (formula.kind === "and")
38
+ return decomposeConjunction(
39
+ exprs,
40
+ isNegated,
41
+ decomposeConjunction(exprs, isNegated, accumulator, formula.args[1]),
42
+ formula.args[0],
43
+ );
44
+ if (formula.kind === "not")
45
+ return decomposeDisjunction(exprs, !isNegated, accumulator, formula.args[0]);
46
+ return [isNegated ? exprs.enot(formula) : formula, ...accumulator];
47
+ };
48
+
49
+ const decomposeDisjunction = (
50
+ exprs: Expressions,
51
+ isNegated: boolean,
52
+ accumulator: Expr[],
53
+ formula: Expr,
54
+ ): Expr[] => {
55
+ if (formula.kind === "or")
56
+ return decomposeDisjunction(
57
+ exprs,
58
+ isNegated,
59
+ decomposeDisjunction(exprs, isNegated, accumulator, formula.args[1]),
60
+ formula.args[0],
61
+ );
62
+ if (formula.kind === "imply")
63
+ return decomposeConjunction(
64
+ exprs,
65
+ !isNegated,
66
+ decomposeDisjunction(exprs, isNegated, accumulator, formula.args[1]),
67
+ formula.args[0],
68
+ );
69
+ if (formula.kind === "not")
70
+ return decomposeConjunction(exprs, !isNegated, accumulator, formula.args[0]);
71
+ return [isNegated ? exprs.enot(formula) : formula, ...accumulator];
72
+ };
73
+
74
+ export const addAbsurd: SearchRule = (context, queue, formula, goalness) => {
75
+ const exprs = context.exprs;
76
+ if (formula.kind === "not" && context.index.isMember(formula.args[0]))
77
+ return [
78
+ insertNode(
79
+ queue,
80
+ makeNode(
81
+ [formula, formula.args[0]],
82
+ makeRule("close", [formula.args[0]]),
83
+ "prop",
84
+ goalness,
85
+ [],
86
+ ),
87
+ ),
88
+ true,
89
+ ];
90
+ const negation = exprs.enot(formula);
91
+ if (!context.index.isMember(negation)) return [queue, false];
92
+ return [
93
+ insertNode(
94
+ queue,
95
+ makeNode([formula, negation], makeRule("close", [formula]), "prop", goalness, []),
96
+ ),
97
+ true,
98
+ ];
99
+ };
100
+
101
+ export const addClosure: SearchRule = (context, queue, formula, goalness) => {
102
+ const exprs = context.exprs;
103
+ const close = (conclusions: Expr[], rule: Rule): RuleResult => [
104
+ insertNode(queue, makeNode(conclusions, rule, "prop", goalness, [])),
105
+ true,
106
+ ];
107
+ if (formula.kind === "false") return close([formula], makeRule("false", []));
108
+ const operand = formula.kind === "not" ? formula.args[0] : undefined;
109
+ if (operand?.kind === "true") return close([formula], makeRule("not_true", []));
110
+ const relations = context.relations;
111
+ if (
112
+ operand?.kind === "app" &&
113
+ operand.args.length === 2 &&
114
+ relations.isReflexive(operand.symbol) &&
115
+ operand.args[0] === operand.args[1]
116
+ )
117
+ return close([formula], makeRelationRule("close_refl", operand.symbol, [operand.args[0]]));
118
+ if (
119
+ formula.kind === "app" &&
120
+ formula.args.length === 2 &&
121
+ relations.isSymmetric(formula.symbol)
122
+ ) {
123
+ const reversed = exprs.enot(exprs.eapp(formula.symbol, [formula.args[1], formula.args[0]]));
124
+ if (context.index.isMember(reversed))
125
+ return close(
126
+ [formula, reversed],
127
+ makeRelationRule("close_sym", formula.symbol, [formula.args[0], formula.args[1]]),
128
+ );
129
+ }
130
+ if (
131
+ operand?.kind === "app" &&
132
+ operand.args.length === 2 &&
133
+ relations.isSymmetric(operand.symbol)
134
+ ) {
135
+ const reversed = exprs.eapp(operand.symbol, [operand.args[1], operand.args[0]]);
136
+ if (context.index.isMember(reversed))
137
+ return close(
138
+ [formula, reversed],
139
+ makeRelationRule("close_sym", operand.symbol, [operand.args[1], operand.args[0]]),
140
+ );
141
+ }
142
+ if (isApp(formula, "=", 2)) {
143
+ const left = getStringValue(formula.args[0]);
144
+ const right = getStringValue(formula.args[1]);
145
+ if (left !== undefined && right !== undefined && left !== right)
146
+ return close([formula], makeRule("stringequal", [left, right]));
147
+ }
148
+ return [queue, false];
149
+ };
150
+
151
+ export const addJunctionTree: SearchRule = (context, queue, formula, goalness) => {
152
+ const exprs = context.exprs;
153
+ const operand = formula.kind === "not" ? formula.args[0] : undefined;
154
+ const isConjunctive =
155
+ formula.kind === "and" || operand?.kind === "or" || operand?.kind === "imply";
156
+ if (isConjunctive && countConjuncts(formula, 3) === 0)
157
+ return [
158
+ insertNode(
159
+ queue,
160
+ makeNode([formula], makeRule("conj_tree", [formula]), "prop", goalness, [
161
+ decomposeConjunction(exprs, false, [], formula),
162
+ ]),
163
+ ),
164
+ true,
165
+ ];
166
+ const isDisjunctive =
167
+ formula.kind === "or" || operand?.kind === "and" || formula.kind === "imply";
168
+ if (isDisjunctive && countDisjuncts(formula, 3) === 0)
169
+ return [
170
+ insertNode(
171
+ queue,
172
+ makeNode(
173
+ [formula],
174
+ makeRule("disj_tree", [formula]),
175
+ "prop",
176
+ goalness,
177
+ decomposeDisjunction(exprs, false, [], formula).map((inner) => [inner]),
178
+ ),
179
+ ),
180
+ true,
181
+ ];
182
+ return [queue, false];
183
+ };
184
+
185
+ export const addAlpha: SearchRule = (context, queue, formula, goalness) => {
186
+ const exprs = context.exprs;
187
+ const add = (rule: Rule, branch: Expr[]): RuleResult => [
188
+ insertNode(queue, makeNode([formula], rule, "prop", goalness, [branch])),
189
+ true,
190
+ ];
191
+ if (formula.kind === "and")
192
+ return add(makeRule("and", [formula.args[0], formula.args[1]]), [
193
+ formula.args[0],
194
+ formula.args[1],
195
+ ]);
196
+ if (formula.kind !== "not") return [queue, false];
197
+ const operand = formula.args[0];
198
+ if (operand.kind === "not") return add(makeRule("not_not", [operand.args[0]]), [operand.args[0]]);
199
+ if (operand.kind === "or")
200
+ return add(makeRule("not_or", [operand.args[0], operand.args[1]]), [
201
+ exprs.enot(operand.args[0]),
202
+ exprs.enot(operand.args[1]),
203
+ ]);
204
+ if (operand.kind === "imply")
205
+ return add(makeRule("not_impl", [operand.args[0], operand.args[1]]), [
206
+ operand.args[0],
207
+ exprs.enot(operand.args[1]),
208
+ ]);
209
+ return [queue, false];
210
+ };
211
+
212
+ export const addBeta: SearchRule = (context, queue, formula, goalness) => {
213
+ const exprs = context.exprs;
214
+ const add = (rule: Rule, branches: Expr[][]): RuleResult => [
215
+ insertNode(queue, makeNode([formula], rule, "prop", goalness, branches)),
216
+ true,
217
+ ];
218
+ if (formula.kind === "or" || formula.kind === "imply" || formula.kind === "equiv") {
219
+ const left = formula.args[0];
220
+ const right = formula.args[1];
221
+ if (formula.kind === "or") return add(makeRule("or", [left, right]), [[left], [right]]);
222
+ if (formula.kind === "imply")
223
+ return add(makeRule("impl", [left, right]), [[exprs.enot(left)], [right]]);
224
+ return add(makeRule("equiv", [left, right]), [
225
+ [exprs.enot(left), exprs.enot(right)],
226
+ [left, right],
227
+ ]);
228
+ }
229
+ if (formula.kind !== "not") return [queue, false];
230
+ const operand = formula.args[0];
231
+ if (operand.kind !== "and" && operand.kind !== "equiv") return [queue, false];
232
+ const first = operand.args[0];
233
+ const second = operand.args[1];
234
+ if (operand.kind === "and")
235
+ return add(makeRule("not_and", [first, second]), [[exprs.enot(first)], [exprs.enot(second)]]);
236
+ return add(makeRule("not_equiv", [first, second]), [
237
+ [exprs.enot(first), second],
238
+ [first, exprs.enot(second)],
239
+ ]);
240
+ };
241
+
242
+ export const addDelta: SearchRule = (context, queue, formula, goalness) => {
243
+ const exprs = context.exprs;
244
+ if (formula.kind === "ex") {
245
+ const variable = formula.args[0];
246
+ const body = formula.args[1];
247
+ const witness = exprs.substitute(
248
+ [[variable, exprs.etau(variable, formula.symbol, body)]],
249
+ body,
250
+ );
251
+ return [
252
+ insertNode(
253
+ queue,
254
+ makeNode([formula], makeRule("ex", [formula]), "prop", goalness, [[witness]]),
255
+ ),
256
+ true,
257
+ ];
258
+ }
259
+ if (formula.kind !== "not" || formula.args[0].kind !== "all") return [queue, false];
260
+ const quantified = formula.args[0];
261
+ const variable = quantified.args[0];
262
+ const negatedBody = exprs.enot(quantified.args[1]);
263
+ const witness = exprs.substitute(
264
+ [[variable, exprs.etau(variable, quantified.symbol, negatedBody)]],
265
+ negatedBody,
266
+ );
267
+ const existential = exprs.eex(variable, quantified.symbol, negatedBody);
268
+ return [
269
+ insertNode(
270
+ queue,
271
+ makeNode([formula], makeRule("not_all_ex", [formula]), "prop", goalness, [
272
+ [witness, existential],
273
+ ]),
274
+ ),
275
+ true,
276
+ ];
277
+ };
278
+
279
+ export const addGamma: SearchRule = (context, queue, formula, goalness) => {
280
+ const exprs = context.exprs;
281
+ if (formula.kind === "all") {
282
+ const meta = exprs.emeta(formula);
283
+ const instance = exprs.substitute([[formula.args[0], meta]], formula.args[1]);
284
+ return [
285
+ insertNode(
286
+ queue,
287
+ makeNode([formula], makeRule("all", [formula, meta]), "arity", goalness, [[instance]]),
288
+ ),
289
+ true,
290
+ ];
291
+ }
292
+ if (formula.kind !== "not" || formula.args[0].kind !== "ex") return [queue, false];
293
+ const quantified = formula.args[0];
294
+ const meta = exprs.emeta(quantified);
295
+ const instance = exprs.enot(exprs.substitute([[quantified.args[0], meta]], quantified.args[1]));
296
+ return [
297
+ insertNode(
298
+ queue,
299
+ makeNode([formula], makeRule("not_ex", [formula, meta]), "arity", goalness, [[instance]]),
300
+ ),
301
+ true,
302
+ ];
303
+ };
304
+
305
+ const unfold = (
306
+ exprs: Expressions,
307
+ queue: Queue,
308
+ formula: Expr,
309
+ goalness: number,
310
+ definition: Definition,
311
+ args: Expr[] | undefined,
312
+ wrap: (unfolded: Expr) => Expr,
313
+ ): RuleResult => {
314
+ const params = definition.params;
315
+ const body = definition.body;
316
+ const add = (unfolded: Expr): RuleResult => {
317
+ const rule: Rule = { name: "definition", definition, args: [formula, unfolded] };
318
+ return [insertNode(queue, makeNode([formula], rule, "prop", goalness, [[unfolded]])), true];
319
+ };
320
+ if (params.length === 0 && args !== undefined && body.kind === "var")
321
+ return add(wrap(exprs.eapp(body.symbol, args)));
322
+ const actuals = args ?? [];
323
+ if (params.length !== actuals.length) return [queue, false];
324
+ const unfolded = exprs.substituteSecondOrder(
325
+ params.map((param, index) => [param, actuals[index]]),
326
+ body,
327
+ );
328
+ return unfolded === undefined ? [queue, false] : add(wrap(unfolded));
329
+ };
330
+
331
+ export const addUnfold: SearchRule = (context, queue, formula, goalness) => {
332
+ const exprs = context.exprs;
333
+ const index = context.index;
334
+ const isAny = context.relations.isAny;
335
+ const isNegated = formula.kind === "not";
336
+ const atom = isNegated ? formula.args[0] : formula;
337
+ const negate = (inner: Expr) => (isNegated ? exprs.enot(inner) : inner);
338
+ const tryUnfold = (term: Expr, wrap: (unfolded: Expr) => Expr) => {
339
+ const definition =
340
+ term.kind === "app" || term.kind === "var" ? index.getDefinition(term.symbol) : undefined;
341
+ return definition === undefined
342
+ ? undefined
343
+ : unfold(
344
+ exprs,
345
+ queue,
346
+ formula,
347
+ goalness,
348
+ definition,
349
+ term.kind === "app" ? term.args : undefined,
350
+ wrap,
351
+ );
352
+ };
353
+ // Zenon tries applications before variables, each first as the formula itself, then as either
354
+ // side of a relation that is reflexive, symmetric or transitive.
355
+ for (const kind of ["app", "var"]) {
356
+ if (atom.kind === kind) {
357
+ const result = tryUnfold(atom, negate);
358
+ if (result !== undefined) return result;
359
+ }
360
+ if (atom.kind !== "app" || atom.args.length !== 2 || !isAny(atom.symbol)) continue;
361
+ const left = atom.args[0];
362
+ const right = atom.args[1];
363
+ if (left.kind === kind) {
364
+ const result = tryUnfold(left, (unfolded) =>
365
+ negate(exprs.eapp(atom.symbol, [unfolded, right])),
366
+ );
367
+ if (result !== undefined) return result;
368
+ }
369
+ if (right.kind === kind) {
370
+ const result = tryUnfold(right, (unfolded) =>
371
+ negate(exprs.eapp(atom.symbol, [left, unfolded])),
372
+ );
373
+ if (result !== undefined) return result;
374
+ }
375
+ }
376
+ return [queue, false];
377
+ };
378
+
379
+ export const addUseless: SearchRule = (_context, queue, formula) => {
380
+ const atom = formula.kind === "not" ? formula.args[0] : formula;
381
+ const isUseless =
382
+ atom.kind === "var" ||
383
+ atom.kind === "tau" ||
384
+ formula.kind === "true" ||
385
+ (formula.kind === "not" && atom.kind === "false");
386
+ return [queue, isUseless];
387
+ };
@@ -0,0 +1,94 @@
1
+ // Ported from Zenon's prove.ml, as shipped in tlapm. Copyright 2002 INRIA, see LICENSE.
2
+ //
3
+ // Zenon's newnodes: each rule in turn suggests nodes for a formula added to a branch, until one
4
+ // says that the rest don't apply.
5
+
6
+ import type { Relations } from "./eqrel";
7
+ import {
8
+ addCongruence,
9
+ addMatches,
10
+ addReflexivity,
11
+ addStringEqualities,
12
+ addSymmetricMatches,
13
+ addTransitivity,
14
+ } from "./equality-rules";
15
+ import { type Expr, type Expressions } from "./expr";
16
+ import type { Index } from "./index-table";
17
+ import { insertNode, type Node, type Priority, type Queue } from "./node";
18
+ import type { Rule } from "./proof";
19
+ import {
20
+ addAbsurd,
21
+ addAlpha,
22
+ addBeta,
23
+ addClosure,
24
+ addDelta,
25
+ addGamma,
26
+ addJunctionTree,
27
+ addUnfold,
28
+ addUseless,
29
+ } from "./propositional-rules";
30
+ import { getExtensionNodes } from "./tla/tla";
31
+
32
+ export interface SearchContext {
33
+ index: Index;
34
+ relations: Relations;
35
+ exprs: Expressions;
36
+ }
37
+
38
+ export type RuleResult = [Queue, boolean];
39
+
40
+ export type SearchRule = (
41
+ context: SearchContext,
42
+ queue: Queue,
43
+ formula: Expr,
44
+ goalness: number,
45
+ ) => RuleResult;
46
+
47
+ export const makeNode = (
48
+ conclusions: Expr[],
49
+ rule: Rule,
50
+ priority: Priority,
51
+ goalness: number,
52
+ branches: Expr[][],
53
+ ): Node => ({ conclusions, rule, priority, goalness, branches });
54
+
55
+ export const unequal = (exprs: Expressions, left: Expr, right: Expr) =>
56
+ exprs.enot(exprs.eapp("=", [left, right]));
57
+
58
+ export const insertAll = (queue: Queue, nodes: Node[]) => nodes.reduce(insertNode, queue);
59
+
60
+ const addExtensions: SearchRule = (context, queue, formula, goalness) => {
61
+ const result = getExtensionNodes(context, formula, goalness);
62
+ return [insertAll(queue, result.nodes), result.isStopped];
63
+ };
64
+
65
+ // Zenon's newnodes_preunif comes after addReflexivity, but it never adds a node: it preunifies a
66
+ // formula with its negation, whose heads always differ.
67
+ const RULES: SearchRule[] = [
68
+ addAbsurd,
69
+ addClosure,
70
+ addExtensions,
71
+ addJunctionTree,
72
+ addAlpha,
73
+ addBeta,
74
+ addStringEqualities,
75
+ addDelta,
76
+ addGamma,
77
+ addUnfold,
78
+ addReflexivity,
79
+ addCongruence,
80
+ addTransitivity,
81
+ addSymmetricMatches,
82
+ addMatches,
83
+ addUseless,
84
+ ];
85
+
86
+ export const addNodes = (context: SearchContext, queue: Queue, formula: Expr, goalness: number) => {
87
+ let current = queue;
88
+ for (const rule of RULES) {
89
+ const result = rule(context, current, formula, goalness);
90
+ current = result[0];
91
+ if (result[1]) break;
92
+ }
93
+ return current;
94
+ };