tla-ts 0.0.4-dev.a297123 → 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.
- package/README.md +27 -141
- package/dist/deciders.cjs +366 -0
- package/dist/deciders.js +366 -0
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +35 -1
- package/dist/index.d.ts +35 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -4
- package/dist/parallel-worker.js +1 -4
- package/dist/prove-worker.cjs +9 -0
- package/dist/prove-worker.d.cts +9 -0
- package/dist/prove-worker.d.ts +9 -0
- package/dist/prove-worker.js +9 -0
- package/dist/prove.cjs +996 -0
- package/dist/prove.js +996 -0
- package/dist/run-cli.cjs +37 -47
- package/dist/run-cli.js +37 -47
- package/dist/tlapm.cjs +10 -0
- package/dist/tlapm.js +10 -0
- package/dist/transfer.cjs +38 -44
- package/dist/transfer.js +38 -44
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +21 -12
- package/src/check.ts +1 -0
- package/src/codegen.ts +5 -3
- package/src/errors.ts +86 -0
- package/src/evaluate.ts +54 -19
- package/src/index.ts +10 -0
- package/src/{obligation-action.ts → obligations/action.ts} +265 -55
- package/src/{obligation-anon.ts → obligations/anon.ts} +47 -37
- package/src/obligations/ctx.ts +64 -0
- package/src/{obligation-deref.ts → obligations/deref.ts} +38 -61
- package/src/{obligation-expression.ts → obligations/expression.ts} +78 -45
- package/src/{obligation-format.ts → obligations/format.ts} +7 -8
- package/src/{obligation-generate.ts → obligations/generate.ts} +147 -74
- package/src/{obligations.ts → obligations/index.ts} +29 -13
- package/src/{obligation-levels.ts → obligations/levels.ts} +14 -5
- package/src/{obligation-module.ts → obligations/module.ts} +56 -33
- package/src/obligations/pickle.ts +98 -0
- package/src/obligations/pragma.ts +189 -0
- package/src/{obligation-printer.ts → obligations/printer.ts} +22 -80
- package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
- package/src/{obligation-source.ts → obligations/source.ts} +159 -97
- package/src/obligations/temporal.ts +319 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
- package/src/ocaml-marshal.ts +166 -0
- package/src/parallel-worker.ts +2 -18
- package/src/parallel.ts +10 -43
- package/src/prove/decide-pool.ts +100 -0
- package/src/prove/deciders.ts +33 -0
- package/src/prove/isabelle/LICENSE +36 -0
- package/src/prove/isabelle/LICENSE-tlapm +26 -0
- package/src/prove/isabelle/decide.ts +47 -0
- package/src/prove/isabelle/encode.ts +503 -0
- package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
- package/src/prove/isabelle/isar/method.ts +367 -0
- package/src/prove/isabelle/isar/proof.ts +28 -0
- package/src/prove/isabelle/isar/statement.ts +57 -0
- package/src/prove/isabelle/isar/theory.ts +192 -0
- package/src/prove/isabelle/isar/type-check.ts +278 -0
- package/src/prove/isabelle/provers/blast/blast.ts +258 -0
- package/src/prove/isabelle/provers/blast/branch.ts +322 -0
- package/src/prove/isabelle/provers/blast/prove.ts +347 -0
- package/src/prove/isabelle/provers/blast/rules.ts +330 -0
- package/src/prove/isabelle/provers/blast/state.ts +180 -0
- package/src/prove/isabelle/provers/blast/term.ts +547 -0
- package/src/prove/isabelle/provers/clasimp.ts +150 -0
- package/src/prove/isabelle/provers/classical.ts +389 -0
- package/src/prove/isabelle/provers/hypsubst.ts +441 -0
- package/src/prove/isabelle/pure/bicompose.ts +174 -0
- package/src/prove/isabelle/pure/consts.ts +32 -0
- package/src/prove/isabelle/pure/conv.ts +79 -0
- package/src/prove/isabelle/pure/drule.ts +264 -0
- package/src/prove/isabelle/pure/envir.ts +363 -0
- package/src/prove/isabelle/pure/goal.ts +53 -0
- package/src/prove/isabelle/pure/interrupt.ts +16 -0
- package/src/prove/isabelle/pure/list.ts +12 -0
- package/src/prove/isabelle/pure/logic.ts +402 -0
- package/src/prove/isabelle/pure/name.ts +110 -0
- package/src/prove/isabelle/pure/net.ts +262 -0
- package/src/prove/isabelle/pure/object-logic.ts +41 -0
- package/src/prove/isabelle/pure/pattern.ts +650 -0
- package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
- package/src/prove/isabelle/pure/rewriter.ts +602 -0
- package/src/prove/isabelle/pure/search.ts +68 -0
- package/src/prove/isabelle/pure/seq.ts +156 -0
- package/src/prove/isabelle/pure/simplifier.ts +112 -0
- package/src/prove/isabelle/pure/table.ts +208 -0
- package/src/prove/isabelle/pure/tactic.ts +276 -0
- package/src/prove/isabelle/pure/tactical.ts +347 -0
- package/src/prove/isabelle/pure/term-ord.ts +159 -0
- package/src/prove/isabelle/pure/term.ts +808 -0
- package/src/prove/isabelle/pure/thm.ts +806 -0
- package/src/prove/isabelle/pure/type.ts +133 -0
- package/src/prove/isabelle/pure/unify.ts +753 -0
- package/src/prove/isabelle/pure/variable.ts +25 -0
- package/src/prove/isabelle/tla/classical-setup.ts +101 -0
- package/src/prove/isabelle/tla/context.ts +74 -0
- package/src/prove/isabelle/tla/logic-data.ts +5 -0
- package/src/prove/isabelle/tla/logic.ts +215 -0
- package/src/prove/isabelle/tla/simpdata.ts +241 -0
- package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
- package/src/prove/ocaml.ts +22 -0
- package/src/prove/prep/action.ts +521 -0
- package/src/prove/prep/defs.ts +33 -0
- package/src/prove/prep/elab.ts +156 -0
- package/src/prove/prep/enabled-axioms.ts +189 -0
- package/src/prove/prep/enabled.ts +43 -0
- package/src/prove/prep/fingerprint.ts +388 -0
- package/src/prove/prep/flatten.ts +70 -0
- package/src/prove/prep/level-comparison.ts +557 -0
- package/src/prove/prep/md5.ts +67 -0
- package/src/prove/prep/pragma.ts +221 -0
- package/src/prove/prep/trivial.ts +22 -0
- package/src/prove/prove-worker.ts +25 -0
- package/src/prove/prove.ts +505 -0
- package/src/prove/ptl/decide.ts +68 -0
- package/src/prove/ptl/encode.ts +256 -0
- package/src/prove/ptl/sat.ts +151 -0
- package/src/prove/ptl/tableau.ts +276 -0
- package/src/prove/smt/axiomatize.ts +69 -0
- package/src/prove/smt/axioms.ts +222 -0
- package/src/prove/smt/context.ts +108 -0
- package/src/prove/smt/data.ts +636 -0
- package/src/prove/smt/encode.ts +166 -0
- package/src/prove/smt/extensionality.ts +65 -0
- package/src/prove/smt/flatten.ts +112 -0
- package/src/prove/smt/format.ts +154 -0
- package/src/prove/smt/instances.ts +182 -0
- package/src/prove/smt/rewrite.ts +773 -0
- package/src/prove/smt/simplify.ts +57 -0
- package/src/prove/smt/solver/act-cache.ts +265 -0
- package/src/prove/smt/solver/arith-rewriter.ts +962 -0
- package/src/prove/smt/solver/array.ts +22 -0
- package/src/prove/smt/solver/asserted-formulas.ts +469 -0
- package/src/prove/smt/solver/ast-lt.ts +157 -0
- package/src/prove/smt/solver/ast-util.ts +147 -0
- package/src/prove/smt/solver/ast.ts +1315 -0
- package/src/prove/smt/solver/auf-solver.ts +572 -0
- package/src/prove/smt/solver/case-split-queue.ts +178 -0
- package/src/prove/smt/solver/cg-table.ts +175 -0
- package/src/prove/smt/solver/clause.ts +276 -0
- package/src/prove/smt/solver/conflict-resolution.ts +343 -0
- package/src/prove/smt/solver/context.ts +1292 -0
- package/src/prove/smt/solver/ctx-simplify.ts +334 -0
- package/src/prove/smt/solver/der.ts +224 -0
- package/src/prove/smt/solver/dyn-ack.ts +141 -0
- package/src/prove/smt/solver/e-matching.ts +659 -0
- package/src/prove/smt/solver/enode.ts +259 -0
- package/src/prove/smt/solver/expr-ref.ts +21 -0
- package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
- package/src/prove/smt/solver/fingerprints.ts +92 -0
- package/src/prove/smt/solver/flat-literals.ts +51 -0
- package/src/prove/smt/solver/goal.ts +138 -0
- package/src/prove/smt/solver/hash.ts +173 -0
- package/src/prove/smt/solver/hashtable.ts +166 -0
- package/src/prove/smt/solver/internalizer.ts +1381 -0
- package/src/prove/smt/solver/lbool.ts +5 -0
- package/src/prove/smt/solver/literal.ts +24 -0
- package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
- package/src/prove/smt/solver/lp/constraints.ts +78 -0
- package/src/prove/smt/solver/lp/containers.ts +296 -0
- package/src/prove/smt/solver/lp/core-solver.ts +504 -0
- package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
- package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
- package/src/prove/smt/solver/lp/dependency.ts +51 -0
- package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
- package/src/prove/smt/solver/lp/explanation.ts +46 -0
- package/src/prove/smt/solver/lp/gomory.ts +255 -0
- package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
- package/src/prove/smt/solver/lp/hnf.ts +281 -0
- package/src/prove/smt/solver/lp/int-cube.ts +295 -0
- package/src/prove/smt/solver/lp/int-solver.ts +514 -0
- package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
- package/src/prove/smt/solver/lp/lar-term.ts +62 -0
- package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
- package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
- package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
- package/src/prove/smt/solver/lp/nex.ts +120 -0
- package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
- package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
- package/src/prove/smt/solver/lp/nla-core.ts +968 -0
- package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
- package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
- package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
- package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
- package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
- package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
- package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
- package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
- package/src/prove/smt/solver/lp/nla-order.ts +307 -0
- package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
- package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
- package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
- package/src/prove/smt/solver/lp/nla-types.ts +124 -0
- package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
- package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
- package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
- package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
- package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
- package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
- package/src/prove/smt/solver/lp/pdd.ts +971 -0
- package/src/prove/smt/solver/lp/random-updater.ts +138 -0
- package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
- package/src/prove/smt/solver/lp/union-find.ts +96 -0
- package/src/prove/smt/solver/mam-compiler.ts +847 -0
- package/src/prove/smt/solver/mam-interpreter.ts +400 -0
- package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
- package/src/prove/smt/solver/model-checker.ts +347 -0
- package/src/prove/smt/solver/model-evaluator.ts +262 -0
- package/src/prove/smt/solver/model-finder.ts +155 -0
- package/src/prove/smt/solver/model-generator.ts +97 -0
- package/src/prove/smt/solver/model-macro-solver.ts +728 -0
- package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
- package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
- package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
- package/src/prove/smt/solver/nlsat/explain.ts +607 -0
- package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
- package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
- package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
- package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
- package/src/prove/smt/solver/nlsat/solver.ts +911 -0
- package/src/prove/smt/solver/nlsat/types.ts +43 -0
- package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
- package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
- package/src/prove/smt/solver/nnf.ts +469 -0
- package/src/prove/smt/solver/pattern-inference.ts +351 -0
- package/src/prove/smt/solver/poly-rewriter.ts +477 -0
- package/src/prove/smt/solver/propagate-values.ts +83 -0
- package/src/prove/smt/solver/proto-model.ts +551 -0
- package/src/prove/smt/solver/pull-quant.ts +139 -0
- package/src/prove/smt/solver/qe-lite-der.ts +526 -0
- package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
- package/src/prove/smt/solver/qe-lite.ts +381 -0
- package/src/prove/smt/solver/qi-queue.ts +362 -0
- package/src/prove/smt/solver/quant-tactics.ts +117 -0
- package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
- package/src/prove/smt/solver/quantifier-manager.ts +186 -0
- package/src/prove/smt/solver/random-gen.ts +10 -0
- package/src/prove/smt/solver/rational.ts +165 -0
- package/src/prove/smt/solver/ref-vector.ts +62 -0
- package/src/prove/smt/solver/relevancy.ts +247 -0
- package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
- package/src/prove/smt/solver/rewriter.ts +843 -0
- package/src/prove/smt/solver/rlimit.ts +79 -0
- package/src/prove/smt/solver/smtlib-parser.ts +526 -0
- package/src/prove/smt/solver/solver.ts +71 -0
- package/src/prove/smt/solver/sort.ts +35 -0
- package/src/prove/smt/solver/sticky-generations.ts +69 -0
- package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
- package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
- package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
- package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
- package/src/prove/smt/solver/theory-lra-model.ts +243 -0
- package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
- package/src/prove/smt/solver/theory-lra-state.ts +43 -0
- package/src/prove/smt/solver/theory-lra.ts +56 -0
- package/src/prove/smt/solver/var-subst.ts +258 -0
- package/src/prove/smt/solver/z3-license.txt +10 -0
- package/src/prove/smt/table.ts +170 -0
- package/src/prove/tlapm/tlapm.ts +96 -0
- package/src/prove/tlaps-module.ts +510 -0
- package/src/prove/verdict.ts +18 -0
- package/src/prove/zenon/LICENSE +32 -0
- package/src/prove/zenon/check/check.ts +105 -0
- package/src/prove/zenon/check/definitions.ts +144 -0
- package/src/prove/zenon/check/equality.ts +182 -0
- package/src/prove/zenon/check/functions.ts +62 -0
- package/src/prove/zenon/check/keys.ts +125 -0
- package/src/prove/zenon/check/propositional.ts +104 -0
- package/src/prove/zenon/check/records.ts +188 -0
- package/src/prove/zenon/check/relations.ts +121 -0
- package/src/prove/zenon/check/rewrites.ts +224 -0
- package/src/prove/zenon/check/sets.ts +302 -0
- package/src/prove/zenon/check/terms.ts +127 -0
- package/src/prove/zenon/check/tla.ts +126 -0
- package/src/prove/zenon/decide.ts +113 -0
- package/src/prove/zenon/encode.ts +437 -0
- package/src/prove/zenon/eqrel.ts +300 -0
- package/src/prove/zenon/equality-rules.ts +435 -0
- package/src/prove/zenon/expr.ts +551 -0
- package/src/prove/zenon/index-table.ts +350 -0
- package/src/prove/zenon/isar-case.ts +513 -0
- package/src/prove/zenon/isar.ts +1249 -0
- package/src/prove/zenon/limits.ts +15 -0
- package/src/prove/zenon/llproof.ts +173 -0
- package/src/prove/zenon/mltoll.ts +1566 -0
- package/src/prove/zenon/node.ts +297 -0
- package/src/prove/zenon/ocaml.ts +169 -0
- package/src/prove/zenon/parse.ts +247 -0
- package/src/prove/zenon/phrase.ts +191 -0
- package/src/prove/zenon/proof.ts +198 -0
- package/src/prove/zenon/propositional-rules.ts +387 -0
- package/src/prove/zenon/rules.ts +94 -0
- package/src/prove/zenon/search.ts +288 -0
- package/src/prove/zenon/tla/functions.ts +151 -0
- package/src/prove/zenon/tla/llproof.ts +480 -0
- package/src/prove/zenon/tla/records.ts +225 -0
- package/src/prove/zenon/tla/rewrites.ts +447 -0
- package/src/prove/zenon/tla/sets.ts +304 -0
- package/src/prove/zenon/tla/terms.ts +181 -0
- package/src/prove/zenon/tla/tla.ts +506 -0
- package/src/run-cli.ts +334 -75
- package/src/standard-modules.ts +5 -2
- package/src/successors.ts +24 -5
- package/src/tlapm-cache.ts +236 -0
- package/src/tlc-random.ts +55 -32
- package/src/tlc-version.ts +8 -7
- package/src/values.ts +80 -35
- package/src/worker.ts +65 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
|
@@ -0,0 +1,304 @@
|
|
|
1
|
+
// Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
|
|
2
|
+
//
|
|
3
|
+
// The rules for sets: membership in each kind of set, set equality and inclusion.
|
|
4
|
+
|
|
5
|
+
import { isApp, type Expr } from "../expr";
|
|
6
|
+
import type { Priority } from "../node";
|
|
7
|
+
import { makeRule, type Rule } from "../proof";
|
|
8
|
+
import {
|
|
9
|
+
equal,
|
|
10
|
+
getBranches,
|
|
11
|
+
isConstructor,
|
|
12
|
+
isVariable,
|
|
13
|
+
makeExtensionNode,
|
|
14
|
+
makeInstanceNode,
|
|
15
|
+
member,
|
|
16
|
+
SET_CONSTRUCTORS,
|
|
17
|
+
type Item,
|
|
18
|
+
type Literal,
|
|
19
|
+
} from "./terms";
|
|
20
|
+
|
|
21
|
+
const decomposeAdd = (set: Expr): [Expr[], Expr] => {
|
|
22
|
+
const elements: Expr[] = [];
|
|
23
|
+
let rest = set;
|
|
24
|
+
while (isApp(rest, "TLA.addElt", 2)) {
|
|
25
|
+
elements.push(rest.args[0]);
|
|
26
|
+
rest = rest.args[1];
|
|
27
|
+
}
|
|
28
|
+
return [elements, rest];
|
|
29
|
+
};
|
|
30
|
+
|
|
31
|
+
export const getMembershipNodes = (literal: Literal): Item[] | undefined => {
|
|
32
|
+
const exprs = literal.context.exprs;
|
|
33
|
+
const formula = literal.formula;
|
|
34
|
+
const isNegated = literal.isNegated;
|
|
35
|
+
const relation = literal.relation;
|
|
36
|
+
const node = (priority: Priority, rule: Rule, branches: Expr[][]) =>
|
|
37
|
+
makeExtensionNode(literal, priority, rule, branches);
|
|
38
|
+
const instance = (priority: Priority, quantified: Expr, term: Expr) =>
|
|
39
|
+
makeInstanceNode(literal, priority, quantified, term);
|
|
40
|
+
if (relation?.symbol === "TLA.in") {
|
|
41
|
+
const element = relation.args[0];
|
|
42
|
+
const set = relation.args[1];
|
|
43
|
+
if (!isNegated && isVariable(set, "TLA.emptyset"))
|
|
44
|
+
return node("prop", makeRule("in_emptyset", [formula, element]), []);
|
|
45
|
+
if (isApp(set, "TLA.upair", 2)) {
|
|
46
|
+
const first = equal(exprs, element, set.args[0]);
|
|
47
|
+
const second = equal(exprs, element, set.args[1]);
|
|
48
|
+
return isNegated
|
|
49
|
+
? node(
|
|
50
|
+
"prop",
|
|
51
|
+
makeRule("notin_upair", [
|
|
52
|
+
formula,
|
|
53
|
+
exprs.enot(first),
|
|
54
|
+
exprs.enot(second),
|
|
55
|
+
element,
|
|
56
|
+
set.args[0],
|
|
57
|
+
set.args[1],
|
|
58
|
+
]),
|
|
59
|
+
[[exprs.enot(first), exprs.enot(second)]],
|
|
60
|
+
)
|
|
61
|
+
: node(
|
|
62
|
+
"prop",
|
|
63
|
+
makeRule("in_upair", [formula, first, second, element, set.args[0], set.args[1]]),
|
|
64
|
+
[[first], [second]],
|
|
65
|
+
);
|
|
66
|
+
}
|
|
67
|
+
if (isApp(set, "TLA.addElt", 2)) {
|
|
68
|
+
const decomposed = decomposeAdd(set);
|
|
69
|
+
const isEmptyRest = decomposed[1] === exprs.evar("TLA.emptyset");
|
|
70
|
+
if (!isNegated) {
|
|
71
|
+
const equalities = decomposed[0].map((inner) => equal(exprs, element, inner));
|
|
72
|
+
const formulas = isEmptyRest
|
|
73
|
+
? equalities
|
|
74
|
+
: [...equalities, member(exprs, element, decomposed[1])];
|
|
75
|
+
return node("prop", makeRule("in_addElt", [formula, element, set]), getBranches(formulas));
|
|
76
|
+
}
|
|
77
|
+
const inequalities = decomposed[0].map((inner) => exprs.enot(equal(exprs, element, inner)));
|
|
78
|
+
const formulas = isEmptyRest
|
|
79
|
+
? inequalities
|
|
80
|
+
: [exprs.enot(member(exprs, element, decomposed[1])), ...inequalities];
|
|
81
|
+
return node("prop", makeRule("notin_addElt", [formula, element, set]), [formulas]);
|
|
82
|
+
}
|
|
83
|
+
if (isApp(set, "TLA.set"))
|
|
84
|
+
return isNegated
|
|
85
|
+
? node("prop", makeRule("notin_set", [formula, element, set]), [
|
|
86
|
+
set.args.map((inner) => exprs.enot(equal(exprs, element, inner))),
|
|
87
|
+
])
|
|
88
|
+
: node(
|
|
89
|
+
"prop",
|
|
90
|
+
makeRule("in_set", [formula, element, set]),
|
|
91
|
+
getBranches(set.args.map((inner) => equal(exprs, element, inner))),
|
|
92
|
+
);
|
|
93
|
+
if (isNegated && set.kind === "meta")
|
|
94
|
+
return instance({ instance: set.args[0] }, set.args[0], exprs.eapp("TLA.set", [element]));
|
|
95
|
+
if (isApp(set, "TLA.SUBSET", 1)) {
|
|
96
|
+
const subset = exprs.eapp("TLA.subseteq", [element, set.args[0]]);
|
|
97
|
+
return isNegated
|
|
98
|
+
? node(
|
|
99
|
+
"prop",
|
|
100
|
+
makeRule("notin_SUBSET", [formula, exprs.enot(subset), element, set.args[0]]),
|
|
101
|
+
[[exprs.enot(subset)]],
|
|
102
|
+
)
|
|
103
|
+
: node("prop", makeRule("in_SUBSET", [formula, subset, element, set.args[0]]), [[subset]]);
|
|
104
|
+
}
|
|
105
|
+
if (isApp(set, "TLA.UNION", 1)) {
|
|
106
|
+
const bound = exprs.newVar();
|
|
107
|
+
const exists = exprs.eex(
|
|
108
|
+
bound,
|
|
109
|
+
"",
|
|
110
|
+
exprs.eand(member(exprs, bound, set.args[0]), member(exprs, element, bound)),
|
|
111
|
+
);
|
|
112
|
+
return isNegated
|
|
113
|
+
? node(
|
|
114
|
+
"arity",
|
|
115
|
+
makeRule("notin_UNION", [formula, exprs.enot(exists), element, set.args[0]]),
|
|
116
|
+
[[exprs.enot(exists)]],
|
|
117
|
+
)
|
|
118
|
+
: node("prop", makeRule("in_UNION", [formula, exists, element, set.args[0]]), [[exists]]);
|
|
119
|
+
}
|
|
120
|
+
const binarySetRules: Record<
|
|
121
|
+
string,
|
|
122
|
+
[
|
|
123
|
+
"in_cup" | "in_cap" | "in_setminus",
|
|
124
|
+
"notin_cup" | "notin_cap" | "notin_setminus",
|
|
125
|
+
boolean,
|
|
126
|
+
boolean,
|
|
127
|
+
]
|
|
128
|
+
> = {
|
|
129
|
+
"TLA.cup": ["in_cup", "notin_cup", true, false],
|
|
130
|
+
"TLA.cap": ["in_cap", "notin_cap", false, true],
|
|
131
|
+
"TLA.setminus": ["in_setminus", "notin_setminus", false, true],
|
|
132
|
+
};
|
|
133
|
+
const binarySetRule = set.kind === "app" ? binarySetRules[set.symbol] : undefined;
|
|
134
|
+
if (binarySetRule !== undefined && set.args.length === 2) {
|
|
135
|
+
const first = member(exprs, element, set.args[0]);
|
|
136
|
+
const secondPositive = member(exprs, element, set.args[1]);
|
|
137
|
+
const isMinus = set.symbol === "TLA.setminus";
|
|
138
|
+
const second = isMinus !== isNegated ? exprs.enot(secondPositive) : secondPositive;
|
|
139
|
+
const firstLiteral = isNegated ? exprs.enot(first) : first;
|
|
140
|
+
const isSplit = isNegated ? binarySetRule[3] : binarySetRule[2];
|
|
141
|
+
return node(
|
|
142
|
+
"prop",
|
|
143
|
+
makeRule(isNegated ? binarySetRule[1] : binarySetRule[0], [
|
|
144
|
+
formula,
|
|
145
|
+
firstLiteral,
|
|
146
|
+
second,
|
|
147
|
+
element,
|
|
148
|
+
set.args[0],
|
|
149
|
+
set.args[1],
|
|
150
|
+
]),
|
|
151
|
+
isSplit ? [[firstLiteral], [second]] : [[firstLiteral, second]],
|
|
152
|
+
);
|
|
153
|
+
}
|
|
154
|
+
if (isApp(set, "TLA.subsetOf", 2) && set.args[1].kind === "lam") {
|
|
155
|
+
const predicate = set.args[1];
|
|
156
|
+
const inBase = member(exprs, element, set.args[0]);
|
|
157
|
+
const holds = exprs.substitute([[predicate.args[0], element]], predicate.args[1]);
|
|
158
|
+
return isNegated
|
|
159
|
+
? node(
|
|
160
|
+
"prop",
|
|
161
|
+
makeRule("notin_subsetof", [
|
|
162
|
+
formula,
|
|
163
|
+
exprs.enot(inBase),
|
|
164
|
+
exprs.enot(holds),
|
|
165
|
+
element,
|
|
166
|
+
set.args[0],
|
|
167
|
+
predicate,
|
|
168
|
+
]),
|
|
169
|
+
[[exprs.enot(inBase)], [exprs.enot(holds)]],
|
|
170
|
+
)
|
|
171
|
+
: node(
|
|
172
|
+
"prop",
|
|
173
|
+
makeRule("in_subsetof", [formula, inBase, holds, element, set.args[0], predicate]),
|
|
174
|
+
[[inBase, holds]],
|
|
175
|
+
);
|
|
176
|
+
}
|
|
177
|
+
if (isApp(set, "TLA.setOfAll", 2) && set.args[1].kind === "lam") {
|
|
178
|
+
const predicate = set.args[1];
|
|
179
|
+
const bound = exprs.newVar();
|
|
180
|
+
const exists = exprs.eex(
|
|
181
|
+
bound,
|
|
182
|
+
"",
|
|
183
|
+
exprs.eand(
|
|
184
|
+
member(exprs, bound, set.args[0]),
|
|
185
|
+
equal(exprs, element, exprs.substitute([[predicate.args[0], bound]], predicate.args[1])),
|
|
186
|
+
),
|
|
187
|
+
);
|
|
188
|
+
const result = isNegated ? exprs.enot(exists) : exists;
|
|
189
|
+
return node(
|
|
190
|
+
{ instance: result },
|
|
191
|
+
makeRule(isNegated ? "notin_setofall" : "in_setofall", [
|
|
192
|
+
formula,
|
|
193
|
+
result,
|
|
194
|
+
element,
|
|
195
|
+
set.args[0],
|
|
196
|
+
predicate,
|
|
197
|
+
]),
|
|
198
|
+
[[result]],
|
|
199
|
+
);
|
|
200
|
+
}
|
|
201
|
+
}
|
|
202
|
+
return undefined;
|
|
203
|
+
};
|
|
204
|
+
|
|
205
|
+
export const getSetEqualityNodes = (literal: Literal): Item[] | undefined => {
|
|
206
|
+
const exprs = literal.context.exprs;
|
|
207
|
+
const formula = literal.formula;
|
|
208
|
+
const isNegated = literal.isNegated;
|
|
209
|
+
const relation = literal.relation;
|
|
210
|
+
const node = (priority: Priority, rule: Rule, branches: Expr[][]) =>
|
|
211
|
+
makeExtensionNode(literal, priority, rule, branches);
|
|
212
|
+
if (relation?.symbol !== "=") return undefined;
|
|
213
|
+
const left = relation.args[0];
|
|
214
|
+
const right = relation.args[1];
|
|
215
|
+
if (!isNegated && isVariable(right, "TLA.emptyset")) {
|
|
216
|
+
const bound = exprs.newVar();
|
|
217
|
+
const empty = exprs.eall(bound, "", exprs.enot(member(exprs, bound, left)));
|
|
218
|
+
return node("arity", makeRule("setequalempty", [formula, empty, left]), [[empty]]);
|
|
219
|
+
}
|
|
220
|
+
if (!isNegated && isVariable(left, "TLA.emptyset")) {
|
|
221
|
+
const bound = exprs.newVar();
|
|
222
|
+
const empty = exprs.eall(bound, "", exprs.enot(member(exprs, bound, right)));
|
|
223
|
+
return node("arity", makeRule("setemptyequal", [formula, empty, right]), [[empty]]);
|
|
224
|
+
}
|
|
225
|
+
if (isConstructor(SET_CONSTRUCTORS, left) || isConstructor(SET_CONSTRUCTORS, right)) {
|
|
226
|
+
const bound = exprs.newVar();
|
|
227
|
+
const extensional = exprs.eall(
|
|
228
|
+
bound,
|
|
229
|
+
"",
|
|
230
|
+
exprs.eequiv(member(exprs, bound, left), member(exprs, bound, right)),
|
|
231
|
+
);
|
|
232
|
+
const result = isNegated ? exprs.enot(extensional) : extensional;
|
|
233
|
+
return node(
|
|
234
|
+
{ instance: result },
|
|
235
|
+
makeRule(isNegated ? "notsetequal" : "setequal", [formula, result, left, right]),
|
|
236
|
+
[[result]],
|
|
237
|
+
);
|
|
238
|
+
}
|
|
239
|
+
return undefined;
|
|
240
|
+
};
|
|
241
|
+
|
|
242
|
+
// A metavariable in a set, against the disequalities of that set.
|
|
243
|
+
export const getMetaMembershipNodes = (literal: Literal): Item[] | undefined => {
|
|
244
|
+
const exprs = literal.context.exprs;
|
|
245
|
+
const index = literal.context.index;
|
|
246
|
+
const relation = literal.relation;
|
|
247
|
+
const node = (priority: Priority, rule: Rule, branches: Expr[][]) =>
|
|
248
|
+
makeExtensionNode(literal, priority, rule, branches);
|
|
249
|
+
if (relation?.symbol === "TLA.in" && relation.args[0].kind === "meta") {
|
|
250
|
+
const bound = exprs.newVar();
|
|
251
|
+
return index.findDisequalities(relation.args[1]).flatMap((disequality) => {
|
|
252
|
+
const sides: Expr[] = disequality.args[0].args;
|
|
253
|
+
const different = exprs.enot(
|
|
254
|
+
exprs.eall(
|
|
255
|
+
bound,
|
|
256
|
+
"",
|
|
257
|
+
exprs.eequiv(member(exprs, bound, sides[0]), member(exprs, bound, sides[1])),
|
|
258
|
+
),
|
|
259
|
+
);
|
|
260
|
+
return node(
|
|
261
|
+
{ instance: different },
|
|
262
|
+
makeRule("notsetequal", [disequality, different, sides[0], sides[1]]),
|
|
263
|
+
[[different]],
|
|
264
|
+
);
|
|
265
|
+
});
|
|
266
|
+
}
|
|
267
|
+
return undefined;
|
|
268
|
+
};
|
|
269
|
+
|
|
270
|
+
export const getSubsetNodes = (literal: Literal): Item[] | undefined => {
|
|
271
|
+
const exprs = literal.context.exprs;
|
|
272
|
+
const formula = literal.formula;
|
|
273
|
+
const isNegated = literal.isNegated;
|
|
274
|
+
const relation = literal.relation;
|
|
275
|
+
const node = (priority: Priority, rule: Rule, branches: Expr[][]) =>
|
|
276
|
+
makeExtensionNode(literal, priority, rule, branches);
|
|
277
|
+
if (relation?.symbol === "TLA.subseteq") {
|
|
278
|
+
const left = relation.args[0];
|
|
279
|
+
const right = relation.args[1];
|
|
280
|
+
if (isApp(left, "TLA.cup", 2)) {
|
|
281
|
+
const first = exprs.eapp("TLA.subseteq", [left.args[0], right]);
|
|
282
|
+
const second = exprs.eapp("TLA.subseteq", [left.args[1], right]);
|
|
283
|
+
return isNegated
|
|
284
|
+
? node(
|
|
285
|
+
"arity",
|
|
286
|
+
makeRule("not_cup_subseteq", [formula, exprs.enot(first), exprs.enot(second)]),
|
|
287
|
+
[[exprs.enot(first)], [exprs.enot(second)]],
|
|
288
|
+
)
|
|
289
|
+
: node("arity", makeRule("cup_subseteq", [formula, first, second]), [[first, second]]);
|
|
290
|
+
}
|
|
291
|
+
if (isApp(right, "TLA.cap", 2)) {
|
|
292
|
+
// Zenon builds the same subset twice here, from the second set.
|
|
293
|
+
const subset = exprs.eapp("TLA.subseteq", [left, right.args[1]]);
|
|
294
|
+
return isNegated
|
|
295
|
+
? node(
|
|
296
|
+
"arity",
|
|
297
|
+
makeRule("not_subseteq_cap", [formula, exprs.enot(subset), exprs.enot(subset)]),
|
|
298
|
+
[[exprs.enot(subset)], [exprs.enot(subset)]],
|
|
299
|
+
)
|
|
300
|
+
: node("arity", makeRule("subseteq_cap", [formula, subset, subset]), [[subset, subset]]);
|
|
301
|
+
}
|
|
302
|
+
}
|
|
303
|
+
return undefined;
|
|
304
|
+
};
|
|
@@ -0,0 +1,181 @@
|
|
|
1
|
+
// Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
|
|
2
|
+
//
|
|
3
|
+
// What the rules of the TLA+ extension share: the symbols it knows, a literal taken apart, and the
|
|
4
|
+
// nodes it makes.
|
|
5
|
+
|
|
6
|
+
import { TlaZenonError } from "../../../errors";
|
|
7
|
+
import { isApp, isRelation, type Expr, type Expressions, type RelationExpr } from "../expr";
|
|
8
|
+
import type { Index } from "../index-table";
|
|
9
|
+
import type { Node, Priority } from "../node";
|
|
10
|
+
import { makeRule, type Rule } from "../proof";
|
|
11
|
+
|
|
12
|
+
// A node, or Zenon's Stop: the rules after it don't apply to the formula.
|
|
13
|
+
export type Item = Node | "stop";
|
|
14
|
+
|
|
15
|
+
export const SET_CONSTRUCTORS = [
|
|
16
|
+
"TLA.emptyset",
|
|
17
|
+
"TLA.upair",
|
|
18
|
+
"TLA.addElt",
|
|
19
|
+
"TLA.set",
|
|
20
|
+
"TLA.infinity",
|
|
21
|
+
"TLA.SUBSET",
|
|
22
|
+
"TLA.UNION",
|
|
23
|
+
"TLA.INTER",
|
|
24
|
+
"TLA.cup",
|
|
25
|
+
"TLA.cap",
|
|
26
|
+
"TLA.setminus",
|
|
27
|
+
"TLA.subsetOf",
|
|
28
|
+
"TLA.setOfAll",
|
|
29
|
+
"TLA.FuncSet",
|
|
30
|
+
"TLA.DOMAIN",
|
|
31
|
+
"TLA.Product",
|
|
32
|
+
"arith.N",
|
|
33
|
+
"arith.Z",
|
|
34
|
+
"arith.R",
|
|
35
|
+
"arith.natrange",
|
|
36
|
+
"arith.intrange",
|
|
37
|
+
"TLA.Seq",
|
|
38
|
+
"TLA.recordset",
|
|
39
|
+
];
|
|
40
|
+
|
|
41
|
+
export const FUNCTION_CONSTRUCTORS = ["TLA.Fcn", "TLA.except", "TLA.oneArg", "TLA.extend"];
|
|
42
|
+
|
|
43
|
+
const OTHER_SYMBOLS = [
|
|
44
|
+
"TLA.in",
|
|
45
|
+
"TLA.isAFcn",
|
|
46
|
+
"TLA.cond",
|
|
47
|
+
"TLA.CASE",
|
|
48
|
+
"TLA.tuple",
|
|
49
|
+
"TLA.record",
|
|
50
|
+
"TLA.fapply",
|
|
51
|
+
"TLA.box",
|
|
52
|
+
];
|
|
53
|
+
|
|
54
|
+
// The symbols that hypotheses can't define, as Zenon's predef with the tla extension.
|
|
55
|
+
export const PREDEFINED_SYMBOLS = [
|
|
56
|
+
"=",
|
|
57
|
+
...SET_CONSTRUCTORS,
|
|
58
|
+
...FUNCTION_CONSTRUCTORS,
|
|
59
|
+
...OTHER_SYMBOLS,
|
|
60
|
+
];
|
|
61
|
+
|
|
62
|
+
export const isVariable = (expression: Expr, name: string) =>
|
|
63
|
+
expression.kind === "var" && expression.symbol === name;
|
|
64
|
+
|
|
65
|
+
export const isConstructor = (constructors: string[], expression: Expr) =>
|
|
66
|
+
(expression.kind === "var" || expression.kind === "app") &&
|
|
67
|
+
constructors.includes(expression.symbol);
|
|
68
|
+
|
|
69
|
+
export const isNotEquiv = (expression: Expr) => isApp(expression, "$notequiv");
|
|
70
|
+
|
|
71
|
+
export const isString = (expression: Expr) => isApp(expression, "$string");
|
|
72
|
+
|
|
73
|
+
export const equal = (exprs: Expressions, left: Expr, right: Expr) =>
|
|
74
|
+
exprs.eapp("=", [left, right]);
|
|
75
|
+
|
|
76
|
+
export const member = (exprs: Expressions, element: Expr, set: Expr) =>
|
|
77
|
+
exprs.eapp("TLA.in", [element, set]);
|
|
78
|
+
|
|
79
|
+
export const fapply = (exprs: Expressions, fcn: Expr, argument: Expr) =>
|
|
80
|
+
exprs.eapp("TLA.fapply", [fcn, argument]);
|
|
81
|
+
|
|
82
|
+
export const domain = (exprs: Expressions, fcn: Expr) => exprs.eapp("TLA.DOMAIN", [fcn]);
|
|
83
|
+
|
|
84
|
+
export const getBranches = (formulas: Expr[]) => formulas.map((formula) => [formula]);
|
|
85
|
+
|
|
86
|
+
export const makeNatural = (exprs: Expressions, count: number) => {
|
|
87
|
+
let result: Expr = exprs.evar("0");
|
|
88
|
+
for (let index = 0; index < count; index++)
|
|
89
|
+
result = fapply(exprs, exprs.evar("TLA.Succ"), result);
|
|
90
|
+
return result;
|
|
91
|
+
};
|
|
92
|
+
|
|
93
|
+
export const isTriviallyNotIn = (element: Expr, set: Expr) =>
|
|
94
|
+
isString(element) &&
|
|
95
|
+
isApp(set, "TLA.set") &&
|
|
96
|
+
set.args.every((inner) => isString(inner) && inner !== element);
|
|
97
|
+
|
|
98
|
+
export const getPairs = (args: Expr[]) => {
|
|
99
|
+
const pairs: [Expr, Expr][] = [];
|
|
100
|
+
for (let index = 0; index + 1 < args.length; index += 2)
|
|
101
|
+
pairs.push([args[index], args[index + 1]]);
|
|
102
|
+
return pairs;
|
|
103
|
+
};
|
|
104
|
+
|
|
105
|
+
export interface TlaContext {
|
|
106
|
+
index: Index;
|
|
107
|
+
exprs: Expressions;
|
|
108
|
+
}
|
|
109
|
+
|
|
110
|
+
// A formula that the propositional rules look at: a literal, its atom and, when the atom relates
|
|
111
|
+
// two terms, the atom as a relation.
|
|
112
|
+
export interface Literal {
|
|
113
|
+
context: TlaContext;
|
|
114
|
+
formula: Expr;
|
|
115
|
+
goalness: number;
|
|
116
|
+
isNegated: boolean;
|
|
117
|
+
atom: Expr;
|
|
118
|
+
relation: RelationExpr | undefined;
|
|
119
|
+
}
|
|
120
|
+
|
|
121
|
+
export const getLiteral = (context: TlaContext, formula: Expr, goalness: number): Literal => {
|
|
122
|
+
const atom = formula.kind === "not" ? formula.args[0] : formula;
|
|
123
|
+
return {
|
|
124
|
+
context,
|
|
125
|
+
formula,
|
|
126
|
+
goalness,
|
|
127
|
+
isNegated: formula.kind === "not",
|
|
128
|
+
atom,
|
|
129
|
+
relation: isRelation(atom) ? atom : undefined,
|
|
130
|
+
};
|
|
131
|
+
};
|
|
132
|
+
|
|
133
|
+
export const makeExtensionNode = (
|
|
134
|
+
literal: Literal,
|
|
135
|
+
priority: Priority,
|
|
136
|
+
rule: Rule,
|
|
137
|
+
branches: Expr[][],
|
|
138
|
+
): Node[] => [
|
|
139
|
+
{
|
|
140
|
+
conclusions: [literal.formula],
|
|
141
|
+
rule,
|
|
142
|
+
priority,
|
|
143
|
+
goalness: literal.goalness,
|
|
144
|
+
branches,
|
|
145
|
+
},
|
|
146
|
+
];
|
|
147
|
+
|
|
148
|
+
export const makeInstanceNode = (
|
|
149
|
+
literal: Literal,
|
|
150
|
+
priority: Priority,
|
|
151
|
+
quantified: Expr,
|
|
152
|
+
term: Expr,
|
|
153
|
+
): Node[] => {
|
|
154
|
+
const exprs = literal.context.exprs;
|
|
155
|
+
const goalness = literal.goalness;
|
|
156
|
+
if (quantified.kind === "all")
|
|
157
|
+
return [
|
|
158
|
+
{
|
|
159
|
+
conclusions: [quantified],
|
|
160
|
+
rule: makeRule("all", [quantified, term]),
|
|
161
|
+
priority,
|
|
162
|
+
goalness,
|
|
163
|
+
branches: [[exprs.substitute([[quantified.args[0], term]], quantified.args[1])]],
|
|
164
|
+
},
|
|
165
|
+
];
|
|
166
|
+
if (quantified.kind === "ex") {
|
|
167
|
+
const negated = exprs.enot(quantified);
|
|
168
|
+
return [
|
|
169
|
+
{
|
|
170
|
+
conclusions: [negated],
|
|
171
|
+
rule: makeRule("not_ex", [negated, term]),
|
|
172
|
+
priority,
|
|
173
|
+
goalness,
|
|
174
|
+
branches: [
|
|
175
|
+
[exprs.substitute([[quantified.args[0], term]], exprs.enot(quantified.args[1]))],
|
|
176
|
+
],
|
|
177
|
+
},
|
|
178
|
+
];
|
|
179
|
+
}
|
|
180
|
+
throw new TlaZenonError("Zenon: instantiating a formula that isn't quantified");
|
|
181
|
+
};
|