tla-ts 0.0.4-dev.a297123 → 0.0.4-dev.e92649a

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 (311) hide show
  1. package/README.md +26 -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 +515 -0
  15. package/dist/prove.js +515 -0
  16. package/dist/run-cli.cjs +30 -47
  17. package/dist/run-cli.js +30 -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 +5 -3
  27. package/src/errors.ts +86 -0
  28. package/src/evaluate.ts +54 -19
  29. package/src/index.ts +10 -0
  30. package/src/{obligation-action.ts → obligations/action.ts} +258 -37
  31. package/src/{obligation-anon.ts → obligations/anon.ts} +13 -7
  32. package/src/obligations/ctx.ts +64 -0
  33. package/src/{obligation-deref.ts → obligations/deref.ts} +2 -2
  34. package/src/{obligation-expression.ts → obligations/expression.ts} +54 -8
  35. package/src/{obligation-generate.ts → obligations/generate.ts} +134 -61
  36. package/src/{obligations.ts → obligations/index.ts} +26 -12
  37. package/src/{obligation-levels.ts → obligations/levels.ts} +12 -2
  38. package/src/{obligation-module.ts → obligations/module.ts} +46 -20
  39. package/src/obligations/pickle.ts +100 -0
  40. package/src/obligations/pragma.ts +189 -0
  41. package/src/{obligation-printer.ts → obligations/printer.ts} +5 -59
  42. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
  43. package/src/{obligation-source.ts → obligations/source.ts} +91 -35
  44. package/src/obligations/temporal.ts +319 -0
  45. package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
  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 +27 -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 +477 -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 +27 -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 +29 -0
  115. package/src/prove/prove.ts +417 -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 +96 -0
  261. package/src/prove/tlaps-module.ts +510 -0
  262. package/src/prove/verdict.ts +13 -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 +73 -20
  303. package/src/standard-modules.ts +5 -2
  304. package/src/successors.ts +24 -5
  305. package/src/tlc-random.ts +55 -32
  306. package/src/tlc-version.ts +8 -7
  307. package/src/values.ts +80 -35
  308. package/src/worker.ts +65 -0
  309. package/dist/parallel.cjs +0 -12
  310. package/dist/parallel.js +0 -12
  311. /package/src/{obligation-format.ts → obligations/format.ts} +0 -0
@@ -0,0 +1,435 @@
1
+ // Ported from Zenon's prove.ml, as shipped in tlapm. Copyright 2002 INRIA, see LICENSE.
2
+ //
3
+ // The rules for equality and other relations: instances that unify a metavariable, matching a
4
+ // literal against its negation, congruence, reflexivity, symmetry and transitivity.
5
+
6
+ import { TlaZenonError } from "../../errors";
7
+ import {
8
+ isApp,
9
+ isNegatedRelation,
10
+ isRelation,
11
+ isMeta,
12
+ type Expr,
13
+ type NegatedRelationExpr,
14
+ type NotExpr,
15
+ type RelationExpr,
16
+ type Expressions,
17
+ } from "./expr";
18
+ import { getHead } from "./index-table";
19
+ import { insertNode, type Priority, type Queue } from "./node";
20
+ import { makeRelationRule, makeRule } from "./proof";
21
+ import { insertAll, makeNode, unequal, type SearchContext, type SearchRule } from "./rules";
22
+
23
+ export const makeInstance = (
24
+ exprs: Expressions,
25
+ queue: Queue,
26
+ quantified: Expr,
27
+ term: Expr,
28
+ goalness: number,
29
+ ): Queue => {
30
+ if (quantified.kind === "all") {
31
+ const instance = exprs.substitute([[quantified.args[0], term]], quantified.args[1]);
32
+ return insertNode(
33
+ queue,
34
+ makeNode(
35
+ [quantified],
36
+ makeRule("all", [quantified, term]),
37
+ { instance: quantified },
38
+ goalness,
39
+ [[instance]],
40
+ ),
41
+ );
42
+ }
43
+ if (quantified.kind === "ex") {
44
+ const instance = exprs.substitute([[quantified.args[0], term]], exprs.enot(quantified.args[1]));
45
+ const negated = exprs.enot(quantified);
46
+ return insertNode(
47
+ queue,
48
+ makeNode([negated], makeRule("not_ex", [negated, term]), { instance: quantified }, goalness, [
49
+ [instance],
50
+ ]),
51
+ );
52
+ }
53
+ // Zenon hands applications to the extension named by the symbol's prefix, and tla has none.
54
+ if (quantified.kind === "app") return queue;
55
+ throw new TlaZenonError("Zenon: make_inst on a formula that isn't quantified");
56
+ };
57
+
58
+ const makeInequalities = (exprs: Expressions, left: Expr[], right: Expr[]) =>
59
+ left.map((inner, index) => [unequal(exprs, inner, right[index])]);
60
+
61
+ const isGoodMatch = (left: Expr, right: Expr): boolean => {
62
+ if (left.kind === "meta" || right.kind === "meta") return true;
63
+ if (left.kind !== right.kind) return false;
64
+ switch (left.kind) {
65
+ case "var":
66
+ return left.symbol === right.symbol;
67
+ case "app":
68
+ return left.symbol === right.symbol;
69
+ case "not":
70
+ return right.kind === "not" && isGoodMatch(left.args[0], right.args[0]);
71
+ case "and":
72
+ case "or":
73
+ case "imply":
74
+ case "equiv": {
75
+ const rightArgs: Expr[] = right.args;
76
+ return isGoodMatch(left.args[0], rightArgs[0]) || isGoodMatch(left.args[1], rightArgs[1]);
77
+ }
78
+ case "true":
79
+ case "false":
80
+ return true;
81
+ case "tau":
82
+ return left === right;
83
+ default:
84
+ return false;
85
+ }
86
+ };
87
+
88
+ const makeNotEquiv = (
89
+ exprs: Expressions,
90
+ queue: Queue,
91
+ isSymmetric: boolean,
92
+ positive: [Expr, number],
93
+ negative: [NotExpr, number],
94
+ ): Queue => {
95
+ const atom = positive[0];
96
+ const negation = negative[0];
97
+ const negated = negation.args[0];
98
+ const args: Expr[] = atom.args;
99
+ const negatedArgs: Expr[] = negated.args;
100
+ if (
101
+ isApp(atom, "TLA.in", 2) &&
102
+ args[1].kind === "var" &&
103
+ negatedArgs.length === 2 &&
104
+ args[1] !== negatedArgs[1] &&
105
+ !isMeta(args[0]) &&
106
+ !isMeta(args[1]) &&
107
+ !isMeta(negatedArgs[0]) &&
108
+ !isMeta(negatedArgs[1]) &&
109
+ args[0] !== negatedArgs[0]
110
+ )
111
+ return queue;
112
+ if ((isSymmetric && negatedArgs.length !== 2) || args.length !== negatedArgs.length) return queue;
113
+ const isGood = args.every((inner, index) => isGoodMatch(inner, negatedArgs[index]));
114
+ const priority: Priority = isGood
115
+ ? atom.symbol === "="
116
+ ? "arity_eq"
117
+ : "arity"
118
+ : { instance: atom };
119
+ return insertNode(
120
+ queue,
121
+ makeNode(
122
+ [atom, negation],
123
+ isSymmetric
124
+ ? makeRelationRule("p_not_p_sym", atom.symbol, [atom, negation])
125
+ : makeRule("p_not_p", [atom, negation]),
126
+ priority,
127
+ Math.min(positive[1], negative[1]),
128
+ makeInequalities(exprs, isSymmetric ? [...args].reverse() : args, negatedArgs),
129
+ ),
130
+ );
131
+ };
132
+
133
+ export const getStringValue = (expression: Expr) =>
134
+ isApp(expression, "$string", 1) ? expression.args[0] : undefined;
135
+
136
+ export const addStringEqualities: SearchRule = (context, queue, formula, goalness) => {
137
+ const exprs = context.exprs;
138
+ if (!isApp(formula, "=", 2)) return [queue, false];
139
+ const isRightString = getStringValue(formula.args[1]) !== undefined;
140
+ if (!isRightString && getStringValue(formula.args[0]) === undefined) return [queue, false];
141
+ const string = isRightString ? formula.args[1] : formula.args[0];
142
+ const term = isRightString ? formula.args[0] : formula.args[1];
143
+ const names = isRightString
144
+ ? (["stringdiffll", "stringdifflr"] as const)
145
+ : (["stringdiffrl", "stringdiffrr"] as const);
146
+ let current = queue;
147
+ const visit = (name: (typeof names)[number], isReversed: boolean, pairs: [Expr, string][]) => {
148
+ for (const pair of pairs) {
149
+ const otherString = exprs.eapp("$string", [exprs.evar(pair[1])]);
150
+ const equality = exprs.eapp(
151
+ "=",
152
+ isReversed ? [otherString, pair[0]] : [pair[0], otherString],
153
+ );
154
+ if (string === otherString) continue;
155
+ current = insertNode(
156
+ current,
157
+ makeNode(
158
+ [formula, equality],
159
+ makeRule(name, [term, string, pair[0], otherString]),
160
+ "prop",
161
+ goalness,
162
+ [[unequal(exprs, term, pair[0])]],
163
+ ),
164
+ );
165
+ }
166
+ };
167
+ visit(names[0], false, context.index.getStringEqualities());
168
+ visit(names[1], true, context.index.getReversedStringEqualities());
169
+ return [current, false];
170
+ };
171
+
172
+ export const addReflexivity: SearchRule = (context, queue, formula, goalness) => {
173
+ const exprs = context.exprs;
174
+ if (formula.kind !== "not") return [queue, false];
175
+ const atom = formula.args[0];
176
+ if (atom.kind !== "app" || atom.args.length !== 2) return [queue, false];
177
+ const left = atom.args[0];
178
+ const right = atom.args[1];
179
+ if (atom.symbol !== "=") {
180
+ if (!context.relations.isReflexive(atom.symbol)) return [queue, false];
181
+ return [
182
+ insertNode(
183
+ queue,
184
+ makeNode(
185
+ [formula],
186
+ makeRelationRule("refl", atom.symbol, [left, right]),
187
+ "arity",
188
+ goalness,
189
+ [[unequal(exprs, left, right)]],
190
+ ),
191
+ ),
192
+ false,
193
+ ];
194
+ }
195
+ if (left.kind === "meta" && right.kind === "meta")
196
+ return [
197
+ makeInstance(
198
+ exprs,
199
+ makeInstance(exprs, queue, right.args[0], left, goalness),
200
+ left.args[0],
201
+ right,
202
+ goalness,
203
+ ),
204
+ false,
205
+ ];
206
+ if (left.kind === "meta")
207
+ return [makeInstance(exprs, queue, left.args[0], right, goalness), false];
208
+ if (right.kind === "meta")
209
+ return [makeInstance(exprs, queue, right.args[0], left, goalness), false];
210
+ return [queue, false];
211
+ };
212
+
213
+ export const addCongruence: SearchRule = (context, queue, formula, goalness) => {
214
+ const exprs = context.exprs;
215
+ if (formula.kind !== "not" || !isApp(formula.args[0], "=", 2)) return [queue, false];
216
+ const left = formula.args[0].args[0];
217
+ const right = formula.args[0].args[1];
218
+ const leftString = getStringValue(left);
219
+ const rightString = getStringValue(right);
220
+ if (leftString !== undefined && rightString !== undefined && leftString !== rightString)
221
+ return [queue, false];
222
+ if (left.kind !== "app" || right.kind !== "app" || left.symbol !== right.symbol)
223
+ return [queue, false];
224
+ if (left.args.length !== right.args.length) return [queue, false];
225
+ return [
226
+ insertNode(
227
+ queue,
228
+ makeNode(
229
+ [formula],
230
+ makeRule("not_equal", [left, right]),
231
+ "arity",
232
+ goalness,
233
+ makeInequalities(exprs, left.args, right.args),
234
+ ),
235
+ ),
236
+ false,
237
+ ];
238
+ };
239
+
240
+ const makeTransNode = (
241
+ exprs: Expressions,
242
+ isSymmetric: boolean,
243
+ positive: [RelationExpr, number],
244
+ negative: [NegatedRelationExpr, number],
245
+ ) => {
246
+ const atom = positive[0];
247
+ const negated = negative[0].args[0];
248
+ const relation = atom.symbol;
249
+ const left = atom.args[0];
250
+ const right = atom.args[1];
251
+ const negatedLeft = negated.args[0];
252
+ const negatedRight = negated.args[1];
253
+ const terms = isSymmetric
254
+ ? [negatedRight, left, right, negatedLeft]
255
+ : [negatedLeft, left, right, negatedRight];
256
+ return makeNode(
257
+ [atom, negative[0]],
258
+ makeRule(isSymmetric ? "trans_sym" : "trans", [atom, negative[0]]),
259
+ relation === "=" ? "arity_eq" : "arity",
260
+ Math.min(positive[1], negative[1]),
261
+ [
262
+ [unequal(exprs, terms[0], terms[1]), exprs.enot(exprs.eapp(relation, [terms[0], terms[1]]))],
263
+ [unequal(exprs, terms[2], terms[3]), exprs.enot(exprs.eapp(relation, [terms[2], terms[3]]))],
264
+ ],
265
+ );
266
+ };
267
+
268
+ const makeTransEqualityNode = (
269
+ context: SearchContext,
270
+ isSymmetric: boolean,
271
+ equality: [RelationExpr, number],
272
+ negative: [NegatedRelationExpr, number],
273
+ ) => {
274
+ const exprs = context.exprs;
275
+ const left = equality[0].args[0];
276
+ const right = equality[0].args[1];
277
+ const negated = negative[0].args[0];
278
+ const relation = negated.symbol;
279
+ const negatedLeft = negated.args[0];
280
+ const negatedRight = negated.args[1];
281
+ const isRelationSymmetric = context.relations.isSymmetric(relation);
282
+ const terms = isSymmetric
283
+ ? isRelationSymmetric
284
+ ? [negatedRight, left, right, negatedLeft]
285
+ : [negatedLeft, right, left, negatedRight]
286
+ : [negatedLeft, left, right, negatedRight];
287
+ const first = exprs.enot(exprs.eapp(relation, [terms[0], terms[1]]));
288
+ const second = exprs.enot(exprs.eapp(relation, [terms[2], terms[3]]));
289
+ const name = isSymmetric ? (isRelationSymmetric ? "trans_eq_sym" : "trans_eq2") : "trans_eq";
290
+ return makeNode(
291
+ [equality[0], negative[0]],
292
+ makeRule(name, [left, right, negative[0]]),
293
+ relation === "=" ? "arity_eq" : "arity",
294
+ Math.min(equality[1], negative[1]),
295
+ [
296
+ [unequal(exprs, terms[0], terms[1]), first],
297
+ [first, second],
298
+ [unequal(exprs, terms[2], terms[3]), second],
299
+ ],
300
+ );
301
+ };
302
+
303
+ export const addTransitivity: SearchRule = (context, queue, formula, goalness) => {
304
+ const exprs = context.exprs;
305
+ const index = context.index;
306
+ const relations = context.relations;
307
+ if (isRelation(formula) && formula.symbol === "=") {
308
+ const entry: [RelationExpr, number] = [formula, goalness];
309
+ const transEq = (isSymmetric: boolean) => (match: [NegatedRelationExpr, number]) =>
310
+ makeTransEqualityNode(context, isSymmetric, entry, match);
311
+ const left = formula.args[0];
312
+ const right = formula.args[1];
313
+ if (left.kind === "meta" && right.kind === "meta")
314
+ return [
315
+ insertAll(
316
+ queue,
317
+ index
318
+ .findNegative("=")
319
+ .filter((match): match is [NegatedRelationExpr, number] => isNegatedRelation(match[0]))
320
+ .map(transEq(false)),
321
+ ),
322
+ false,
323
+ ];
324
+ if (!index.addTrans(formula)) return [queue, false];
325
+ const leftHead = getHead(left);
326
+ const rightHead = getHead(right);
327
+ if (leftHead === undefined || rightHead === undefined) return [queue, false];
328
+ return [
329
+ insertAll(queue, [
330
+ ...index.findAllNegTransLeft(leftHead).map(transEq(false)),
331
+ ...index.findAllNegTransLeft(rightHead).map(transEq(true)),
332
+ ...index.findAllNegTransRight(leftHead).map(transEq(true)),
333
+ ...index.findAllNegTransRight(rightHead).map(transEq(false)),
334
+ ]),
335
+ false,
336
+ ];
337
+ }
338
+ if (isRelation(formula) && relations.isTransitive(formula.symbol)) {
339
+ const entry: [RelationExpr, number] = [formula, goalness];
340
+ const trans = (isSymmetric: boolean) => (match: [NegatedRelationExpr, number]) =>
341
+ makeTransNode(exprs, isSymmetric, entry, match);
342
+ if (!index.addTrans(formula)) return [queue, false];
343
+ const relation = formula.symbol;
344
+ const leftHead = getHead(formula.args[0]);
345
+ const rightHead = getHead(formula.args[1]);
346
+ if (leftHead === undefined || rightHead === undefined) return [queue, false];
347
+ const isSymmetric = relations.isSymmetric(relation);
348
+ return [
349
+ insertAll(queue, [
350
+ ...index.findNegTransLeft(relation, leftHead).map(trans(false)),
351
+ ...(isSymmetric ? index.findNegTransLeft(relation, rightHead) : []).map(trans(true)),
352
+ ...(isSymmetric ? index.findNegTransRight(relation, leftHead) : []).map(trans(true)),
353
+ ...index.findNegTransRight(relation, rightHead).map(trans(false)),
354
+ ]),
355
+ false,
356
+ ];
357
+ }
358
+ if (!isNegatedRelation(formula)) return [queue, false];
359
+ const atom = formula.args[0];
360
+ if (!relations.isTransitive(atom.symbol)) return [queue, false];
361
+ const entry: [NegatedRelationExpr, number] = [formula, goalness];
362
+ const negTrans = (isSymmetric: boolean) => (match: [RelationExpr, number]) =>
363
+ makeTransNode(exprs, isSymmetric, match, entry);
364
+ const negTransEq = (isSymmetric: boolean) => (match: [RelationExpr, number]) =>
365
+ makeTransEqualityNode(context, isSymmetric, match, entry);
366
+ const relation = atom.symbol;
367
+ index.addNegTrans(formula);
368
+ const leftHead = getHead(atom.args[0]);
369
+ const rightHead = getHead(atom.args[1]);
370
+ if (leftHead === undefined || rightHead === undefined) return [queue, false];
371
+ const isSymmetric = relations.isSymmetric(relation);
372
+ const nodes = [
373
+ ...index.findTransLeft(relation, leftHead).map(negTrans(false)),
374
+ ...(isSymmetric ? index.findTransRight(relation, leftHead) : []).map(negTrans(true)),
375
+ ...(isSymmetric ? index.findTransLeft(relation, rightHead) : []).map(negTrans(true)),
376
+ ...index.findTransRight(relation, rightHead).map(negTrans(false)),
377
+ ];
378
+ const equalityNodes =
379
+ relation === "="
380
+ ? []
381
+ : [
382
+ ...index.findTransLeft("=", leftHead).map(negTransEq(false)),
383
+ ...index.findTransRight("=", leftHead).map(negTransEq(true)),
384
+ ...index.findTransLeft("=", rightHead).map(negTransEq(true)),
385
+ ...index.findTransRight("=", rightHead).map(negTransEq(false)),
386
+ ];
387
+ return [insertAll(queue, [...equalityNodes.reverse(), ...nodes]), false];
388
+ };
389
+
390
+ export const addSymmetricMatches: SearchRule = (context, queue, formula, goalness) => {
391
+ const entry: [Expr, number] = [formula, goalness];
392
+ const atom = formula.kind === "not" ? formula.args[0] : formula;
393
+ if (atom.kind !== "app" || atom.args.length !== 2 || atom.symbol === "=") return [queue, false];
394
+ if (!context.relations.isSymmetric(atom.symbol)) return [queue, false];
395
+ if (formula.kind === "not")
396
+ return [
397
+ context.index
398
+ .findPositive(atom.symbol)
399
+ .reduce(
400
+ (current, match) =>
401
+ makeNotEquiv(context.exprs, current, true, match, [formula, goalness]),
402
+ queue,
403
+ ),
404
+ false,
405
+ ];
406
+ return [
407
+ context.index
408
+ .findNegative(atom.symbol)
409
+ .reduce((current, match) => makeNotEquiv(context.exprs, current, true, entry, match), queue),
410
+ false,
411
+ ];
412
+ };
413
+
414
+ export const addMatches: SearchRule = (context, queue, formula, goalness) => {
415
+ const entry: [Expr, number] = [formula, goalness];
416
+ const atom = formula.kind === "not" ? formula.args[0] : formula;
417
+ if (atom.kind !== "app" || atom.symbol === "=") return [queue, false];
418
+ if (formula.kind === "not")
419
+ return [
420
+ context.index
421
+ .findPositive(atom.symbol)
422
+ .reduce(
423
+ (current, match) =>
424
+ makeNotEquiv(context.exprs, current, false, match, [formula, goalness]),
425
+ queue,
426
+ ),
427
+ true,
428
+ ];
429
+ return [
430
+ context.index
431
+ .findNegative(atom.symbol)
432
+ .reduce((current, match) => makeNotEquiv(context.exprs, current, false, entry, match), queue),
433
+ true,
434
+ ];
435
+ };