@stevenvo780/st-lang 4.3.0 → 4.5.0
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/dist/coinduction/index.d.ts +136 -0
- package/dist/coinduction/index.d.ts.map +1 -0
- package/dist/coinduction/index.js +318 -0
- package/dist/coinduction/index.js.map +1 -0
- package/dist/combinators-ski/abstract.d.ts +5 -0
- package/dist/combinators-ski/abstract.d.ts.map +1 -0
- package/dist/combinators-ski/abstract.js +88 -0
- package/dist/combinators-ski/abstract.js.map +1 -0
- package/dist/combinators-ski/index.d.ts +6 -0
- package/dist/combinators-ski/index.d.ts.map +1 -0
- package/dist/combinators-ski/index.js +30 -0
- package/dist/combinators-ski/index.js.map +1 -0
- package/dist/combinators-ski/reduce.d.ts +10 -0
- package/dist/combinators-ski/reduce.d.ts.map +1 -0
- package/dist/combinators-ski/reduce.js +118 -0
- package/dist/combinators-ski/reduce.js.map +1 -0
- package/dist/combinators-ski/types.d.ts +23 -0
- package/dist/combinators-ski/types.d.ts.map +1 -0
- package/dist/combinators-ski/types.js +102 -0
- package/dist/combinators-ski/types.js.map +1 -0
- package/dist/constructive-reals/index.d.ts +132 -0
- package/dist/constructive-reals/index.d.ts.map +1 -0
- package/dist/constructive-reals/index.js +723 -0
- package/dist/constructive-reals/index.js.map +1 -0
- package/dist/game-semantics/convert.d.ts +4 -0
- package/dist/game-semantics/convert.d.ts.map +1 -0
- package/dist/game-semantics/convert.js +28 -0
- package/dist/game-semantics/convert.js.map +1 -0
- package/dist/game-semantics/index.d.ts +6 -0
- package/dist/game-semantics/index.d.ts.map +1 -0
- package/dist/game-semantics/index.js +28 -0
- package/dist/game-semantics/index.js.map +1 -0
- package/dist/game-semantics/strategy.d.ts +34 -0
- package/dist/game-semantics/strategy.d.ts.map +1 -0
- package/dist/game-semantics/strategy.js +336 -0
- package/dist/game-semantics/strategy.js.map +1 -0
- package/dist/game-semantics/types.d.ts +64 -0
- package/dist/game-semantics/types.d.ts.map +1 -0
- package/dist/game-semantics/types.js +78 -0
- package/dist/game-semantics/types.js.map +1 -0
- package/dist/higher-order-unify/index.d.ts +5 -0
- package/dist/higher-order-unify/index.d.ts.map +1 -0
- package/dist/higher-order-unify/index.js +27 -0
- package/dist/higher-order-unify/index.js.map +1 -0
- package/dist/higher-order-unify/normalize.d.ts +14 -0
- package/dist/higher-order-unify/normalize.d.ts.map +1 -0
- package/dist/higher-order-unify/normalize.js +191 -0
- package/dist/higher-order-unify/normalize.js.map +1 -0
- package/dist/higher-order-unify/pattern.d.ts +4 -0
- package/dist/higher-order-unify/pattern.d.ts.map +1 -0
- package/dist/higher-order-unify/pattern.js +70 -0
- package/dist/higher-order-unify/pattern.js.map +1 -0
- package/dist/higher-order-unify/types.d.ts +19 -0
- package/dist/higher-order-unify/types.d.ts.map +1 -0
- package/dist/higher-order-unify/types.js +14 -0
- package/dist/higher-order-unify/types.js.map +1 -0
- package/dist/higher-order-unify/unify.d.ts +5 -0
- package/dist/higher-order-unify/unify.d.ts.map +1 -0
- package/dist/higher-order-unify/unify.js +306 -0
- package/dist/higher-order-unify/unify.js.map +1 -0
- package/dist/index.d.ts +4 -0
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +36 -2
- package/dist/index.js.map +1 -1
- package/dist/lambda-calc/church.d.ts.map +1 -1
- package/dist/lambda-calc/church.js.map +1 -1
- package/dist/lambda-calc/combinators.d.ts.map +1 -1
- package/dist/lambda-calc/combinators.js.map +1 -1
- package/dist/lambda-calc/index.d.ts +1 -1
- package/dist/lambda-calc/index.d.ts.map +1 -1
- package/dist/lambda-calc/index.js.map +1 -1
- package/dist/mltt/equality.d.ts +9 -0
- package/dist/mltt/equality.d.ts.map +1 -0
- package/dist/mltt/equality.js +79 -0
- package/dist/mltt/equality.js.map +1 -0
- package/dist/mltt/index.d.ts +8 -0
- package/dist/mltt/index.d.ts.map +1 -0
- package/dist/mltt/index.js +49 -0
- package/dist/mltt/index.js.map +1 -0
- package/dist/mltt/infer.d.ts +17 -0
- package/dist/mltt/infer.d.ts.map +1 -0
- package/dist/mltt/infer.js +269 -0
- package/dist/mltt/infer.js.map +1 -0
- package/dist/mltt/normalize.d.ts +7 -0
- package/dist/mltt/normalize.d.ts.map +1 -0
- package/dist/mltt/normalize.js +131 -0
- package/dist/mltt/normalize.js.map +1 -0
- package/dist/mltt/substitute.d.ts +4 -0
- package/dist/mltt/substitute.d.ts.map +1 -0
- package/dist/mltt/substitute.js +94 -0
- package/dist/mltt/substitute.js.map +1 -0
- package/dist/mltt/types.d.ts +72 -0
- package/dist/mltt/types.d.ts.map +1 -0
- package/dist/mltt/types.js +211 -0
- package/dist/mltt/types.js.map +1 -0
- package/dist/nbe/index.d.ts +3 -0
- package/dist/nbe/index.d.ts.map +1 -0
- package/dist/nbe/index.js +25 -0
- package/dist/nbe/index.js.map +1 -0
- package/dist/nbe/nbe.d.ts +7 -0
- package/dist/nbe/nbe.d.ts.map +1 -0
- package/dist/nbe/nbe.js +118 -0
- package/dist/nbe/nbe.js.map +1 -0
- package/dist/nbe/types.d.ts +54 -0
- package/dist/nbe/types.d.ts.map +1 -0
- package/dist/nbe/types.js +117 -0
- package/dist/nbe/types.js.map +1 -0
- package/dist/profile-bridge/index.d.ts +64 -0
- package/dist/profile-bridge/index.d.ts.map +1 -0
- package/dist/profile-bridge/index.js +328 -0
- package/dist/profile-bridge/index.js.map +1 -0
- package/dist/profiles/many-valued/index.d.ts.map +1 -1
- package/dist/profiles/many-valued/index.js.map +1 -1
- package/dist/profiles/mu-calculus/check.d.ts +15 -0
- package/dist/profiles/mu-calculus/check.d.ts.map +1 -0
- package/dist/profiles/mu-calculus/check.js +172 -0
- package/dist/profiles/mu-calculus/check.js.map +1 -0
- package/dist/profiles/mu-calculus/ctl-translate.d.ts +61 -0
- package/dist/profiles/mu-calculus/ctl-translate.d.ts.map +1 -0
- package/dist/profiles/mu-calculus/ctl-translate.js +181 -0
- package/dist/profiles/mu-calculus/ctl-translate.js.map +1 -0
- package/dist/profiles/mu-calculus/index.d.ts +7 -0
- package/dist/profiles/mu-calculus/index.d.ts.map +1 -0
- package/dist/profiles/mu-calculus/index.js +33 -0
- package/dist/profiles/mu-calculus/index.js.map +1 -0
- package/dist/profiles/mu-calculus/types.d.ts +51 -0
- package/dist/profiles/mu-calculus/types.d.ts.map +1 -0
- package/dist/profiles/mu-calculus/types.js +42 -0
- package/dist/profiles/mu-calculus/types.js.map +1 -0
- package/dist/profiles/mu-calculus/wellformed.d.ts +40 -0
- package/dist/profiles/mu-calculus/wellformed.d.ts.map +1 -0
- package/dist/profiles/mu-calculus/wellformed.js +160 -0
- package/dist/profiles/mu-calculus/wellformed.js.map +1 -0
- package/dist/profiles/sequent-lk/cut-elimination.d.ts +11 -0
- package/dist/profiles/sequent-lk/cut-elimination.d.ts.map +1 -0
- package/dist/profiles/sequent-lk/cut-elimination.js +216 -0
- package/dist/profiles/sequent-lk/cut-elimination.js.map +1 -0
- package/dist/profiles/sequent-lk/index.d.ts +5 -0
- package/dist/profiles/sequent-lk/index.d.ts.map +1 -0
- package/dist/profiles/sequent-lk/index.js +24 -0
- package/dist/profiles/sequent-lk/index.js.map +1 -0
- package/dist/profiles/sequent-lk/prover.d.ts +25 -0
- package/dist/profiles/sequent-lk/prover.d.ts.map +1 -0
- package/dist/profiles/sequent-lk/prover.js +532 -0
- package/dist/profiles/sequent-lk/prover.js.map +1 -0
- package/dist/profiles/sequent-lk/types.d.ts +55 -0
- package/dist/profiles/sequent-lk/types.d.ts.map +1 -0
- package/dist/profiles/sequent-lk/types.js +18 -0
- package/dist/profiles/sequent-lk/types.js.map +1 -0
- package/dist/profiles/sequent-lk/util.d.ts +18 -0
- package/dist/profiles/sequent-lk/util.d.ts.map +1 -0
- package/dist/profiles/sequent-lk/util.js +71 -0
- package/dist/profiles/sequent-lk/util.js.map +1 -0
- package/dist/proof-nets/construct.d.ts +3 -0
- package/dist/proof-nets/construct.d.ts.map +1 -0
- package/dist/proof-nets/construct.js +85 -0
- package/dist/proof-nets/construct.js.map +1 -0
- package/dist/proof-nets/correctness.d.ts +3 -0
- package/dist/proof-nets/correctness.d.ts.map +1 -0
- package/dist/proof-nets/correctness.js +213 -0
- package/dist/proof-nets/correctness.js.map +1 -0
- package/dist/proof-nets/cut-elim.d.ts +9 -0
- package/dist/proof-nets/cut-elim.d.ts.map +1 -0
- package/dist/proof-nets/cut-elim.js +149 -0
- package/dist/proof-nets/cut-elim.js.map +1 -0
- package/dist/proof-nets/index.d.ts +6 -0
- package/dist/proof-nets/index.d.ts.map +1 -0
- package/dist/proof-nets/index.js +33 -0
- package/dist/proof-nets/index.js.map +1 -0
- package/dist/proof-nets/types.d.ts +36 -0
- package/dist/proof-nets/types.d.ts.map +1 -0
- package/dist/proof-nets/types.js +89 -0
- package/dist/proof-nets/types.js.map +1 -0
- package/dist/refinement-types/checker.d.ts +19 -0
- package/dist/refinement-types/checker.d.ts.map +1 -0
- package/dist/refinement-types/checker.js +248 -0
- package/dist/refinement-types/checker.js.map +1 -0
- package/dist/refinement-types/index.d.ts +11 -0
- package/dist/refinement-types/index.d.ts.map +1 -0
- package/dist/refinement-types/index.js +51 -0
- package/dist/refinement-types/index.js.map +1 -0
- package/dist/refinement-types/predicate.d.ts +31 -0
- package/dist/refinement-types/predicate.d.ts.map +1 -0
- package/dist/refinement-types/predicate.js +369 -0
- package/dist/refinement-types/predicate.js.map +1 -0
- package/dist/refinement-types/solver.d.ts +24 -0
- package/dist/refinement-types/solver.d.ts.map +1 -0
- package/dist/refinement-types/solver.js +207 -0
- package/dist/refinement-types/solver.js.map +1 -0
- package/dist/refinement-types/subtype.d.ts +14 -0
- package/dist/refinement-types/subtype.d.ts.map +1 -0
- package/dist/refinement-types/subtype.js +39 -0
- package/dist/refinement-types/subtype.js.map +1 -0
- package/dist/refinement-types/types.d.ts +64 -0
- package/dist/refinement-types/types.d.ts.map +1 -0
- package/dist/refinement-types/types.js +130 -0
- package/dist/refinement-types/types.js.map +1 -0
- package/dist/runtime/anti-unification/anti-unify.d.ts +22 -0
- package/dist/runtime/anti-unification/anti-unify.d.ts.map +1 -0
- package/dist/runtime/anti-unification/anti-unify.js +154 -0
- package/dist/runtime/anti-unification/anti-unify.js.map +1 -0
- package/dist/runtime/anti-unification/index.d.ts +6 -0
- package/dist/runtime/anti-unification/index.d.ts.map +1 -0
- package/dist/runtime/anti-unification/index.js +23 -0
- package/dist/runtime/anti-unification/index.js.map +1 -0
- package/dist/runtime/anti-unification/many.d.ts +49 -0
- package/dist/runtime/anti-unification/many.d.ts.map +1 -0
- package/dist/runtime/anti-unification/many.js +185 -0
- package/dist/runtime/anti-unification/many.js.map +1 -0
- package/dist/runtime/anti-unification/term-utils.d.ts +40 -0
- package/dist/runtime/anti-unification/term-utils.d.ts.map +1 -0
- package/dist/runtime/anti-unification/term-utils.js +173 -0
- package/dist/runtime/anti-unification/term-utils.js.map +1 -0
- package/dist/runtime/anti-unification/types.d.ts +41 -0
- package/dist/runtime/anti-unification/types.d.ts.map +1 -0
- package/dist/runtime/anti-unification/types.js +26 -0
- package/dist/runtime/anti-unification/types.js.map +1 -0
- package/dist/runtime/csp/ac3.d.ts +20 -0
- package/dist/runtime/csp/ac3.d.ts.map +1 -0
- package/dist/runtime/csp/ac3.js +165 -0
- package/dist/runtime/csp/ac3.js.map +1 -0
- package/dist/runtime/csp/backtrack.d.ts +15 -0
- package/dist/runtime/csp/backtrack.d.ts.map +1 -0
- package/dist/runtime/csp/backtrack.js +233 -0
- package/dist/runtime/csp/backtrack.js.map +1 -0
- package/dist/runtime/csp/builtins.d.ts +27 -0
- package/dist/runtime/csp/builtins.d.ts.map +1 -0
- package/dist/runtime/csp/builtins.js +109 -0
- package/dist/runtime/csp/builtins.js.map +1 -0
- package/dist/runtime/csp/index.d.ts +5 -0
- package/dist/runtime/csp/index.d.ts.map +1 -0
- package/dist/runtime/csp/index.js +23 -0
- package/dist/runtime/csp/index.js.map +1 -0
- package/dist/runtime/csp/types.d.ts +54 -0
- package/dist/runtime/csp/types.d.ts.map +1 -0
- package/dist/runtime/csp/types.js +14 -0
- package/dist/runtime/csp/types.js.map +1 -0
- package/dist/runtime/markov-logic/grounding.d.ts +19 -0
- package/dist/runtime/markov-logic/grounding.d.ts.map +1 -0
- package/dist/runtime/markov-logic/grounding.js +252 -0
- package/dist/runtime/markov-logic/grounding.js.map +1 -0
- package/dist/runtime/markov-logic/index.d.ts +6 -0
- package/dist/runtime/markov-logic/index.d.ts.map +1 -0
- package/dist/runtime/markov-logic/index.js +47 -0
- package/dist/runtime/markov-logic/index.js.map +1 -0
- package/dist/runtime/markov-logic/inference.d.ts +77 -0
- package/dist/runtime/markov-logic/inference.d.ts.map +1 -0
- package/dist/runtime/markov-logic/inference.js +382 -0
- package/dist/runtime/markov-logic/inference.js.map +1 -0
- package/dist/runtime/markov-logic/parser.d.ts +25 -0
- package/dist/runtime/markov-logic/parser.d.ts.map +1 -0
- package/dist/runtime/markov-logic/parser.js +264 -0
- package/dist/runtime/markov-logic/parser.js.map +1 -0
- package/dist/runtime/markov-logic/types.d.ts +64 -0
- package/dist/runtime/markov-logic/types.d.ts.map +1 -0
- package/dist/runtime/markov-logic/types.js +17 -0
- package/dist/runtime/markov-logic/types.js.map +1 -0
- package/dist/runtime/pi-calculus/congruence.d.ts +15 -0
- package/dist/runtime/pi-calculus/congruence.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/congruence.js +271 -0
- package/dist/runtime/pi-calculus/congruence.js.map +1 -0
- package/dist/runtime/pi-calculus/index.d.ts +6 -0
- package/dist/runtime/pi-calculus/index.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/index.js +30 -0
- package/dist/runtime/pi-calculus/index.js.map +1 -0
- package/dist/runtime/pi-calculus/names.d.ts +28 -0
- package/dist/runtime/pi-calculus/names.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/names.js +182 -0
- package/dist/runtime/pi-calculus/names.js.map +1 -0
- package/dist/runtime/pi-calculus/reduction.d.ts +25 -0
- package/dist/runtime/pi-calculus/reduction.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/reduction.js +338 -0
- package/dist/runtime/pi-calculus/reduction.js.map +1 -0
- package/dist/runtime/pi-calculus/substitution.d.ts +11 -0
- package/dist/runtime/pi-calculus/substitution.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/substitution.js +109 -0
- package/dist/runtime/pi-calculus/substitution.js.map +1 -0
- package/dist/runtime/pi-calculus/types.d.ts +38 -0
- package/dist/runtime/pi-calculus/types.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/types.js +22 -0
- package/dist/runtime/pi-calculus/types.js.map +1 -0
- package/dist/runtime/planning/astar.d.ts +10 -0
- package/dist/runtime/planning/astar.d.ts.map +1 -0
- package/dist/runtime/planning/astar.js +155 -0
- package/dist/runtime/planning/astar.js.map +1 -0
- package/dist/runtime/planning/bfs.d.ts +17 -0
- package/dist/runtime/planning/bfs.d.ts.map +1 -0
- package/dist/runtime/planning/bfs.js +87 -0
- package/dist/runtime/planning/bfs.js.map +1 -0
- package/dist/runtime/planning/ground.d.ts +55 -0
- package/dist/runtime/planning/ground.d.ts.map +1 -0
- package/dist/runtime/planning/ground.js +154 -0
- package/dist/runtime/planning/ground.js.map +1 -0
- package/dist/runtime/planning/heuristic.d.ts +29 -0
- package/dist/runtime/planning/heuristic.d.ts.map +1 -0
- package/dist/runtime/planning/heuristic.js +172 -0
- package/dist/runtime/planning/heuristic.js.map +1 -0
- package/dist/runtime/planning/index.d.ts +6 -0
- package/dist/runtime/planning/index.d.ts.map +1 -0
- package/dist/runtime/planning/index.js +38 -0
- package/dist/runtime/planning/index.js.map +1 -0
- package/dist/runtime/planning/types.d.ts +100 -0
- package/dist/runtime/planning/types.d.ts.map +1 -0
- package/dist/runtime/planning/types.js +22 -0
- package/dist/runtime/planning/types.js.map +1 -0
- package/dist/runtime/symbolic-diff/differentiate.d.ts.map +1 -1
- package/dist/runtime/symbolic-diff/differentiate.js.map +1 -1
- package/dist/runtime/symbolic-diff/index.d.ts +1 -1
- package/dist/runtime/symbolic-diff/index.d.ts.map +1 -1
- package/dist/runtime/symbolic-diff/index.js.map +1 -1
- package/dist/runtime/symbolic-diff/parse.d.ts.map +1 -1
- package/dist/runtime/symbolic-diff/parse.js +7 -1
- package/dist/runtime/symbolic-diff/parse.js.map +1 -1
- package/dist/runtime/theorem-cache/cache.d.ts +100 -0
- package/dist/runtime/theorem-cache/cache.d.ts.map +1 -0
- package/dist/runtime/theorem-cache/cache.js +213 -0
- package/dist/runtime/theorem-cache/cache.js.map +1 -0
- package/dist/runtime/theorem-cache/canonical.d.ts +59 -0
- package/dist/runtime/theorem-cache/canonical.d.ts.map +1 -0
- package/dist/runtime/theorem-cache/canonical.js +105 -0
- package/dist/runtime/theorem-cache/canonical.js.map +1 -0
- package/dist/runtime/theorem-cache/index.d.ts +6 -0
- package/dist/runtime/theorem-cache/index.d.ts.map +1 -0
- package/dist/runtime/theorem-cache/index.js +16 -0
- package/dist/runtime/theorem-cache/index.js.map +1 -0
- package/dist/runtime/theorem-cache/pattern.d.ts +24 -0
- package/dist/runtime/theorem-cache/pattern.d.ts.map +1 -0
- package/dist/runtime/theorem-cache/pattern.js +80 -0
- package/dist/runtime/theorem-cache/pattern.js.map +1 -0
- package/dist/system-f/index.d.ts +7 -0
- package/dist/system-f/index.d.ts.map +1 -0
- package/dist/system-f/index.js +48 -0
- package/dist/system-f/index.js.map +1 -0
- package/dist/system-f/infer.d.ts +9 -0
- package/dist/system-f/infer.d.ts.map +1 -0
- package/dist/system-f/infer.js +94 -0
- package/dist/system-f/infer.js.map +1 -0
- package/dist/system-f/reduce.d.ts +15 -0
- package/dist/system-f/reduce.d.ts.map +1 -0
- package/dist/system-f/reduce.js +259 -0
- package/dist/system-f/reduce.js.map +1 -0
- package/dist/system-f/types.d.ts +53 -0
- package/dist/system-f/types.d.ts.map +1 -0
- package/dist/system-f/types.js +157 -0
- package/dist/system-f/types.js.map +1 -0
- package/dist/tableau-framework/TableauProver.d.ts +10 -0
- package/dist/tableau-framework/TableauProver.d.ts.map +1 -0
- package/dist/tableau-framework/TableauProver.js +118 -0
- package/dist/tableau-framework/TableauProver.js.map +1 -0
- package/dist/tableau-framework/index.d.ts +5 -0
- package/dist/tableau-framework/index.d.ts.map +1 -0
- package/dist/tableau-framework/index.js +11 -0
- package/dist/tableau-framework/index.js.map +1 -0
- package/dist/tableau-framework/propositional.d.ts +11 -0
- package/dist/tableau-framework/propositional.d.ts.map +1 -0
- package/dist/tableau-framework/propositional.js +143 -0
- package/dist/tableau-framework/propositional.js.map +1 -0
- package/dist/tableau-framework/types.d.ts +32 -0
- package/dist/tableau-framework/types.d.ts.map +1 -0
- package/dist/tableau-framework/types.js +6 -0
- package/dist/tableau-framework/types.js.map +1 -0
- package/dist/tests/anti-unification/anti-unify.test.d.ts +2 -0
- package/dist/tests/anti-unification/anti-unify.test.d.ts.map +1 -0
- package/dist/tests/anti-unification/anti-unify.test.js +219 -0
- package/dist/tests/anti-unification/anti-unify.test.js.map +1 -0
- package/dist/tests/coinduction/coinduction.test.d.ts +2 -0
- package/dist/tests/coinduction/coinduction.test.d.ts.map +1 -0
- package/dist/tests/coinduction/coinduction.test.js +217 -0
- package/dist/tests/coinduction/coinduction.test.js.map +1 -0
- package/dist/tests/combinators-ski/combinators-ski.test.d.ts +2 -0
- package/dist/tests/combinators-ski/combinators-ski.test.d.ts.map +1 -0
- package/dist/tests/combinators-ski/combinators-ski.test.js +211 -0
- package/dist/tests/combinators-ski/combinators-ski.test.js.map +1 -0
- package/dist/tests/constructive-reals/constructive-reals.test.d.ts +2 -0
- package/dist/tests/constructive-reals/constructive-reals.test.d.ts.map +1 -0
- package/dist/tests/constructive-reals/constructive-reals.test.js +357 -0
- package/dist/tests/constructive-reals/constructive-reals.test.js.map +1 -0
- package/dist/tests/coverage-fill-aristotelian.test.js +1 -1
- package/dist/tests/coverage-fill-aristotelian.test.js.map +1 -1
- package/dist/tests/coverage-fill-fallacies.test.js +1 -1
- package/dist/tests/coverage-fill-fallacies.test.js.map +1 -1
- package/dist/tests/coverage-fill-format.test.js +1 -1
- package/dist/tests/coverage-fill-format.test.js.map +1 -1
- package/dist/tests/coverage-fill-intuitionistic.test.js +1 -1
- package/dist/tests/coverage-fill-intuitionistic.test.js.map +1 -1
- package/dist/tests/coverage-fill-probabilistic.test.js +1 -1
- package/dist/tests/coverage-fill-probabilistic.test.js.map +1 -1
- package/dist/tests/csp/csp.test.d.ts +2 -0
- package/dist/tests/csp/csp.test.d.ts.map +1 -0
- package/dist/tests/csp/csp.test.js +292 -0
- package/dist/tests/csp/csp.test.js.map +1 -0
- package/dist/tests/game-semantics/game-semantics.test.d.ts +2 -0
- package/dist/tests/game-semantics/game-semantics.test.d.ts.map +1 -0
- package/dist/tests/game-semantics/game-semantics.test.js +143 -0
- package/dist/tests/game-semantics/game-semantics.test.js.map +1 -0
- package/dist/tests/higher-order-unify/ho-unify.test.d.ts +2 -0
- package/dist/tests/higher-order-unify/ho-unify.test.d.ts.map +1 -0
- package/dist/tests/higher-order-unify/ho-unify.test.js +264 -0
- package/dist/tests/higher-order-unify/ho-unify.test.js.map +1 -0
- package/dist/tests/integration/cross-modules.test.d.ts +8 -0
- package/dist/tests/integration/cross-modules.test.d.ts.map +1 -0
- package/dist/tests/integration/cross-modules.test.js +668 -0
- package/dist/tests/integration/cross-modules.test.js.map +1 -0
- package/dist/tests/lambda-calc/lambda-calc.test.js.map +1 -1
- package/dist/tests/many-valued/many-valued.test.js.map +1 -1
- package/dist/tests/markov-logic/markov-logic.test.d.ts +2 -0
- package/dist/tests/markov-logic/markov-logic.test.d.ts.map +1 -0
- package/dist/tests/markov-logic/markov-logic.test.js +349 -0
- package/dist/tests/markov-logic/markov-logic.test.js.map +1 -0
- package/dist/tests/mltt/mltt.test.d.ts +2 -0
- package/dist/tests/mltt/mltt.test.d.ts.map +1 -0
- package/dist/tests/mltt/mltt.test.js +181 -0
- package/dist/tests/mltt/mltt.test.js.map +1 -0
- package/dist/tests/mu-calculus/check.test.d.ts +2 -0
- package/dist/tests/mu-calculus/check.test.d.ts.map +1 -0
- package/dist/tests/mu-calculus/check.test.js +234 -0
- package/dist/tests/mu-calculus/check.test.js.map +1 -0
- package/dist/tests/nbe/nbe.test.d.ts +2 -0
- package/dist/tests/nbe/nbe.test.d.ts.map +1 -0
- package/dist/tests/nbe/nbe.test.js +121 -0
- package/dist/tests/nbe/nbe.test.js.map +1 -0
- package/dist/tests/pi-calculus/pi-calculus.test.d.ts +2 -0
- package/dist/tests/pi-calculus/pi-calculus.test.d.ts.map +1 -0
- package/dist/tests/pi-calculus/pi-calculus.test.js +273 -0
- package/dist/tests/pi-calculus/pi-calculus.test.js.map +1 -0
- package/dist/tests/planning/planning.test.d.ts +2 -0
- package/dist/tests/planning/planning.test.d.ts.map +1 -0
- package/dist/tests/planning/planning.test.js +397 -0
- package/dist/tests/planning/planning.test.js.map +1 -0
- package/dist/tests/profile-bridge/translations.test.d.ts +2 -0
- package/dist/tests/profile-bridge/translations.test.d.ts.map +1 -0
- package/dist/tests/profile-bridge/translations.test.js +266 -0
- package/dist/tests/profile-bridge/translations.test.js.map +1 -0
- package/dist/tests/proof-nets/proof-nets.test.d.ts +2 -0
- package/dist/tests/proof-nets/proof-nets.test.d.ts.map +1 -0
- package/dist/tests/proof-nets/proof-nets.test.js +263 -0
- package/dist/tests/proof-nets/proof-nets.test.js.map +1 -0
- package/dist/tests/refinement-types/refinement-types.test.d.ts +2 -0
- package/dist/tests/refinement-types/refinement-types.test.d.ts.map +1 -0
- package/dist/tests/refinement-types/refinement-types.test.js +174 -0
- package/dist/tests/refinement-types/refinement-types.test.js.map +1 -0
- package/dist/tests/sequent-lk/prover.test.d.ts +2 -0
- package/dist/tests/sequent-lk/prover.test.d.ts.map +1 -0
- package/dist/tests/sequent-lk/prover.test.js +317 -0
- package/dist/tests/sequent-lk/prover.test.js.map +1 -0
- package/dist/tests/symbolic-diff/symbolic-diff.test.js.map +1 -1
- package/dist/tests/system-f/system-f.test.d.ts +2 -0
- package/dist/tests/system-f/system-f.test.d.ts.map +1 -0
- package/dist/tests/system-f/system-f.test.js +217 -0
- package/dist/tests/system-f/system-f.test.js.map +1 -0
- package/dist/tests/tableau-framework/tableau.test.d.ts +2 -0
- package/dist/tests/tableau-framework/tableau.test.d.ts.map +1 -0
- package/dist/tests/tableau-framework/tableau.test.js +196 -0
- package/dist/tests/tableau-framework/tableau.test.js.map +1 -0
- package/dist/tests/theorem-cache/cache.test.d.ts +2 -0
- package/dist/tests/theorem-cache/cache.test.d.ts.map +1 -0
- package/dist/tests/theorem-cache/cache.test.js +510 -0
- package/dist/tests/theorem-cache/cache.test.js.map +1 -0
- package/package.json +1 -1
|
@@ -0,0 +1,174 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
const vitest_1 = require("vitest");
|
|
4
|
+
const refinement_types_1 = require("../../refinement-types");
|
|
5
|
+
(0, vitest_1.describe)('refinement-types / predicates & solver', () => {
|
|
6
|
+
(0, vitest_1.it)('checkVC: predicado vacío es trivialmente satisfacible', () => {
|
|
7
|
+
const res = (0, refinement_types_1.checkVC)([]);
|
|
8
|
+
(0, vitest_1.expect)(res.satisfiable).toBe(true);
|
|
9
|
+
});
|
|
10
|
+
(0, vitest_1.it)('checkVC: encuentra testigo para x > 0 && x < 5', () => {
|
|
11
|
+
const res = (0, refinement_types_1.checkVC)(['x > 0 && x < 5']);
|
|
12
|
+
(0, vitest_1.expect)(res.satisfiable).toBe(true);
|
|
13
|
+
(0, vitest_1.expect)(res.counter).toBeDefined();
|
|
14
|
+
const x = res.counter['x'];
|
|
15
|
+
(0, vitest_1.expect)(typeof x).toBe('number');
|
|
16
|
+
(0, vitest_1.expect)(x).toBeGreaterThan(0);
|
|
17
|
+
(0, vitest_1.expect)(x).toBeLessThan(5);
|
|
18
|
+
});
|
|
19
|
+
(0, vitest_1.it)('checkVC: contradicción x > 5 && x < 0 no es satisfacible', () => {
|
|
20
|
+
const res = (0, refinement_types_1.checkVC)(['x > 5', 'x < 0']);
|
|
21
|
+
(0, vitest_1.expect)(res.satisfiable).toBe(false);
|
|
22
|
+
});
|
|
23
|
+
(0, vitest_1.it)('implies: x > 5 ⇒ x > 0 (válido)', () => {
|
|
24
|
+
(0, vitest_1.expect)((0, refinement_types_1.implies)(['x > 5'], 'x > 0')).toBe(true);
|
|
25
|
+
});
|
|
26
|
+
(0, vitest_1.it)('implies: x > 0 ⇒ x > 5 (NO válido, hay contraejemplo x=1)', () => {
|
|
27
|
+
(0, vitest_1.expect)((0, refinement_types_1.implies)(['x > 0'], 'x > 5')).toBe(false);
|
|
28
|
+
});
|
|
29
|
+
(0, vitest_1.it)('predicateRenameVar: reemplaza el binding correctamente', () => {
|
|
30
|
+
const renamed = (0, refinement_types_1.predicateRenameVar)('x > 0 && x < 10', 'x', 'y');
|
|
31
|
+
// El predicado renombrado debe ser equivalente al original al sustituir y por valores.
|
|
32
|
+
const ast = (0, refinement_types_1.parsePredicate)(renamed);
|
|
33
|
+
(0, vitest_1.expect)(JSON.stringify(ast).includes('"x"')).toBe(false);
|
|
34
|
+
(0, vitest_1.expect)(JSON.stringify(ast).includes('"y"')).toBe(true);
|
|
35
|
+
});
|
|
36
|
+
});
|
|
37
|
+
(0, vitest_1.describe)('refinement-types / subtipado', () => {
|
|
38
|
+
(0, vitest_1.it)('{ x | x > 5 } <: { x | x > 0 } (más restrictivo es subtipo)', () => {
|
|
39
|
+
const t1 = (0, refinement_types_1.refine)('Int', 'x', 'x > 5');
|
|
40
|
+
const t2 = (0, refinement_types_1.refine)('Int', 'x', 'x > 0');
|
|
41
|
+
(0, vitest_1.expect)((0, refinement_types_1.isSubtype)(t1, t2)).toBe(true);
|
|
42
|
+
});
|
|
43
|
+
(0, vitest_1.it)('{ x | x > 0 } NO es subtipo de { x | x > 5 }', () => {
|
|
44
|
+
const t1 = (0, refinement_types_1.refine)('Int', 'x', 'x > 0');
|
|
45
|
+
const t2 = (0, refinement_types_1.refine)('Int', 'x', 'x > 5');
|
|
46
|
+
(0, vitest_1.expect)((0, refinement_types_1.isSubtype)(t1, t2)).toBe(false);
|
|
47
|
+
});
|
|
48
|
+
(0, vitest_1.it)('subtipado con bindings distintos (rename)', () => {
|
|
49
|
+
const t1 = (0, refinement_types_1.refine)('Int', 'a', 'a >= 10');
|
|
50
|
+
const t2 = (0, refinement_types_1.refine)('Int', 'b', 'b > 0');
|
|
51
|
+
(0, vitest_1.expect)((0, refinement_types_1.isSubtype)(t1, t2)).toBe(true);
|
|
52
|
+
});
|
|
53
|
+
(0, vitest_1.it)('intersección de rangos: { x | x>0 && x<10 } <: { x | x<100 }', () => {
|
|
54
|
+
const t1 = (0, refinement_types_1.refine)('Int', 'x', 'x > 0 && x < 10');
|
|
55
|
+
const t2 = (0, refinement_types_1.refine)('Int', 'x', 'x < 100');
|
|
56
|
+
(0, vitest_1.expect)((0, refinement_types_1.isSubtype)(t1, t2)).toBe(true);
|
|
57
|
+
});
|
|
58
|
+
(0, vitest_1.it)('tipos base distintos no son subtipo', () => {
|
|
59
|
+
(0, vitest_1.expect)((0, refinement_types_1.isSubtype)((0, refinement_types_1.tInt)(), (0, refinement_types_1.tBool)())).toBe(false);
|
|
60
|
+
});
|
|
61
|
+
(0, vitest_1.it)('subtipado de arrow: contravariante en parámetro', () => {
|
|
62
|
+
// (Int|x>0) -> Int <: (Int|x>5) -> Int (porque {x>5} <: {x>0})
|
|
63
|
+
const broader = (0, refinement_types_1.refine)('Int', 'x', 'x > 0');
|
|
64
|
+
const narrower = (0, refinement_types_1.refine)('Int', 'x', 'x > 5');
|
|
65
|
+
const arrA = {
|
|
66
|
+
base: { kind: 'arrow', from: broader, to: (0, refinement_types_1.tInt)() },
|
|
67
|
+
binding: '_f',
|
|
68
|
+
predicate: 'true',
|
|
69
|
+
};
|
|
70
|
+
const arrB = {
|
|
71
|
+
base: { kind: 'arrow', from: narrower, to: (0, refinement_types_1.tInt)() },
|
|
72
|
+
binding: '_f',
|
|
73
|
+
predicate: 'true',
|
|
74
|
+
};
|
|
75
|
+
(0, vitest_1.expect)((0, refinement_types_1.isSubtype)(arrA, arrB)).toBe(true);
|
|
76
|
+
(0, vitest_1.expect)((0, refinement_types_1.isSubtype)(arrB, arrA)).toBe(false);
|
|
77
|
+
});
|
|
78
|
+
});
|
|
79
|
+
(0, vitest_1.describe)('refinement-types / typeCheck (aplicación)', () => {
|
|
80
|
+
(0, vitest_1.it)('(λ x : {x:Int | x>0}. x+1) 5 type-checks', () => {
|
|
81
|
+
const positives = (0, refinement_types_1.refine)('Int', 'x', 'x > 0');
|
|
82
|
+
const term = (0, refinement_types_1.rApp)((0, refinement_types_1.rLam)('x', positives, (0, refinement_types_1.rBinop)('+', (0, refinement_types_1.rVar)('x'), (0, refinement_types_1.rLit)(1))), (0, refinement_types_1.rLit)(5));
|
|
83
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
84
|
+
if (!res.ok) {
|
|
85
|
+
console.warn('errors:', res.errors);
|
|
86
|
+
}
|
|
87
|
+
(0, vitest_1.expect)(res.ok).toBe(true);
|
|
88
|
+
});
|
|
89
|
+
(0, vitest_1.it)('(λ x : {x:Int | x>0}. x+1) 0 es RECHAZADO (precondición violada)', () => {
|
|
90
|
+
const positives = (0, refinement_types_1.refine)('Int', 'x', 'x > 0');
|
|
91
|
+
const term = (0, refinement_types_1.rApp)((0, refinement_types_1.rLam)('x', positives, (0, refinement_types_1.rBinop)('+', (0, refinement_types_1.rVar)('x'), (0, refinement_types_1.rLit)(1))), (0, refinement_types_1.rLit)(0));
|
|
92
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
93
|
+
(0, vitest_1.expect)(res.ok).toBe(false);
|
|
94
|
+
(0, vitest_1.expect)(res.errors.length).toBeGreaterThan(0);
|
|
95
|
+
});
|
|
96
|
+
(0, vitest_1.it)('(λ x : {x:Int | x>0}. x+1) -3 es RECHAZADO', () => {
|
|
97
|
+
const positives = (0, refinement_types_1.refine)('Int', 'x', 'x > 0');
|
|
98
|
+
const term = (0, refinement_types_1.rApp)((0, refinement_types_1.rLam)('x', positives, (0, refinement_types_1.rBinop)('+', (0, refinement_types_1.rVar)('x'), (0, refinement_types_1.rLit)(1))), (0, refinement_types_1.rLit)(-3));
|
|
99
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
100
|
+
(0, vitest_1.expect)(res.ok).toBe(false);
|
|
101
|
+
});
|
|
102
|
+
(0, vitest_1.it)('rango doble: argumento dentro de [1..99] es aceptado', () => {
|
|
103
|
+
const inRange = (0, refinement_types_1.refine)('Int', 'x', 'x > 0 && x < 100');
|
|
104
|
+
const term = (0, refinement_types_1.rApp)((0, refinement_types_1.rLam)('x', inRange, (0, refinement_types_1.rVar)('x')), (0, refinement_types_1.rLit)(42));
|
|
105
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
106
|
+
(0, vitest_1.expect)(res.ok).toBe(true);
|
|
107
|
+
});
|
|
108
|
+
(0, vitest_1.it)('rango doble: argumento fuera del rango es rechazado', () => {
|
|
109
|
+
const inRange = (0, refinement_types_1.refine)('Int', 'x', 'x > 0 && x < 100');
|
|
110
|
+
const term = (0, refinement_types_1.rApp)((0, refinement_types_1.rLam)('x', inRange, (0, refinement_types_1.rVar)('x')), (0, refinement_types_1.rLit)(150));
|
|
111
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
112
|
+
(0, vitest_1.expect)(res.ok).toBe(false);
|
|
113
|
+
});
|
|
114
|
+
(0, vitest_1.it)('let con anotación: valor que satisface el predicado pasa', () => {
|
|
115
|
+
const term = (0, refinement_types_1.rLet)('y', (0, refinement_types_1.rLit)(10), (0, refinement_types_1.rVar)('y'), (0, refinement_types_1.refine)('Int', 'y', 'y > 0'));
|
|
116
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
117
|
+
(0, vitest_1.expect)(res.ok).toBe(true);
|
|
118
|
+
});
|
|
119
|
+
(0, vitest_1.it)('let con anotación: valor que NO satisface el predicado falla', () => {
|
|
120
|
+
const term = (0, refinement_types_1.rLet)('y', (0, refinement_types_1.rLit)(-1), (0, refinement_types_1.rVar)('y'), (0, refinement_types_1.refine)('Int', 'y', 'y > 0'));
|
|
121
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
122
|
+
(0, vitest_1.expect)(res.ok).toBe(false);
|
|
123
|
+
});
|
|
124
|
+
(0, vitest_1.it)('binop suma sintetiza Int', () => {
|
|
125
|
+
const term = (0, refinement_types_1.rBinop)('+', (0, refinement_types_1.rLit)(2), (0, refinement_types_1.rLit)(3));
|
|
126
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
127
|
+
(0, vitest_1.expect)(res.ok).toBe(true);
|
|
128
|
+
(0, vitest_1.expect)(res.type?.base).toBe('Int');
|
|
129
|
+
});
|
|
130
|
+
(0, vitest_1.it)('binop comparación sintetiza Bool', () => {
|
|
131
|
+
const term = (0, refinement_types_1.rBinop)('<', (0, refinement_types_1.rLit)(2), (0, refinement_types_1.rLit)(3));
|
|
132
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
133
|
+
(0, vitest_1.expect)(res.ok).toBe(true);
|
|
134
|
+
(0, vitest_1.expect)(res.type?.base).toBe('Bool');
|
|
135
|
+
});
|
|
136
|
+
(0, vitest_1.it)('if con condición no booleana es rechazado', () => {
|
|
137
|
+
const term = { kind: 'if', cond: (0, refinement_types_1.rLit)(1), then: (0, refinement_types_1.rLit)(1), else: (0, refinement_types_1.rLit)(2) };
|
|
138
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
139
|
+
(0, vitest_1.expect)(res.ok).toBe(false);
|
|
140
|
+
});
|
|
141
|
+
(0, vitest_1.it)('aplicar algo que no es función falla', () => {
|
|
142
|
+
const term = (0, refinement_types_1.rApp)((0, refinement_types_1.rLit)(1), (0, refinement_types_1.rLit)(2));
|
|
143
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
144
|
+
(0, vitest_1.expect)(res.ok).toBe(false);
|
|
145
|
+
});
|
|
146
|
+
(0, vitest_1.it)('variable libre da error', () => {
|
|
147
|
+
const term = (0, refinement_types_1.rVar)('z');
|
|
148
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
149
|
+
(0, vitest_1.expect)(res.ok).toBe(false);
|
|
150
|
+
});
|
|
151
|
+
});
|
|
152
|
+
(0, vitest_1.describe)('refinement-types / generateVC + utilidades', () => {
|
|
153
|
+
(0, vitest_1.it)('generateVC devuelve array (puede estar vacío en términos triviales)', () => {
|
|
154
|
+
const term = (0, refinement_types_1.rLit)(42);
|
|
155
|
+
(0, vitest_1.expect)(Array.isArray((0, refinement_types_1.generateVC)(term))).toBe(true);
|
|
156
|
+
});
|
|
157
|
+
(0, vitest_1.it)('generateVC: aplicación con precondición violada acumula al menos una VC', () => {
|
|
158
|
+
const positives = (0, refinement_types_1.refine)('Int', 'x', 'x > 0');
|
|
159
|
+
const term = (0, refinement_types_1.rApp)((0, refinement_types_1.rLam)('x', positives, (0, refinement_types_1.rVar)('x')), (0, refinement_types_1.rLit)(-1));
|
|
160
|
+
const vcs = (0, refinement_types_1.generateVC)(term);
|
|
161
|
+
(0, vitest_1.expect)(vcs.length).toBeGreaterThan(0);
|
|
162
|
+
});
|
|
163
|
+
(0, vitest_1.it)('refTypeToString incluye predicado cuando no es trivial', () => {
|
|
164
|
+
const t = (0, refinement_types_1.refine)('Int', 'x', 'x > 0');
|
|
165
|
+
const s = (0, refinement_types_1.refTypeToString)(t);
|
|
166
|
+
(0, vitest_1.expect)(s).toContain('Int');
|
|
167
|
+
(0, vitest_1.expect)(s).toContain('x > 0');
|
|
168
|
+
});
|
|
169
|
+
(0, vitest_1.it)('refTypeToString omite predicado trivial', () => {
|
|
170
|
+
const t = (0, refinement_types_1.tInt)('x', 'true');
|
|
171
|
+
(0, vitest_1.expect)((0, refinement_types_1.refTypeToString)(t)).not.toContain('|');
|
|
172
|
+
});
|
|
173
|
+
});
|
|
174
|
+
//# sourceMappingURL=refinement-types.test.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"refinement-types.test.js","sourceRoot":"","sources":["../../../src/tests/refinement-types/refinement-types.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,6DAkBgC;AAEhC,IAAA,iBAAQ,EAAC,wCAAwC,EAAE,GAAG,EAAE;IACtD,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,GAAG,GAAG,IAAA,0BAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,GAAG,GAAG,IAAA,0BAAO,EAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;QAClC,MAAM,CAAC,GAAG,GAAG,CAAC,OAAQ,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,CAAW,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,CAAW,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,GAAG,GAAG,IAAA,0BAAO,EAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,IAAA,eAAM,EAAC,IAAA,0BAAO,EAAC,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,IAAA,eAAM,EAAC,IAAA,0BAAO,EAAC,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,OAAO,GAAG,IAAA,qCAAkB,EAAC,iBAAiB,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAChE,uFAAuF;QACvF,MAAM,GAAG,GAAG,IAAA,iCAAc,EAAC,OAAO,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxD,IAAA,eAAM,EAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,8BAA8B,EAAE,GAAG,EAAE;IAC5C,IAAA,WAAE,EAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,MAAM,EAAE,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,EAAE,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,EAAE,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;QACzC,MAAM,EAAE,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,EAAE,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,iBAAiB,CAAC,CAAC;QACjD,MAAM,EAAE,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,uBAAI,GAAE,EAAE,IAAA,wBAAK,GAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,gEAAgE;QAChE,MAAM,OAAO,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QAC5C,MAAM,QAAQ,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QAC7C,MAAM,IAAI,GAAG;YACX,IAAI,EAAE,EAAE,IAAI,EAAE,OAAgB,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,IAAA,uBAAI,GAAE,EAAE;YAC3D,OAAO,EAAE,IAAI;YACb,SAAS,EAAE,MAAM;SAClB,CAAC;QACF,MAAM,IAAI,GAAG;YACX,IAAI,EAAE,EAAE,IAAI,EAAE,OAAgB,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,IAAA,uBAAI,GAAE,EAAE;YAC5D,OAAO,EAAE,IAAI;YACb,SAAS,EAAE,MAAM;SAClB,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,2CAA2C,EAAE,GAAG,EAAE;IACzD,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,SAAS,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QAC9C,MAAM,IAAI,GAAG,IAAA,uBAAI,EAAC,IAAA,uBAAI,EAAC,GAAG,EAAE,SAAS,EAAE,IAAA,yBAAM,EAAC,GAAG,EAAE,IAAA,uBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,CAAC,CAAC;QAClF,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;YACZ,OAAO,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;QACtC,CAAC;QACD,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,MAAM,SAAS,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QAC9C,MAAM,IAAI,GAAG,IAAA,uBAAI,EAAC,IAAA,uBAAI,EAAC,GAAG,EAAE,SAAS,EAAE,IAAA,yBAAM,EAAC,GAAG,EAAE,IAAA,uBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,CAAC,CAAC;QAClF,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,SAAS,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QAC9C,MAAM,IAAI,GAAG,IAAA,uBAAI,EAAC,IAAA,uBAAI,EAAC,GAAG,EAAE,SAAS,EAAE,IAAA,yBAAM,EAAC,GAAG,EAAE,IAAA,uBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnF,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,OAAO,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,kBAAkB,CAAC,CAAC;QACvD,MAAM,IAAI,GAAG,IAAA,uBAAI,EAAC,IAAA,uBAAI,EAAC,GAAG,EAAE,OAAO,EAAE,IAAA,uBAAI,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,uBAAI,EAAC,EAAE,CAAC,CAAC,CAAC;QAC3D,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,MAAM,OAAO,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,kBAAkB,CAAC,CAAC;QACvD,MAAM,IAAI,GAAG,IAAA,uBAAI,EAAC,IAAA,uBAAI,EAAC,GAAG,EAAE,OAAO,EAAE,IAAA,uBAAI,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,uBAAI,EAAC,GAAG,CAAC,CAAC,CAAC;QAC5D,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,IAAI,GAAG,IAAA,uBAAI,EAAC,GAAG,EAAE,IAAA,uBAAI,EAAC,EAAE,CAAC,EAAE,IAAA,uBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC;QACzE,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,IAAI,GAAG,IAAA,uBAAI,EAAC,GAAG,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,uBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC;QACzE,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,MAAM,IAAI,GAAG,IAAA,yBAAM,EAAC,GAAG,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,IAAI,GAAG,IAAA,yBAAM,EAAC,GAAG,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,IAAI,GAAG,EAAE,IAAI,EAAE,IAAa,EAAE,IAAI,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,EAAE,CAAC;QAClF,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,IAAI,GAAG,IAAA,uBAAI,EAAC,IAAA,uBAAI,EAAC,CAAC,CAAC,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yBAAyB,EAAE,GAAG,EAAE;QACjC,MAAM,IAAI,GAAG,IAAA,uBAAI,EAAC,GAAG,CAAC,CAAC;QACvB,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,4CAA4C,EAAE,GAAG,EAAE;IAC1D,IAAA,WAAE,EAAC,qEAAqE,EAAE,GAAG,EAAE;QAC7E,MAAM,IAAI,GAAG,IAAA,uBAAI,EAAC,EAAE,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,KAAK,CAAC,OAAO,CAAC,IAAA,6BAAU,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yEAAyE,EAAE,GAAG,EAAE;QACjF,MAAM,SAAS,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QAC9C,MAAM,IAAI,GAAG,IAAA,uBAAI,EAAC,IAAA,uBAAI,EAAC,GAAG,EAAE,SAAS,EAAE,IAAA,uBAAI,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,MAAM,GAAG,GAAG,IAAA,6BAAU,EAAC,IAAI,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,CAAC,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QACtC,MAAM,CAAC,GAAG,IAAA,kCAAe,EAAC,CAAC,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,CAAC,GAAG,IAAA,uBAAI,EAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,IAAA,kCAAe,EAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"prover.test.d.ts","sourceRoot":"","sources":["../../../src/tests/sequent-lk/prover.test.ts"],"names":[],"mappings":""}
|
|
@@ -0,0 +1,317 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
const vitest_1 = require("vitest");
|
|
4
|
+
const sequent_lk_1 = require("../../profiles/sequent-lk");
|
|
5
|
+
// --- Helpers ---
|
|
6
|
+
const atom = (name) => ({ kind: 'atom', name });
|
|
7
|
+
const not = (a) => ({ kind: 'not', arg: a });
|
|
8
|
+
const and = (a, b) => ({ kind: 'and', left: a, right: b });
|
|
9
|
+
const or = (a, b) => ({ kind: 'or', left: a, right: b });
|
|
10
|
+
const imp = (a, b) => ({ kind: 'implies', left: a, right: b });
|
|
11
|
+
const P = atom('P');
|
|
12
|
+
const Q = atom('Q');
|
|
13
|
+
const R = atom('R');
|
|
14
|
+
function rulesOf(p) {
|
|
15
|
+
if (!p)
|
|
16
|
+
return [];
|
|
17
|
+
const out = [p.rule];
|
|
18
|
+
for (const sub of p.premises)
|
|
19
|
+
out.push(...rulesOf(sub));
|
|
20
|
+
return out;
|
|
21
|
+
}
|
|
22
|
+
(0, vitest_1.describe)('LK — proveLK sobre tautologias clasicas', () => {
|
|
23
|
+
(0, vitest_1.it)('demuestra el axioma P ⊢ P', () => {
|
|
24
|
+
const proof = (0, sequent_lk_1.proveLK)({ left: [P], right: [P] });
|
|
25
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
26
|
+
(0, vitest_1.expect)(proof.rule).toBe('axiom');
|
|
27
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(proof)).toBe(true);
|
|
28
|
+
});
|
|
29
|
+
(0, vitest_1.it)('demuestra ⊢ P ∨ ¬P (tercio excluido)', () => {
|
|
30
|
+
const proof = (0, sequent_lk_1.proveLKFormula)(or(P, not(P)));
|
|
31
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
32
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(proof)).toBe(true);
|
|
33
|
+
const set = new Set(rulesOf(proof));
|
|
34
|
+
(0, vitest_1.expect)(set.has('orR')).toBe(true);
|
|
35
|
+
(0, vitest_1.expect)(set.has('notR')).toBe(true);
|
|
36
|
+
(0, vitest_1.expect)(set.has('axiom')).toBe(true);
|
|
37
|
+
});
|
|
38
|
+
(0, vitest_1.it)('demuestra ⊢ ¬¬P → P (doble negacion clasica)', () => {
|
|
39
|
+
const proof = (0, sequent_lk_1.proveLKFormula)(imp(not(not(P)), P));
|
|
40
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
41
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(proof)).toBe(true);
|
|
42
|
+
});
|
|
43
|
+
(0, vitest_1.it)('demuestra ley de Peirce: ((P → Q) → P) → P', () => {
|
|
44
|
+
const proof = (0, sequent_lk_1.proveLKFormula)(imp(imp(imp(P, Q), P), P));
|
|
45
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
46
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(proof)).toBe(true);
|
|
47
|
+
});
|
|
48
|
+
(0, vitest_1.it)('demuestra ⊢ ¬¬¬P → ¬P', () => {
|
|
49
|
+
const proof = (0, sequent_lk_1.proveLKFormula)(imp(not(not(not(P))), not(P)));
|
|
50
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
51
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(proof)).toBe(true);
|
|
52
|
+
});
|
|
53
|
+
(0, vitest_1.it)('demuestra (P → Q) → (¬Q → ¬P) — contraposicion', () => {
|
|
54
|
+
const proof = (0, sequent_lk_1.proveLKFormula)(imp(imp(P, Q), imp(not(Q), not(P))));
|
|
55
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
56
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(proof)).toBe(true);
|
|
57
|
+
});
|
|
58
|
+
(0, vitest_1.it)('demuestra De Morgan: ¬(P ∧ Q) → (¬P ∨ ¬Q)', () => {
|
|
59
|
+
const proof = (0, sequent_lk_1.proveLKFormula)(imp(not(and(P, Q)), or(not(P), not(Q))));
|
|
60
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
61
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(proof)).toBe(true);
|
|
62
|
+
});
|
|
63
|
+
(0, vitest_1.it)('rechaza ⊢ P (no es tautologia)', () => {
|
|
64
|
+
const proof = (0, sequent_lk_1.proveLKFormula)(P);
|
|
65
|
+
(0, vitest_1.expect)(proof).toBeNull();
|
|
66
|
+
});
|
|
67
|
+
(0, vitest_1.it)('rechaza P ⊢ Q (no es derivable)', () => {
|
|
68
|
+
const proof = (0, sequent_lk_1.proveLK)({ left: [P], right: [Q] });
|
|
69
|
+
(0, vitest_1.expect)(proof).toBeNull();
|
|
70
|
+
});
|
|
71
|
+
});
|
|
72
|
+
(0, vitest_1.describe)('LK — multisuccedente', () => {
|
|
73
|
+
(0, vitest_1.it)('demuestra Γ ⊢ P, ¬P en una sola rama via axiom', () => {
|
|
74
|
+
const proof = (0, sequent_lk_1.proveLK)({ left: [], right: [P, not(P)] });
|
|
75
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
76
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(proof)).toBe(true);
|
|
77
|
+
});
|
|
78
|
+
(0, vitest_1.it)('demuestra P, Q ⊢ P ∧ Q', () => {
|
|
79
|
+
const proof = (0, sequent_lk_1.proveLK)({ left: [P, Q], right: [and(P, Q)] });
|
|
80
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
81
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(proof)).toBe(true);
|
|
82
|
+
(0, vitest_1.expect)(rulesOf(proof)).toContain('andR');
|
|
83
|
+
});
|
|
84
|
+
(0, vitest_1.it)('demuestra P ∨ Q ⊢ Q ∨ P (conmutatividad)', () => {
|
|
85
|
+
const proof = (0, sequent_lk_1.proveLK)({ left: [or(P, Q)], right: [or(Q, P)] });
|
|
86
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
87
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(proof)).toBe(true);
|
|
88
|
+
});
|
|
89
|
+
});
|
|
90
|
+
(0, vitest_1.describe)('LK — Hauptsatz / cut elimination', () => {
|
|
91
|
+
(0, vitest_1.it)('hasCut es false en una prueba cut-free producida por proveLK', () => {
|
|
92
|
+
const proof = (0, sequent_lk_1.proveLKFormula)(imp(P, P));
|
|
93
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
94
|
+
(0, vitest_1.expect)((0, sequent_lk_1.hasCut)(proof)).toBe(false);
|
|
95
|
+
});
|
|
96
|
+
(0, vitest_1.it)('detecta hasCut=true en una prueba con cut manual', () => {
|
|
97
|
+
// Construimos: ⊢ P via cut sobre P, premisas: ⊢ P, P y P ⊢ (ambas falsas como derivaciones,
|
|
98
|
+
// pero la estructura sirve para chequear hasCut)
|
|
99
|
+
const fakeProof = {
|
|
100
|
+
goal: { left: [], right: [P] },
|
|
101
|
+
rule: 'cut',
|
|
102
|
+
cutFormula: P,
|
|
103
|
+
premises: [
|
|
104
|
+
{ goal: { left: [], right: [P, P] }, rule: 'axiom', premises: [], principalFormula: P },
|
|
105
|
+
{ goal: { left: [P], right: [] }, rule: 'axiom', premises: [], principalFormula: P },
|
|
106
|
+
],
|
|
107
|
+
};
|
|
108
|
+
(0, vitest_1.expect)((0, sequent_lk_1.hasCut)(fakeProof)).toBe(true);
|
|
109
|
+
});
|
|
110
|
+
(0, vitest_1.it)('construye prueba con cut y elimina via eliminateCut → hasCut=false', () => {
|
|
111
|
+
// Objetivo: P → P
|
|
112
|
+
// Estrategia: armar una derivacion *con* corte que pruebe P → P:
|
|
113
|
+
// premisa1: P ⊢ P, P (via weakR sobre el axiom P ⊢ P) — usamos axiom multisuccedente
|
|
114
|
+
// premisa2: P, P ⊢ P (via weakL sobre el axiom P ⊢ P)
|
|
115
|
+
// cut sobre P → P ⊢ P, luego impR → ⊢ P → P
|
|
116
|
+
//
|
|
117
|
+
// Por simplicidad, construimos directamente un cut sobre Q en un secuente que tiene
|
|
118
|
+
// sub-derivaciones canonicas (axiomas).
|
|
119
|
+
const axQ = {
|
|
120
|
+
goal: { left: [Q], right: [Q] },
|
|
121
|
+
rule: 'axiom',
|
|
122
|
+
premises: [],
|
|
123
|
+
principalFormula: Q,
|
|
124
|
+
};
|
|
125
|
+
const axQ2 = {
|
|
126
|
+
goal: { left: [Q], right: [Q] },
|
|
127
|
+
rule: 'axiom',
|
|
128
|
+
premises: [],
|
|
129
|
+
principalFormula: Q,
|
|
130
|
+
};
|
|
131
|
+
// cut: Q ⊢ Q cut_Q Q ⊢ Q ⟹ Q ⊢ Q
|
|
132
|
+
const withCut = {
|
|
133
|
+
goal: { left: [Q], right: [Q] },
|
|
134
|
+
rule: 'cut',
|
|
135
|
+
cutFormula: Q,
|
|
136
|
+
premises: [axQ, axQ2],
|
|
137
|
+
};
|
|
138
|
+
(0, vitest_1.expect)((0, sequent_lk_1.hasCut)(withCut)).toBe(true);
|
|
139
|
+
const elim = (0, sequent_lk_1.eliminateCut)(withCut);
|
|
140
|
+
(0, vitest_1.expect)((0, sequent_lk_1.hasCut)(elim)).toBe(false);
|
|
141
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(elim)).toBe(true);
|
|
142
|
+
});
|
|
143
|
+
(0, vitest_1.it)('cut sobre conectivo and: eliminacion produce prueba cut-free valida del mismo secuente', () => {
|
|
144
|
+
// Objetivo: P, Q ⊢ P ∧ Q via cut sobre P∧Q
|
|
145
|
+
// p1 (concluye P, Q ⊢ P∧Q): andR de P ⊢ P y Q ⊢ Q → este es el lado derecho del cut
|
|
146
|
+
// p2 (concluye P∧Q ⊢ P∧Q): axiom
|
|
147
|
+
// cut: P, Q ⊢ P∧Q cut_{P∧Q} P∧Q ⊢ P∧Q → P, Q ⊢ P∧Q
|
|
148
|
+
// andR para P, Q ⊢ P∧Q: premisas P, Q ⊢ P y P, Q ⊢ Q
|
|
149
|
+
// Usamos derivaciones donde la formula extra viene como axiom multisuccedente, lo cual exige
|
|
150
|
+
// pasar por axiomas con weakening. Para mantener la prueba estructuralmente valida construimos
|
|
151
|
+
// p1 a partir de un cut trivial cuya eliminacion seria correcta — pero como aqui solo testeamos
|
|
152
|
+
// hasCut/eliminateCut, sirve igual: la entrada tiene cuts, la salida no.
|
|
153
|
+
const subAndL = {
|
|
154
|
+
goal: { left: [P, Q], right: [P] },
|
|
155
|
+
rule: 'axiom',
|
|
156
|
+
premises: [],
|
|
157
|
+
principalFormula: P,
|
|
158
|
+
};
|
|
159
|
+
const subAndR = {
|
|
160
|
+
goal: { left: [P, Q], right: [Q] },
|
|
161
|
+
rule: 'axiom',
|
|
162
|
+
premises: [],
|
|
163
|
+
principalFormula: Q,
|
|
164
|
+
};
|
|
165
|
+
const p1 = {
|
|
166
|
+
goal: { left: [P, Q], right: [and(P, Q)] },
|
|
167
|
+
rule: 'andR',
|
|
168
|
+
premises: [subAndL, subAndR],
|
|
169
|
+
principalFormula: and(P, Q),
|
|
170
|
+
};
|
|
171
|
+
const p2 = {
|
|
172
|
+
goal: { left: [and(P, Q)], right: [and(P, Q)] },
|
|
173
|
+
rule: 'axiom',
|
|
174
|
+
premises: [],
|
|
175
|
+
principalFormula: and(P, Q),
|
|
176
|
+
};
|
|
177
|
+
const withCut = {
|
|
178
|
+
goal: { left: [P, Q], right: [and(P, Q)] },
|
|
179
|
+
rule: 'cut',
|
|
180
|
+
cutFormula: and(P, Q),
|
|
181
|
+
premises: [p1, p2],
|
|
182
|
+
};
|
|
183
|
+
(0, vitest_1.expect)((0, sequent_lk_1.hasCut)(withCut)).toBe(true);
|
|
184
|
+
const elim = (0, sequent_lk_1.eliminateCut)(withCut);
|
|
185
|
+
(0, vitest_1.expect)((0, sequent_lk_1.hasCut)(elim)).toBe(false);
|
|
186
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(elim)).toBe(true);
|
|
187
|
+
// El secuente terminal debe coincidir
|
|
188
|
+
(0, vitest_1.expect)(elim.goal.left.map((f) => (f.kind === 'atom' ? f.name : '')).sort()).toEqual(['P', 'Q']);
|
|
189
|
+
});
|
|
190
|
+
(0, vitest_1.it)('cut con axioma como una de las premisas se reduce a la otra premisa', () => {
|
|
191
|
+
// Axiom A ⊢ A cut_A A ⊢ A ⟹ A ⊢ A
|
|
192
|
+
const axL = {
|
|
193
|
+
goal: { left: [P], right: [P] },
|
|
194
|
+
rule: 'axiom',
|
|
195
|
+
premises: [],
|
|
196
|
+
principalFormula: P,
|
|
197
|
+
};
|
|
198
|
+
const axR = {
|
|
199
|
+
goal: { left: [P], right: [P] },
|
|
200
|
+
rule: 'axiom',
|
|
201
|
+
premises: [],
|
|
202
|
+
principalFormula: P,
|
|
203
|
+
};
|
|
204
|
+
const withCut = {
|
|
205
|
+
goal: { left: [P], right: [P] },
|
|
206
|
+
rule: 'cut',
|
|
207
|
+
cutFormula: P,
|
|
208
|
+
premises: [axL, axR],
|
|
209
|
+
};
|
|
210
|
+
const elim = (0, sequent_lk_1.eliminateCut)(withCut);
|
|
211
|
+
(0, vitest_1.expect)((0, sequent_lk_1.hasCut)(elim)).toBe(false);
|
|
212
|
+
(0, vitest_1.expect)(elim.rule).toBe('axiom');
|
|
213
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(elim)).toBe(true);
|
|
214
|
+
});
|
|
215
|
+
});
|
|
216
|
+
(0, vitest_1.describe)('LK — isValid sobre estructuras', () => {
|
|
217
|
+
(0, vitest_1.it)('isValid acepta axiom genuino', () => {
|
|
218
|
+
const ax = {
|
|
219
|
+
goal: { left: [P, Q], right: [P, R] },
|
|
220
|
+
rule: 'axiom',
|
|
221
|
+
premises: [],
|
|
222
|
+
principalFormula: P,
|
|
223
|
+
};
|
|
224
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(ax)).toBe(true);
|
|
225
|
+
});
|
|
226
|
+
(0, vitest_1.it)('isValid rechaza axiom sin formula compartida', () => {
|
|
227
|
+
const bad = {
|
|
228
|
+
goal: { left: [P], right: [Q] },
|
|
229
|
+
rule: 'axiom',
|
|
230
|
+
premises: [],
|
|
231
|
+
principalFormula: P,
|
|
232
|
+
};
|
|
233
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(bad)).toBe(false);
|
|
234
|
+
});
|
|
235
|
+
(0, vitest_1.it)('isValid acepta impR construido a mano: ⊢ P → P', () => {
|
|
236
|
+
const ax = {
|
|
237
|
+
goal: { left: [P], right: [P] },
|
|
238
|
+
rule: 'axiom',
|
|
239
|
+
premises: [],
|
|
240
|
+
principalFormula: P,
|
|
241
|
+
};
|
|
242
|
+
const impR = {
|
|
243
|
+
goal: { left: [], right: [imp(P, P)] },
|
|
244
|
+
rule: 'impR',
|
|
245
|
+
premises: [ax],
|
|
246
|
+
principalFormula: imp(P, P),
|
|
247
|
+
};
|
|
248
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(impR)).toBe(true);
|
|
249
|
+
});
|
|
250
|
+
(0, vitest_1.it)('isValid acepta weakL', () => {
|
|
251
|
+
const ax = {
|
|
252
|
+
goal: { left: [P], right: [P] },
|
|
253
|
+
rule: 'axiom',
|
|
254
|
+
premises: [],
|
|
255
|
+
principalFormula: P,
|
|
256
|
+
};
|
|
257
|
+
const w = {
|
|
258
|
+
goal: { left: [Q, P], right: [P] },
|
|
259
|
+
rule: 'weakL',
|
|
260
|
+
premises: [ax],
|
|
261
|
+
principalFormula: Q,
|
|
262
|
+
};
|
|
263
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(w)).toBe(true);
|
|
264
|
+
});
|
|
265
|
+
(0, vitest_1.it)('isValid acepta contrR', () => {
|
|
266
|
+
// p: ⊢ P, P ; conclusion: ⊢ P
|
|
267
|
+
// Necesitamos una p valida que tenga ⊢ P, P. Una axiom (P ⊢ P) no sirve; usamos
|
|
268
|
+
// un weakR sobre axiom para construir ⊢ P, P es delicado — en cambio testeamos
|
|
269
|
+
// contrR sobre un ejemplo trivial: dados p con goal ⊢ P, P (que aceptamos como
|
|
270
|
+
// un nodo fake con rule weakR), validamos que contrR encaje estructuralmente.
|
|
271
|
+
const fakeP = {
|
|
272
|
+
goal: { left: [], right: [P, P] },
|
|
273
|
+
rule: 'axiom',
|
|
274
|
+
premises: [],
|
|
275
|
+
principalFormula: P,
|
|
276
|
+
};
|
|
277
|
+
// isValid sobre fakeP es false (axiom necesita L y R compartir). Probamos isValid
|
|
278
|
+
// del contrR ignorando la rama de fakeP:
|
|
279
|
+
const contr = {
|
|
280
|
+
goal: { left: [], right: [P] },
|
|
281
|
+
rule: 'contrR',
|
|
282
|
+
premises: [fakeP],
|
|
283
|
+
principalFormula: P,
|
|
284
|
+
};
|
|
285
|
+
// isValid recursivo encontrara que fakeP no es valido → expect false.
|
|
286
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(contr)).toBe(false);
|
|
287
|
+
});
|
|
288
|
+
});
|
|
289
|
+
(0, vitest_1.describe)('LK — propiedad: cut-elimination preserva derivabilidad', () => {
|
|
290
|
+
(0, vitest_1.it)('para una tautologia, eliminateCut produce prueba cut-free isValid', () => {
|
|
291
|
+
// Tomamos una prueba cut-free directa y le inyectamos un cut trivial
|
|
292
|
+
// que tras eliminacion debe colapsar al original (o equivalente).
|
|
293
|
+
const original = (0, sequent_lk_1.proveLKFormula)(imp(P, imp(Q, P)));
|
|
294
|
+
(0, vitest_1.expect)(original).not.toBeNull();
|
|
295
|
+
const withCut = {
|
|
296
|
+
goal: { left: [P], right: [P] },
|
|
297
|
+
rule: 'cut',
|
|
298
|
+
cutFormula: P,
|
|
299
|
+
premises: [
|
|
300
|
+
{ goal: { left: [P], right: [P] }, rule: 'axiom', premises: [], principalFormula: P },
|
|
301
|
+
{ goal: { left: [P], right: [P] }, rule: 'axiom', premises: [], principalFormula: P },
|
|
302
|
+
],
|
|
303
|
+
};
|
|
304
|
+
const elim = (0, sequent_lk_1.eliminateCut)(withCut);
|
|
305
|
+
(0, vitest_1.expect)((0, sequent_lk_1.hasCut)(elim)).toBe(false);
|
|
306
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(elim)).toBe(true);
|
|
307
|
+
});
|
|
308
|
+
(0, vitest_1.it)('eliminateCut sobre prueba ya cut-free es estable (hasCut sigue siendo false)', () => {
|
|
309
|
+
const proof = (0, sequent_lk_1.proveLKFormula)(or(P, not(P)));
|
|
310
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
311
|
+
(0, vitest_1.expect)((0, sequent_lk_1.hasCut)(proof)).toBe(false);
|
|
312
|
+
const elim = (0, sequent_lk_1.eliminateCut)(proof);
|
|
313
|
+
(0, vitest_1.expect)((0, sequent_lk_1.hasCut)(elim)).toBe(false);
|
|
314
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(elim)).toBe(true);
|
|
315
|
+
});
|
|
316
|
+
});
|
|
317
|
+
//# sourceMappingURL=prover.test.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"prover.test.js","sourceRoot":"","sources":["../../../src/tests/sequent-lk/prover.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,0DAQmC;AAEnC,kBAAkB;AAClB,MAAM,IAAI,GAAG,CAAC,IAAY,EAAa,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;AACnE,MAAM,GAAG,GAAG,CAAC,CAAY,EAAa,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;AACnE,MAAM,GAAG,GAAG,CAAC,CAAY,EAAE,CAAY,EAAa,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;AAC5F,MAAM,EAAE,GAAG,CAAC,CAAY,EAAE,CAAY,EAAa,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;AAC1F,MAAM,GAAG,GAAG,CAAC,CAAY,EAAE,CAAY,EAAa,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;AAEhG,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;AACpB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;AACpB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;AAEpB,SAAS,OAAO,CAAC,CAA6B;IAC5C,IAAI,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC;IAClB,MAAM,GAAG,GAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC/B,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,QAAQ;QAAE,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;IACxD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,IAAA,iBAAQ,EAAC,yCAAyC,EAAE,GAAG,EAAE;IACvD,IAAA,WAAE,EAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,MAAM,KAAK,GAAG,IAAA,oBAAO,EAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,KAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,KAAK,GAAG,IAAA,2BAAc,EAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,KAAK,GAAG,IAAA,2BAAc,EAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAClD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,KAAK,GAAG,IAAA,2BAAc,EAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uBAAuB,EAAE,GAAG,EAAE;QAC/B,MAAM,KAAK,GAAG,IAAA,2BAAc,EAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5D,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,KAAK,GAAG,IAAA,2BAAc,EAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,KAAK,GAAG,IAAA,2BAAc,EAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,KAAK,GAAG,IAAA,2BAAc,EAAC,CAAC,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,KAAK,GAAG,IAAA,oBAAO,EAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,sBAAsB,EAAE,GAAG,EAAE;IACpC,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,KAAK,GAAG,IAAA,oBAAO,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACxD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wBAAwB,EAAE,GAAG,EAAE;QAChC,MAAM,KAAK,GAAG,IAAA,oBAAO,EAAC,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC5D,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,KAAK,GAAG,IAAA,oBAAO,EAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,kCAAkC,EAAE,GAAG,EAAE;IAChD,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,KAAK,GAAG,IAAA,2BAAc,EAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,mBAAM,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,6FAA6F;QAC7F,iDAAiD;QACjD,MAAM,SAAS,GAAY;YACzB,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC9B,IAAI,EAAE,KAAK;YACX,UAAU,EAAE,CAAC;YACb,QAAQ,EAAE;gBACR,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,gBAAgB,EAAE,CAAC,EAAE;gBACvF,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,gBAAgB,EAAE,CAAC,EAAE;aACrF;SACF,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,mBAAM,EAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,kBAAkB;QAClB,iEAAiE;QACjE,wFAAwF;QACxF,yDAAyD;QACzD,8CAA8C;QAC9C,EAAE;QACF,oFAAoF;QACpF,wCAAwC;QACxC,MAAM,GAAG,GAAY;YACnB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC/B,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,MAAM,IAAI,GAAY;YACpB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC/B,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,wCAAwC;QACxC,MAAM,OAAO,GAAY;YACvB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC/B,IAAI,EAAE,KAAK;YACX,UAAU,EAAE,CAAC;YACb,QAAQ,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC;SACtB,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,mBAAM,EAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,IAAI,GAAG,IAAA,yBAAY,EAAC,OAAO,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAA,mBAAM,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wFAAwF,EAAE,GAAG,EAAE;QAChG,2CAA2C;QAC3C,qFAAqF;QACrF,iCAAiC;QACjC,wDAAwD;QACxD,uDAAuD;QACvD,6FAA6F;QAC7F,+FAA+F;QAC/F,gGAAgG;QAChG,yEAAyE;QACzE,MAAM,OAAO,GAAY;YACvB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAClC,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,MAAM,OAAO,GAAY;YACvB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAClC,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,MAAM,EAAE,GAAY;YAClB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;YAC1C,IAAI,EAAE,MAAM;YACZ,QAAQ,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC;YAC5B,gBAAgB,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;SAC5B,CAAC;QACF,MAAM,EAAE,GAAY;YAClB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;YAC/C,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;SAC5B,CAAC;QACF,MAAM,OAAO,GAAY;YACvB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;YAC1C,IAAI,EAAE,KAAK;YACX,UAAU,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;YACrB,QAAQ,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC;SACnB,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,mBAAM,EAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,IAAI,GAAG,IAAA,yBAAY,EAAC,OAAO,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAA,mBAAM,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,sCAAsC;QACtC,IAAA,eAAM,EAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAClG,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qEAAqE,EAAE,GAAG,EAAE;QAC7E,0CAA0C;QAC1C,MAAM,GAAG,GAAY;YACnB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC/B,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,MAAM,GAAG,GAAY;YACnB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC/B,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,MAAM,OAAO,GAAY;YACvB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC/B,IAAI,EAAE,KAAK;YACX,UAAU,EAAE,CAAC;YACb,QAAQ,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;SACrB,CAAC;QACF,MAAM,IAAI,GAAG,IAAA,yBAAY,EAAC,OAAO,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAA,mBAAM,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,gCAAgC,EAAE,GAAG,EAAE;IAC9C,IAAA,WAAE,EAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,MAAM,EAAE,GAAY;YAClB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrC,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,GAAG,GAAY;YACnB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC/B,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,EAAE,GAAY;YAClB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC/B,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,MAAM,IAAI,GAAY;YACpB,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;YACtC,IAAI,EAAE,MAAM;YACZ,QAAQ,EAAE,CAAC,EAAE,CAAC;YACd,gBAAgB,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;SAC5B,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sBAAsB,EAAE,GAAG,EAAE;QAC9B,MAAM,EAAE,GAAY;YAClB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC/B,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,MAAM,CAAC,GAAY;YACjB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAClC,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,CAAC,EAAE,CAAC;YACd,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uBAAuB,EAAE,GAAG,EAAE;QAC/B,gCAAgC;QAChC,gFAAgF;QAChF,+EAA+E;QAC/E,+EAA+E;QAC/E,8EAA8E;QAC9E,MAAM,KAAK,GAAY;YACrB,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACjC,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,kFAAkF;QAClF,yCAAyC;QACzC,MAAM,KAAK,GAAY;YACrB,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC9B,IAAI,EAAE,QAAQ;YACd,QAAQ,EAAE,CAAC,KAAK,CAAC;YACjB,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,sEAAsE;QACtE,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,wDAAwD,EAAE,GAAG,EAAE;IACtE,IAAA,WAAE,EAAC,mEAAmE,EAAE,GAAG,EAAE;QAC3E,qEAAqE;QACrE,kEAAkE;QAClE,MAAM,QAAQ,GAAG,IAAA,2BAAc,EAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAChC,MAAM,OAAO,GAAY;YACvB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC/B,IAAI,EAAE,KAAK;YACX,UAAU,EAAE,CAAC;YACb,QAAQ,EAAE;gBACR,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,gBAAgB,EAAE,CAAC,EAAE;gBACrF,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,gBAAgB,EAAE,CAAC,EAAE;aACtF;SACF,CAAC;QACF,MAAM,IAAI,GAAG,IAAA,yBAAY,EAAC,OAAO,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAA,mBAAM,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8EAA8E,EAAE,GAAG,EAAE;QACtF,MAAM,KAAK,GAAG,IAAA,2BAAc,EAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,mBAAM,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,IAAI,GAAG,IAAA,yBAAY,EAAC,KAAM,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,IAAA,mBAAM,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|