)]}'
{
  "commit": "fd97addf43566deca6cb79a87567c2d8ca123a57",
  "tree": "8640017cf5060385e60391298fbc2e6580a07212",
  "parents": [
    "eee58f4506d28a14c9a171165f999445a0663d93"
  ],
  "author": {
    "name": "Leonardo de Moura",
    "email": "leomoura@amazon.com",
    "time": "Thu Dec 11 11:31:49 2025 +0100"
  },
  "committer": {
    "name": "Leonardo de Moura",
    "email": "leomoura@amazon.com",
    "time": "Thu Dec 11 11:31:49 2025 +0100"
  },
  "message": "feat: improve case-split heuristic in `grind`\n\nThis PR improves the case-split heuristics in `grind`.\nIn this PR, we do not increment the number of case splits in the first\ncase. The idea is to leverage non-chronological backtracking: if the first case\nis solved using a proof that doesn\u0027t depend on the case hypothesis, we backtrack and close\nthe original goal directly. In this scenario, the case-split was \"free\", it didn\u0027t contribute\nto the proof. By not counting it, we allow deeper exploration when case-splits turn out to be\nirrelevant.\nThe new heuristic addresses the second example in #11545\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "8b66155b68d0ce63539a77e30c910d32075c21ac",
      "old_mode": 33188,
      "old_path": "src/Lean/Meta/Tactic/Grind/Split.lean",
      "new_id": "03540d3102463d0fcbbbf74a0ef547fb5d56674f",
      "new_mode": 33188,
      "new_path": "src/Lean/Meta/Tactic/Grind/Split.lean"
    },
    {
      "type": "modify",
      "old_id": "97a07dceea62b821ece5dea04389645edbf39a04",
      "old_mode": 33188,
      "old_path": "tests/lean/run/grind_11081.lean",
      "new_id": "397485a9ab327601b643cfef04b3b299edf0468a",
      "new_mode": 33188,
      "new_path": "tests/lean/run/grind_11081.lean"
    },
    {
      "type": "add",
      "old_id": "0000000000000000000000000000000000000000",
      "old_mode": 0,
      "old_path": "/dev/null",
      "new_id": "f013176b33fb96e4b5c17a7c8052f8ce62429c7e",
      "new_mode": 33188,
      "new_path": "tests/lean/run/grind_11539_2.lean"
    }
  ]
}
