)]}'
{
  "commit": "323046c2eac0fa0375b4d945c9f2371cf0f9ed83",
  "tree": "f32664f91bcdbab7aaf98090a322d77c2b5dc886",
  "parents": [
    "a701b8aea92bace184f6be6f2f9750f178c3cf6d"
  ],
  "author": {
    "name": "Leonardo de Moura",
    "email": "leomoura@amazon.com",
    "time": "Sat Oct 24 01:28:58 2026 +0000"
  },
  "committer": {
    "name": "Leonardo de Moura",
    "email": "leomoura@amazon.com",
    "time": "Sat Oct 24 01:28:58 2026 +0000"
  },
  "message": "fix: revisit `grind` match conditions when nested subterms gain a constructor\n\nThis PR fixes `grind` missing a `match`-expression condition when a constructor for a nested subterm arrives after the outer merge. For example, given `h : ∀ n, v \u003d .lit (.nat n) → False`, `grind` closed the goal from `l \u003d .nat m` and `v \u003d .lit l` only when the facts arrived in that order. The same issue prevented conditions of `match` equations from becoming true, e.g., `f v \u003d 2` for `f` with the alternatives `.lit (.nat _) \u003d\u003e 1 | _ \u003d\u003e 2`, given `v \u003d .lit l` and `l \u003d .str s` from a case split.\n\nThe root cause was that `internalizeMatchCond` registers a `Grind.MatchCond` as a parent of the left-hand sides of its equations only, but `isSatisfied` and `tryToProveFalse` also inspect the fields of the constructor applications at the roots of their equivalence classes. In the example above, merging `l` with `.nat m` changes the equivalence class of `l`, not of `v`, so the condition was never revisited. The fix makes `isSatisfied` register the condition as a parent of each nested subterm blocking the decision: a subterm whose root is neither a constructor application nor a literal value, at a position where the pattern is not a pattern variable. Since `isSatisfied` runs on every visit of the condition, this covers both propagators. The `grind.debug` invariant checker now accepts these nested parents.\n\nCloses #15697\n\nCo-Authored-By: Claude Opus 5.5 \u003cnoreply@anthropic.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "ba873aa9937056f4e1d3fe1c0ff780ea4bdb9136",
      "old_mode": 33188,
      "old_path": "src/Lean/Meta/Tactic/Grind/Inv.lean",
      "new_id": "c779c4d0c877ee0a209a89790c030b1e50c5210f",
      "new_mode": 33188,
      "new_path": "src/Lean/Meta/Tactic/Grind/Inv.lean"
    },
    {
      "type": "modify",
      "old_id": "a9c099b8b6a8e62f7e9cb8b9f79f537850a43a85",
      "old_mode": 33188,
      "old_path": "src/Lean/Meta/Tactic/Grind/MatchCond.lean",
      "new_id": "1f4dbba779c8b97e447aa6c6719532eef985e01d",
      "new_mode": 33188,
      "new_path": "src/Lean/Meta/Tactic/Grind/MatchCond.lean"
    },
    {
      "type": "add",
      "old_id": "0000000000000000000000000000000000000000",
      "old_mode": 0,
      "old_path": "/dev/null",
      "new_id": "933e1db300395e3fd5292a7d1c61eb306376a80f",
      "new_mode": 33188,
      "new_path": "tests/elab/issue15697.lean"
    }
  ]
}
