Record 21 verified HPC batch manifests

manifests/batches/mathlib/000603.json

@@ -0,0 +1,257 @@
+{
+  "format": "leangpt-parquet-v2",
+  "batch": "mathlib/000603",
+  "batch_fingerprint": "aa6d7f7ebdfc493dca3af084ab329c4544d39141278148680084391016036728",
+  "evidence": {
+    "batch_fingerprint": "aa6d7f7ebdfc493dca3af084ab329c4544d39141278148680084391016036728",
+    "contamination_matches": [],
+    "failures": [
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.isLeftAdjoint_iff_hasTerminal_costructuredArrow",
+        "id": "CategoryTheory.isLeftAdjoint_iff_hasTerminal_costructuredArrow",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            174,
+            60
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/Comma.lean",
+          "full_name": "CategoryTheory.isLeftAdjoint_iff_hasTerminal_costructuredArrow",
+          "start": [
+            171,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/Comma.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.isLeftAdjoint_of_costructuredArrowTerminals",
+        "id": "CategoryTheory.isLeftAdjoint_of_costructuredArrowTerminals",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            129,
+            90
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/Comma.lean",
+          "full_name": "CategoryTheory.isLeftAdjoint_of_costructuredArrowTerminals",
+          "start": [
+            126,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/Comma.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.isRightAdjointOfStructuredArrowInitials",
+        "id": "CategoryTheory.isRightAdjointOfStructuredArrowInitials",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            79,
+            69
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/Comma.lean",
+          "full_name": "CategoryTheory.isRightAdjointOfStructuredArrowInitials",
+          "start": [
+            77,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/Comma.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.isRightAdjoint_iff_hasInitial_structuredArrow",
+        "id": "CategoryTheory.isRightAdjoint_iff_hasInitial_structuredArrow",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            168,
+            56
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/Comma.lean",
+          "full_name": "CategoryTheory.isRightAdjoint_iff_hasInitial_structuredArrow",
+          "start": [
+            165,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/Comma.lean"
+      }
+    ],
+    "input_proofs": 6,
+    "input_units": 2,
+    "proofs": 2,
+    "published_proofs": 0,
+    "published_transitions": 0,
+    "replay_failures": [],
+    "transitions": 10,
+    "validation_failures": [
+      {
+        "errors": [
+          "internal transition boundary mismatch",
+          "internal transition boundary mismatch"
+        ],
+        "file_path": "Mathlib/CategoryTheory/Adjunction/Evaluation.lean",
+        "proof_id": "mathlib:CategoryTheory.NatTrans.epi_iff_epi_app",
+        "provenance": {
+          "selection": {
+            "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+            "end": [
+              145,
+              34
+            ],
+            "file_path": "Mathlib/CategoryTheory/Adjunction/Evaluation.lean",
+            "full_name": "CategoryTheory.NatTrans.epi_iff_epi_app",
+            "start": [
+              140,
+              1
+            ],
+            "traced_tactics": [
+              {
+                "annotated_tactic": [
+                  "\"constructor\"",
+                  "[]"
+                ],
+                "state_after": "case mp\nC : Type u\u2081\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\ninst\u271d : \u2200 (a b : C), HasProductsOfShape (a \u27f6 b) D\nF G : C \u2964 D\n\u03b7 : F \u27f6 G\n\u22a2 Epi \u03b7 \u2192 \u2200 (c : C), Epi (\u03b7.app c)\n\ncase mpr\nC : Type u\u2081\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\ninst\u271d : \u2200 (a b : C), HasProductsOfShape (a \u27f6 b) D\nF G : C \u2964 D\n\u03b7 : F \u27f6 G\n\u22a2 (\u2200 (c : C), Epi (\u03b7.app c)) \u2192 Epi \u03b7",
+                "state_before": "C : Type u\u2081\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\ninst\u271d : \u2200 (a b : C), HasProductsOfShape (a \u27f6 b) D\nF G : C \u2964 D\n\u03b7 : F \u27f6 G\n\u22a2 Epi \u03b7 \u2194 \u2200 (c : C), Epi (\u03b7.app c)",
+                "tactic": "constructor"
+              },
+              {
+                "annotated_tactic": [
+                  "\"intro h c\"",
+                  "[]"
+                ],
+                "state_after": "case mp\nC : Type u\u2081\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\ninst\u271d : \u2200 (a b : C), HasProductsOfShape (a \u27f6 b) D\nF G : C \u2964 D\n\u03b7 : F \u27f6 G\nh : Epi \u03b7\nc : C\n\u22a2 Epi (\u03b7.app c)",
+                "state_before": "case mp\nC : Type u\u2081\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\ninst\u271d : \u2200 (a b : C), HasProductsOfShape (a \u27f6 b) D\nF G : C \u2964 D\n\u03b7 : F \u27f6 G\n\u22a2 Epi \u03b7 \u2192 \u2200 (c : C), Epi (\u03b7.app c)",
+                "tactic": "intro h c"
+              },
+              {
+                "annotated_tactic": [
+                  "\"exact (<a>inferInstance<\\/a> : <a>Epi<\\/a> (((<a>evaluation<\\/a> _ _).<a>obj<\\/a> c).<a>map<\\/a> \\u03b7))\"",
+                  "[{\"full_name\":\"inferInstance\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Prelude.lean\",\"def_pos\":[99,8],\"def_end_pos\":[99,21]},{\"full_name\":\"CategoryTheory.Epi\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Category\\/Basic.lean\",\"def_pos\":[285,7],\"def_end_pos\":[285,10]},{\"full_name\":\"CategoryTheory.evaluation\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Products\\/Basic.lean\",\"def_pos\":[187,5],\"def_end_pos\":[187,15]},{\"full_name\":\"Prefunctor.obj\",\"def_path\":\"Mathlib\\/Combinatorics\\/Quiver\\/Basic.lean\",\"def_pos\":[59,3],\"def_end_pos\":[59,6]},{\"full_name\":\"Prefunctor.map\",\"def_path\":\"Mathlib\\/Combinatorics\\/Quiver\\/Basic.lean\",\"def_pos\":[61,3],\"def_end_pos\":[61,6]}]"
+                ],
+                "state_after": "no goals",
+                "state_before": "case mp\nC : Type u\u2081\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\ninst\u271d : \u2200 (a b : C), HasProductsOfShape (a \u27f6 b) D\nF G : C \u2964 D\n\u03b7 : F \u27f6 G\nh : Epi \u03b7\nc : C\n\u22a2 Epi (\u03b7.app c)",
+                "tactic": "exact (inferInstance : Epi (((evaluation _ _).obj c).map \u03b7))"
+              },
+              {
+                "annotated_tactic": [
+                  "\"intros\"",
+                  "[]"
+                ],
+                "state_after": "case mpr\nC : Type u\u2081\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\ninst\u271d : \u2200 (a b : C), HasProductsOfShape (a \u27f6 b) D\nF G : C \u2964 D\n\u03b7 : F \u27f6 G\na\u271d : \u2200 (c : C), Epi (\u03b7.app c)\n\u22a2 Epi \u03b7",
+                "state_before": "case mpr\nC : Type u\u2081\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\ninst\u271d : \u2200 (a b : C), HasProductsOfShape (a \u27f6 b) D\nF G : C \u2964 D\n\u03b7 : F \u27f6 G\n\u22a2 (\u2200 (c : C), Epi (\u03b7.app c)) \u2192 Epi \u03b7",
+                "tactic": "intros"
+              },
+              {
+                "annotated_tactic": [
+                  "\"apply <a>NatTrans.epi_of_epi_app<\\/a>\"",
+                  "[{\"full_name\":\"CategoryTheory.NatTrans.epi_of_epi_app\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Functor\\/Category.lean\",\"def_pos\":[102,9],\"def_end_pos\":[102,23]}]"
+                ],
+                "state_after": "no goals",
+                "state_before": "case mpr\nC : Type u\u2081\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\ninst\u271d : \u2200 (a b : C), HasProductsOfShape (a \u27f6 b) D\nF G : C \u2964 D\n\u03b7 : F \u27f6 G\na\u271d : \u2200 (c : C), Epi (\u03b7.app c)\n\u22a2 Epi \u03b7",
+                "tactic": "apply NatTrans.epi_of_epi_app"
+              }
+            ],
+            "url": "https://github.com/leanprover-community/mathlib4"
+          }
+        },
+        "theorem_name": "CategoryTheory.NatTrans.epi_iff_epi_app"
+      },
+      {
+        "errors": [
+          "internal transition boundary mismatch",
+          "internal transition boundary mismatch"
+        ],
+        "file_path": "Mathlib/CategoryTheory/Adjunction/Evaluation.lean",
+        "proof_id": "mathlib:CategoryTheory.NatTrans.mono_iff_mono_app",
+        "provenance": {
+          "selection": {
+            "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+            "end": [
+              86,
+              36
+            ],
+            "file_path": "Mathlib/CategoryTheory/Adjunction/Evaluation.lean",
+            "full_name": "CategoryTheory.NatTrans.mono_iff_mono_app",
+            "start": [
+              81,
+              1
+            ],
+            "traced_tactics": [
+              {
+                "annotated_tactic": [
+                  "\"constructor\"",
+                  "[]"
+                ],
+                "state_after": "case mp\nC : Type u\u2081\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\ninst\u271d : \u2200 (a b : C), HasCoproductsOfShape (a \u27f6 b) D\nF G : C \u2964 D\n\u03b7 : F \u27f6 G\n\u22a2 Mono \u03b7 \u2192 \u2200 (c : C), Mono (\u03b7.app c)\n\ncase mpr\nC : Type u\u2081\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\ninst\u271d : \u2200 (a b : C), HasCoproductsOfShape (a \u27f6 b) D\nF G : C \u2964 D\n\u03b7 : F \u27f6 G\n\u22a2 (\u2200 (c : C), Mono (\u03b7.app c)) \u2192 Mono \u03b7",
+                "state_before": "C : Type u\u2081\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\ninst\u271d : \u2200 (a b : C), HasCoproductsOfShape (a \u27f6 b) D\nF G : C \u2964 D\n\u03b7 : F \u27f6 G\n\u22a2 Mono \u03b7 \u2194 \u2200 (c : C), Mono (\u03b7.app c)",
+                "tactic": "constructor"
+              },
+              {
+                "annotated_tactic": [
+                  "\"intro h c\"",
+                  "[]"
+                ],
+                "state_after": "case mp\nC : Type u\u2081\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\ninst\u271d : \u2200 (a b : C), HasCoproductsOfShape (a \u27f6 b) D\nF G : C \u2964 D\n\u03b7 : F \u27f6 G\nh : Mono \u03b7\nc : C\n\u22a2 Mono (\u03b7.app c)",
+                "state_before": "case mp\nC : Type u\u2081\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\ninst\u271d : \u2200 (a b : C), HasCoproductsOfShape (a \u27f6 b) D\nF G : C \u2964 D\n\u03b7 : F \u27f6 G\n\u22a2 Mono \u03b7 \u2192 \u2200 (c : C), Mono (\u03b7.app c)",
+                "tactic": "intro h c"
+              },
+              {
+                "annotated_tactic": [
+                  "\"exact (<a>inferInstance<\\/a> : <a>Mono<\\/a> (((<a>evaluation<\\/a> _ _).<a>obj<\\/a> c).<a>map<\\/a> \\u03b7))\"",
+                  "[{\"full_name\":\"inferInstance\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Prelude.lean\",\"def_pos\":[99,8],\"def_end_pos\":[99,21]},{\"full_name\":\"CategoryTheory.Mono\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Category\\/Basic.lean\",\"def_pos\":[295,7],\"def_end_pos\":[295,11]},{\"full_name\":\"CategoryTheory.evaluation\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Products\\/Basic.lean\",\"def_pos\":[187,5],\"def_end_pos\":[187,15]},{\"full_name\":\"Prefunctor.obj\",\"def_path\":\"Mathlib\\/Combinatorics\\/Quiver\\/Basic.lean\",\"def_pos\":[59,3],\"def_end_pos\":[59,6]},{\"full_name\":\"Prefunctor.map\",\"def_path\":\"Mathlib\\/Combinatorics\\/Quiver\\/Basic.lean\",\"def_pos\":[61,3],\"def_end_pos\":[61,6]}]"
+                ],
+                "state_after": "no goals",
+                "state_before": "case mp\nC : Type u\u2081\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\ninst\u271d : \u2200 (a b : C), HasCoproductsOfShape (a \u27f6 b) D\nF G : C \u2964 D\n\u03b7 : F \u27f6 G\nh : Mono \u03b7\nc : C\n\u22a2 Mono (\u03b7.app c)",
+                "tactic": "exact (inferInstance : Mono (((evaluation _ _).obj c).map \u03b7))"
+              },
+              {
+                "annotated_tactic": [
+                  "\"intro _\"",
+                  "[]"
+                ],
+                "state_after": "case mpr\nC : Type u\u2081\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\ninst\u271d : \u2200 (a b : C), HasCoproductsOfShape (a \u27f6 b) D\nF G : C \u2964 D\n\u03b7 : F \u27f6 G\na\u271d : \u2200 (c : C), Mono (\u03b7.app c)\n\u22a2 Mono \u03b7",
+                "state_before": "case mpr\nC : Type u\u2081\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\ninst\u271d : \u2200 (a b : C), HasCoproductsOfShape (a \u27f6 b) D\nF G : C \u2964 D\n\u03b7 : F \u27f6 G\n\u22a2 (\u2200 (c : C), Mono (\u03b7.app c)) \u2192 Mono \u03b7",
+                "tactic": "intro _"
+              },
+              {
+                "annotated_tactic": [
+                  "\"apply <a>NatTrans.mono_of_mono_app<\\/a>\"",
+                  "[{\"full_name\":\"CategoryTheory.NatTrans.mono_of_mono_app\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Functor\\/Category.lean\",\"def_pos\":[95,9],\"def_end_pos\":[95,25]}]"
+                ],
+                "state_after": "no goals",
+                "state_before": "case mpr\nC : Type u\u2081\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\ninst\u271d : \u2200 (a b : C), HasCoproductsOfShape (a \u27f6 b) D\nF G : C \u2964 D\n\u03b7 : F \u27f6 G\na\u271d : \u2200 (c : C), Mono (\u03b7.app c)\n\u22a2 Mono \u03b7",
+                "tactic": "apply NatTrans.mono_of_mono_app"
+              }
+            ],
+            "url": "https://github.com/leanprover-community/mathlib4"
+          }
+        },
+        "theorem_name": "CategoryTheory.NatTrans.mono_iff_mono_app"
+      }
+    ],
+    "validation_rejected_proofs": 2,
+    "zero_transition_proofs": 0
+  },
+  "shards": [],
+  "proof_ids": [],
+  "proof_keys": []
+}

manifests/batches/mathlib/000604.json

@@ -0,0 +1,574 @@
+{
+  "format": "leangpt-parquet-v2",
+  "batch": "mathlib/000604",
+  "batch_fingerprint": "478b14abac062f97326356a4ca64e986f975999cdc91d65f0f9baa293bc27717",
+  "evidence": {
+    "batch_fingerprint": "478b14abac062f97326356a4ca64e986f975999cdc91d65f0f9baa293bc27717",
+    "contamination_matches": [],
+    "failures": [
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Adjunction.inv_counit_map",
+        "id": "CategoryTheory.Adjunction.inv_counit_map",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            105,
+            61
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/FullyFaithful.lean",
+          "full_name": "CategoryTheory.Adjunction.inv_counit_map",
+          "start": [
+            103,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/FullyFaithful.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Adjunction.inv_map_unit",
+        "id": "CategoryTheory.Adjunction.inv_map_unit",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            90,
+            60
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/FullyFaithful.lean",
+          "full_name": "CategoryTheory.Adjunction.inv_map_unit",
+          "start": [
+            88,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/FullyFaithful.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Adjunction.isEquivalence_left_of_isEquivalence_right",
+        "id": "CategoryTheory.Adjunction.isEquivalence_left_of_isEquivalence_right",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            219,
+            40
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/FullyFaithful.lean",
+          "full_name": "CategoryTheory.Adjunction.isEquivalence_left_of_isEquivalence_right",
+          "start": [
+            218,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/FullyFaithful.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Adjunction.isEquivalence_right_of_isEquivalence_left",
+        "id": "CategoryTheory.Adjunction.isEquivalence_right_of_isEquivalence_left",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            222,
+            40
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/FullyFaithful.lean",
+          "full_name": "CategoryTheory.Adjunction.isEquivalence_right_of_isEquivalence_left",
+          "start": [
+            221,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/FullyFaithful.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Adjunction.isIso_counit_app_of_iso",
+        "id": "CategoryTheory.Adjunction.isIso_counit_app_of_iso",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            180,
+            58
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/FullyFaithful.lean",
+          "full_name": "CategoryTheory.Adjunction.isIso_counit_app_of_iso",
+          "start": [
+            178,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/FullyFaithful.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Adjunction.isIso_unit_app_of_iso",
+        "id": "CategoryTheory.Adjunction.isIso_unit_app_of_iso",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            208,
+            56
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/FullyFaithful.lean",
+          "full_name": "CategoryTheory.Adjunction.isIso_unit_app_of_iso",
+          "start": [
+            206,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/FullyFaithful.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Adjunction.mem_essImage_of_counit_isIso",
+        "id": "CategoryTheory.Adjunction.mem_essImage_of_counit_isIso",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            176,
+            38
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/FullyFaithful.lean",
+          "full_name": "CategoryTheory.Adjunction.mem_essImage_of_counit_isIso",
+          "start": [
+            174,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/FullyFaithful.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Adjunction.mem_essImage_of_unit_isIso",
+        "id": "CategoryTheory.Adjunction.mem_essImage_of_unit_isIso",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            200,
+            43
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/FullyFaithful.lean",
+          "full_name": "CategoryTheory.Adjunction.mem_essImage_of_unit_isIso",
+          "start": [
+            198,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/FullyFaithful.lean"
+      },
+      {
+        "full_name": "CategoryTheory.adjointSquareLift",
+        "id": "CategoryTheory.adjointSquareLift",
+        "reason": "missing_trace",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            230,
+            56
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/Lifting.lean",
+          "full_name": "CategoryTheory.adjointSquareLift",
+          "start": [
+            211,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/Lifting.lean"
+      },
+      {
+        "full_name": "CategoryTheory.adjointTriangleLift",
+        "id": "CategoryTheory.adjointTriangleLift",
+        "reason": "missing_trace",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            183,
+            46
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/Lifting.lean",
+          "full_name": "CategoryTheory.adjointTriangleLift",
+          "start": [
+            171,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/Lifting.lean"
+      },
+      {
+        "full_name": "CategoryTheory.monadicAdjointSquareLift",
+        "id": "CategoryTheory.monadicAdjointSquareLift",
+        "reason": "missing_trace",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            250,
+            31
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/Lifting.lean",
+          "full_name": "CategoryTheory.monadicAdjointSquareLift",
+          "start": [
+            233,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/Lifting.lean"
+      },
+      {
+        "full_name": "CategoryTheory.monadicAdjointTriangleLift",
+        "id": "CategoryTheory.monadicAdjointTriangleLift",
+        "reason": "missing_trace",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            205,
+            45
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/Lifting.lean",
+          "full_name": "CategoryTheory.monadicAdjointTriangleLift",
+          "start": [
+            185,
+            1
+          ],
+          "traced_tactics": [
+            {
+              "annotated_tactic": [
+                "\"let R' : A \\u2964 _ := R \\u22d9 <a>Monad.comparison<\\/a> (<a>monadicAdjunction<\\/a> U)\"",
+                "[{\"full_name\":\"CategoryTheory.Monad.comparison\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Monad\\/Adjunction.lean\",\"def_pos\":[100,5],\"def_end_pos\":[100,21]},{\"full_name\":\"CategoryTheory.monadicAdjunction\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Monad\\/Adjunction.lean\",\"def_pos\":[206,5],\"def_end_pos\":[206,22]}]"
+              ],
+              "state_after": "A : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\nR' : A \u2964 (monadicAdjunction U).toMonad.Algebra := R \u22d9 Monad.comparison (monadicAdjunction U)\n\u22a2 R.IsRightAdjoint",
+              "state_before": "A : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\n\u22a2 R.IsRightAdjoint",
+              "tactic": "let R' : A \u2964 _ := R \u22d9 Monad.comparison (monadicAdjunction U)"
+            },
+            {
+              "annotated_tactic": [
+                "\"rsuffices : R'.IsRightAdjoint\"",
+                "[]"
+              ],
+              "state_after": "A : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\nR' : A \u2964 (monadicAdjunction U).toMonad.Algebra := R \u22d9 Monad.comparison (monadicAdjunction U)\nthis\u271d : R'.IsRightAdjoint\n\u22a2 R.IsRightAdjoint\n\nA : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\nR' : A \u2964 (monadicAdjunction U).toMonad.Algebra := R \u22d9 Monad.comparison (monadicAdjunction U)\n\u22a2 R'.IsRightAdjoint",
+              "state_before": "A : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\nR' : A \u2964 (monadicAdjunction U).toMonad.Algebra := R \u22d9 Monad.comparison (monadicAdjunction U)\n\u22a2 R.IsRightAdjoint",
+              "tactic": "rsuffices : R'.IsRightAdjoint"
+            },
+            {
+              "annotated_tactic": [
+                "\"let this : (R' \\u22d9 <a>Monad.forget<\\/a> (<a>monadicAdjunction<\\/a> U).<a>toMonad<\\/a>).<a>IsRightAdjoint<\\/a> := by\\n    refine ((<a>Adjunction.ofIsRightAdjoint<\\/a> (R \\u22d9 U)).<a>ofNatIsoRight<\\/a> ?_).<a>isRightAdjoint<\\/a>\\n    exact <a>isoWhiskerLeft<\\/a> R (<a>Monad.comparisonForget<\\/a> (<a>monadicAdjunction<\\/a> U)).<a>symm<\\/a>\"",
+                "[{\"full_name\":\"CategoryTheory.Monad.forget\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Monad\\/Algebra.lean\",\"def_pos\":[154,5],\"def_end_pos\":[154,11]},{\"full_name\":\"CategoryTheory.monadicAdjunction\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Monad\\/Adjunction.lean\",\"def_pos\":[206,5],\"def_end_pos\":[206,22]},{\"full_name\":\"CategoryTheory.Adjunction.toMonad\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Monad\\/Adjunction.lean\",\"def_pos\":[46,5],\"def_end_pos\":[46,12]},{\"full_name\":\"CategoryTheory.Functor.IsRightAdjoint\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Basic.lean\",\"def_pos\":[92,7],\"def_end_pos\":[92,21]},{\"full_name\":\"CategoryTheory.Adjunction.ofIsRightAdjoint\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Basic.lean\",\"def_pos\":[115,19],\"def_end_pos\":[115,46]},{\"full_name\":\"CategoryTheory.Adjunction.ofNatIsoRight\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Basic.lean\",\"def_pos\":[471,5],\"def_end_pos\":[471,18]},{\"full_name\":\"CategoryTheory.Adjunction.isRightAdjoint\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Basic.lean\",\"def_pos\":[135,7],\"def_end_pos\":[135,21]},{\"full_name\":\"CategoryTheory.isoWhiskerLeft\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Whiskering.lean\",\"def_pos\":[172,5],\"def_end_pos\":[172,19]},{\"full_name\":\"CategoryTheory.Monad.comparisonForget\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Monad\\/Adjunction.lean\",\"def_pos\":[117,5],\"def_end_pos\":[117,27]},{\"full_name\":\"CategoryTheory.monadicAdjunction\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Monad\\/Adjunction.lean\",\"def_pos\":[206,5],\"def_end_pos\":[206,22]},{\"full_name\":\"CategoryTheory.Iso.symm\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Iso.lean\",\"def_pos\":[94,5],\"def_end_pos\":[94,9]}]"
+              ],
+              "state_after": "A : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\nR' : A \u2964 (monadicAdjunction U).toMonad.Algebra := R \u22d9 Monad.comparison (monadicAdjunction U)\nthis : (R' \u22d9 (monadicAdjunction U).toMonad.forget).IsRightAdjoint :=\n  Adjunction.isRightAdjoint\n    ((Adjunction.ofIsRightAdjoint (R \u22d9 U)).ofNatIsoRight\n      (isoWhiskerLeft R (Monad.comparisonForget (monadicAdjunction U)).symm))\n\u22a2 R'.IsRightAdjoint",
+              "state_before": "A : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\nR' : A \u2964 (monadicAdjunction U).toMonad.Algebra := R \u22d9 Monad.comparison (monadicAdjunction U)\n\u22a2 R'.IsRightAdjoint",
+              "tactic": "let this : (R' \u22d9 Monad.forget (monadicAdjunction U).toMonad).IsRightAdjoint := by\n  refine ((Adjunction.ofIsRightAdjoint (R \u22d9 U)).ofNatIsoRight ?_).isRightAdjoint\n  exact isoWhiskerLeft R (Monad.comparisonForget (monadicAdjunction U)).symm"
+            },
+            {
+              "annotated_tactic": [
+                "\"let this : \\u2200 X, <a>RegularEpi<\\/a> ((<a>Monad.adj<\\/a> (<a>monadicAdjunction<\\/a> U).<a>toMonad<\\/a>).counit.app X) := by\\n    intro X\\n    simp only [<a>Monad.adj_counit<\\/a>]\\n    exact \\u27e8_, _, _, _, <a>Monad.beckAlgebraCoequalizer<\\/a> X\\u27e9\"",
+                "[{\"full_name\":\"CategoryTheory.RegularEpi\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Limits\\/Shapes\\/RegularMono.lean\",\"def_pos\":[184,7],\"def_end_pos\":[184,17]},{\"full_name\":\"CategoryTheory.Monad.adj\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Monad\\/Algebra.lean\",\"def_pos\":[179,5],\"def_end_pos\":[179,8]},{\"full_name\":\"CategoryTheory.monadicAdjunction\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Monad\\/Adjunction.lean\",\"def_pos\":[206,5],\"def_end_pos\":[206,22]},{\"full_name\":\"CategoryTheory.Adjunction.toMonad\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Monad\\/Adjunction.lean\",\"def_pos\":[46,5],\"def_end_pos\":[46,12]},{\"full_name\":\"CategoryTheory.Monad.adj_counit\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Monad\\/Algebra.lean\",\"def_pos\":[178,15],\"def_end_pos\":[178,21]},{\"full_name\":\"CategoryTheory.Monad.beckAlgebraCoequalizer\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Monad\\/Coequalizer.lean\",\"def_pos\":[87,5],\"def_end_pos\":[87,27]}]"
+              ],
+              "state_after": "A : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\nR' : A \u2964 (monadicAdjunction U).toMonad.Algebra := R \u22d9 Monad.comparison (monadicAdjunction U)\nthis\u271d : (R' \u22d9 (monadicAdjunction U).toMonad.forget).IsRightAdjoint :=\n  Adjunction.isRightAdjoint\n    ((Adjunction.ofIsRightAdjoint (R \u22d9 U)).ofNatIsoRight\n      (isoWhiskerLeft R (Monad.comparisonForget (monadicAdjunction U)).symm))\nthis : (X : (monadicAdjunction U).toMonad.Algebra) \u2192 RegularEpi ((monadicAdjunction U).toMonad.adj.counit.app X) :=\n  fun X =>\n    \u22ef.mpr\n      { W := (monadicAdjunction U).toMonad.free.obj ((monadicAdjunction U).toMonad.obj X.A),\n        left := Monad.FreeCoequalizer.topMap X, right := Monad.FreeCoequalizer.bottomMap X, w := \u22ef,\n        isColimit := Monad.beckAlgebraCoequalizer X }\n\u22a2 R'.IsRightAdjoint",
+              "state_before": "A : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\nR' : A \u2964 (monadicAdjunction U).toMonad.Algebra := R \u22d9 Monad.comparison (monadicAdjunction U)\nthis : (R' \u22d9 (monadicAdjunction U).toMonad.forget).IsRightAdjoint :=\n  Adjunction.isRightAdjoint\n    ((Adjunction.ofIsRightAdjoint (R \u22d9 U)).ofNatIsoRight\n      (isoWhiskerLeft R (Monad.comparisonForget (monadicAdjunction U)).symm))\n\u22a2 R'.IsRightAdjoint",
+              "tactic": "let this : \u2200 X, RegularEpi ((Monad.adj (monadicAdjunction U).toMonad).counit.app X) := by\n  intro X\n  simp only [Monad.adj_counit]\n  exact \u27e8_, _, _, _, Monad.beckAlgebraCoequalizer X\u27e9"
+            },
+            {
+              "annotated_tactic": [
+                "\"exact <a>adjointTriangleLift<\\/a> R' (<a>Monad.adj<\\/a> _)\"",
+                "[{\"full_name\":\"CategoryTheory.adjointTriangleLift\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Lifting.lean\",\"def_pos\":[178,7],\"def_end_pos\":[178,26]},{\"full_name\":\"CategoryTheory.Monad.adj\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Monad\\/Algebra.lean\",\"def_pos\":[179,5],\"def_end_pos\":[179,8]}]"
+              ],
+              "state_after": "no goals",
+              "state_before": "A : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\nR' : A \u2964 (monadicAdjunction U).toMonad.Algebra := R \u22d9 Monad.comparison (monadicAdjunction U)\nthis\u271d : (R' \u22d9 (monadicAdjunction U).toMonad.forget).IsRightAdjoint :=\n  Adjunction.isRightAdjoint\n    ((Adjunction.ofIsRightAdjoint (R \u22d9 U)).ofNatIsoRight\n      (isoWhiskerLeft R (Monad.comparisonForget (monadicAdjunction U)).symm))\nthis : (X : (monadicAdjunction U).toMonad.Algebra) \u2192 RegularEpi ((monadicAdjunction U).toMonad.adj.counit.app X) :=\n  fun X =>\n    \u22ef.mpr\n      { W := (monadicAdjunction U).toMonad.free.obj ((monadicAdjunction U).toMonad.obj X.A),\n        left := Monad.FreeCoequalizer.topMap X, right := Monad.FreeCoequalizer.bottomMap X, w := \u22ef,\n        isColimit := Monad.beckAlgebraCoequalizer X }\n\u22a2 R'.IsRightAdjoint",
+              "tactic": "exact adjointTriangleLift R' (Monad.adj _)"
+            },
+            {
+              "annotated_tactic": [
+                "\"let this : (R' \\u22d9 (<a>Monad.comparison<\\/a> (<a>monadicAdjunction<\\/a> U)).<a>inv<\\/a>).<a>IsRightAdjoint<\\/a> := by\\n      infer_instance\"",
+                "[{\"full_name\":\"CategoryTheory.Monad.comparison\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Monad\\/Adjunction.lean\",\"def_pos\":[100,5],\"def_end_pos\":[100,21]},{\"full_name\":\"CategoryTheory.monadicAdjunction\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Monad\\/Adjunction.lean\",\"def_pos\":[206,5],\"def_end_pos\":[206,22]},{\"full_name\":\"CategoryTheory.Functor.inv\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Equivalence.lean\",\"def_pos\":[569,19],\"def_end_pos\":[569,22]},{\"full_name\":\"CategoryTheory.Functor.IsRightAdjoint\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Basic.lean\",\"def_pos\":[92,7],\"def_end_pos\":[92,21]}]"
+              ],
+              "state_after": "A : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\nR' : A \u2964 (monadicAdjunction U).toMonad.Algebra := R \u22d9 Monad.comparison (monadicAdjunction U)\nthis\u271d : R'.IsRightAdjoint\nthis : (R' \u22d9 (Monad.comparison (monadicAdjunction U)).inv).IsRightAdjoint := inferInstance\n\u22a2 R.IsRightAdjoint",
+              "state_before": "A : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\nR' : A \u2964 (monadicAdjunction U).toMonad.Algebra := R \u22d9 Monad.comparison (monadicAdjunction U)\nthis\u271d : R'.IsRightAdjoint\n\u22a2 R.IsRightAdjoint",
+              "tactic": "let this : (R' \u22d9 (Monad.comparison (monadicAdjunction U)).inv).IsRightAdjoint := by\n  infer_instance"
+            },
+            {
+              "annotated_tactic": [
+                "\"refine ((<a>Adjunction.ofIsRightAdjoint<\\/a>\\n      (R' \\u22d9 (<a>Monad.comparison<\\/a> (<a>monadicAdjunction<\\/a> U)).<a>inv<\\/a>)).<a>ofNatIsoRight<\\/a> ?_).<a>isRightAdjoint<\\/a>\"",
+                "[{\"full_name\":\"CategoryTheory.Adjunction.ofIsRightAdjoint\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Basic.lean\",\"def_pos\":[115,19],\"def_end_pos\":[115,46]},{\"full_name\":\"CategoryTheory.Monad.comparison\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Monad\\/Adjunction.lean\",\"def_pos\":[100,5],\"def_end_pos\":[100,21]},{\"full_name\":\"CategoryTheory.monadicAdjunction\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Monad\\/Adjunction.lean\",\"def_pos\":[206,5],\"def_end_pos\":[206,22]},{\"full_name\":\"CategoryTheory.Functor.inv\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Equivalence.lean\",\"def_pos\":[569,19],\"def_end_pos\":[569,22]},{\"full_name\":\"CategoryTheory.Adjunction.ofNatIsoRight\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Basic.lean\",\"def_pos\":[471,5],\"def_end_pos\":[471,18]},{\"full_name\":\"CategoryTheory.Adjunction.isRightAdjoint\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Basic.lean\",\"def_pos\":[135,7],\"def_end_pos\":[135,21]}]"
+              ],
+              "state_after": "A : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\nR' : A \u2964 (monadicAdjunction U).toMonad.Algebra := R \u22d9 Monad.comparison (monadicAdjunction U)\nthis\u271d : R'.IsRightAdjoint\nthis : (R' \u22d9 (Monad.comparison (monadicAdjunction U)).inv).IsRightAdjoint := inferInstance\n\u22a2 R' \u22d9 (Monad.comparison (monadicAdjunction U)).inv \u2245 R",
+              "state_before": "A : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\nR' : A \u2964 (monadicAdjunction U).toMonad.Algebra := R \u22d9 Monad.comparison (monadicAdjunction U)\nthis\u271d : R'.IsRightAdjoint\nthis : (R' \u22d9 (Monad.comparison (monadicAdjunction U)).inv).IsRightAdjoint := inferInstance\n\u22a2 R.IsRightAdjoint",
+              "tactic": "refine ((Adjunction.ofIsRightAdjoint\n  (R' \u22d9 (Monad.comparison (monadicAdjunction U)).inv)).ofNatIsoRight ?_).isRightAdjoint"
+            },
+            {
+              "annotated_tactic": [
+                "\"exact <a>isoWhiskerLeft<\\/a> R (<a>Monad.comparison<\\/a> _).asEquivalence.unitIso.symm \\u226a\\u226b R.rightUnitor\"",
+                "[{\"full_name\":\"CategoryTheory.isoWhiskerLeft\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Whiskering.lean\",\"def_pos\":[172,5],\"def_end_pos\":[172,19]},{\"full_name\":\"CategoryTheory.Monad.comparison\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Monad\\/Adjunction.lean\",\"def_pos\":[100,5],\"def_end_pos\":[100,21]}]"
+              ],
+              "state_after": "no goals",
+              "state_before": "A : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\nR' : A \u2964 (monadicAdjunction U).toMonad.Algebra := R \u22d9 Monad.comparison (monadicAdjunction U)\nthis\u271d : R'.IsRightAdjoint\nthis : (R' \u22d9 (Monad.comparison (monadicAdjunction U)).inv).IsRightAdjoint := inferInstance\n\u22a2 R' \u22d9 (Monad.comparison (monadicAdjunction U)).inv \u2245 R",
+              "tactic": "exact isoWhiskerLeft R (Monad.comparison _).asEquivalence.unitIso.symm \u226a\u226b R.rightUnitor"
+            },
+            {
+              "annotated_tactic": [
+                "\"infer_instance\"",
+                "[]"
+              ],
+              "state_after": "no goals",
+              "state_before": "A : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\nR' : A \u2964 (monadicAdjunction U).toMonad.Algebra := R \u22d9 Monad.comparison (monadicAdjunction U)\nthis\u271d : R'.IsRightAdjoint\n\u22a2 (R' \u22d9 (Monad.comparison (monadicAdjunction U)).inv).IsRightAdjoint",
+              "tactic": "infer_instance"
+            },
+            {
+              "annotated_tactic": [
+                "\"refine ((<a>Adjunction.ofIsRightAdjoint<\\/a> (R \\u22d9 U)).<a>ofNatIsoRight<\\/a> ?_).<a>isRightAdjoint<\\/a>\"",
+                "[{\"full_name\":\"CategoryTheory.Adjunction.ofIsRightAdjoint\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Basic.lean\",\"def_pos\":[115,19],\"def_end_pos\":[115,46]},{\"full_name\":\"CategoryTheory.Adjunction.ofNatIsoRight\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Basic.lean\",\"def_pos\":[471,5],\"def_end_pos\":[471,18]},{\"full_name\":\"CategoryTheory.Adjunction.isRightAdjoint\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Basic.lean\",\"def_pos\":[135,7],\"def_end_pos\":[135,21]}]"
+              ],
+              "state_after": "A : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\nR' : A \u2964 (monadicAdjunction U).toMonad.Algebra := R \u22d9 Monad.comparison (monadicAdjunction U)\n\u22a2 R \u22d9 U \u2245 R' \u22d9 (monadicAdjunction U).toMonad.forget",
+              "state_before": "A : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\nR' : A \u2964 (monadicAdjunction U).toMonad.Algebra := R \u22d9 Monad.comparison (monadicAdjunction U)\n\u22a2 (R' \u22d9 (monadicAdjunction U).toMonad.forget).IsRightAdjoint",
+              "tactic": "refine ((Adjunction.ofIsRightAdjoint (R \u22d9 U)).ofNatIsoRight ?_).isRightAdjoint"
+            },
+            {
+              "annotated_tactic": [
+                "\"exact <a>isoWhiskerLeft<\\/a> R (<a>Monad.comparisonForget<\\/a> (<a>monadicAdjunction<\\/a> U)).<a>symm<\\/a>\"",
+                "[{\"full_name\":\"CategoryTheory.isoWhiskerLeft\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Whiskering.lean\",\"def_pos\":[172,5],\"def_end_pos\":[172,19]},{\"full_name\":\"CategoryTheory.Monad.comparisonForget\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Monad\\/Adjunction.lean\",\"def_pos\":[117,5],\"def_end_pos\":[117,27]},{\"full_name\":\"CategoryTheory.monadicAdjunction\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Monad\\/Adjunction.lean\",\"def_pos\":[206,5],\"def_end_pos\":[206,22]},{\"full_name\":\"CategoryTheory.Iso.symm\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Iso.lean\",\"def_pos\":[94,5],\"def_end_pos\":[94,9]}]"
+              ],
+              "state_after": "no goals",
+              "state_before": "A : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\nR' : A \u2964 (monadicAdjunction U).toMonad.Algebra := R \u22d9 Monad.comparison (monadicAdjunction U)\n\u22a2 R \u22d9 U \u2245 R' \u22d9 (monadicAdjunction U).toMonad.forget",
+              "tactic": "exact isoWhiskerLeft R (Monad.comparisonForget (monadicAdjunction U)).symm"
+            },
+            {
+              "annotated_tactic": [
+                "\"intro X\"",
+                "[]"
+              ],
+              "state_after": "A : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\nR' : A \u2964 (monadicAdjunction U).toMonad.Algebra := R \u22d9 Monad.comparison (monadicAdjunction U)\nthis : (R' \u22d9 (monadicAdjunction U).toMonad.forget).IsRightAdjoint :=\n  Adjunction.isRightAdjoint\n    ((Adjunction.ofIsRightAdjoint (R \u22d9 U)).ofNatIsoRight\n      (isoWhiskerLeft R (Monad.comparisonForget (monadicAdjunction U)).symm))\nX : (monadicAdjunction U).toMonad.Algebra\n\u22a2 RegularEpi ((monadicAdjunction U).toMonad.adj.counit.app X)",
+              "state_before": "A : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\nR' : A \u2964 (monadicAdjunction U).toMonad.Algebra := R \u22d9 Monad.comparison (monadicAdjunction U)\nthis : (R' \u22d9 (monadicAdjunction U).toMonad.forget).IsRightAdjoint :=\n  Adjunction.isRightAdjoint\n    ((Adjunction.ofIsRightAdjoint (R \u22d9 U)).ofNatIsoRight\n      (isoWhiskerLeft R (Monad.comparisonForget (monadicAdjunction U)).symm))\n\u22a2 (X : (monadicAdjunction U).toMonad.Algebra) \u2192 RegularEpi ((monadicAdjunction U).toMonad.adj.counit.app X)",
+              "tactic": "intro X"
+            },
+            {
+              "annotated_tactic": [
+                "\"simp only [<a>Monad.adj_counit<\\/a>]\"",
+                "[{\"full_name\":\"CategoryTheory.Monad.adj_counit\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Monad\\/Algebra.lean\",\"def_pos\":[178,15],\"def_end_pos\":[178,21]}]"
+              ],
+              "state_after": "A : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\nR' : A \u2964 (monadicAdjunction U).toMonad.Algebra := R \u22d9 Monad.comparison (monadicAdjunction U)\nthis : (R' \u22d9 (monadicAdjunction U).toMonad.forget).IsRightAdjoint :=\n  Adjunction.isRightAdjoint\n    ((Adjunction.ofIsRightAdjoint (R \u22d9 U)).ofNatIsoRight\n      (isoWhiskerLeft R (Monad.comparisonForget (monadicAdjunction U)).symm))\nX : (monadicAdjunction U).toMonad.Algebra\n\u22a2 RegularEpi { f := X.a, h := \u22ef }",
+              "state_before": "A : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\nR' : A \u2964 (monadicAdjunction U).toMonad.Algebra := R \u22d9 Monad.comparison (monadicAdjunction U)\nthis : (R' \u22d9 (monadicAdjunction U).toMonad.forget).IsRightAdjoint :=\n  Adjunction.isRightAdjoint\n    ((Adjunction.ofIsRightAdjoint (R \u22d9 U)).ofNatIsoRight\n      (isoWhiskerLeft R (Monad.comparisonForget (monadicAdjunction U)).symm))\nX : (monadicAdjunction U).toMonad.Algebra\n\u22a2 RegularEpi ((monadicAdjunction U).toMonad.adj.counit.app X)",
+              "tactic": "simp only [Monad.adj_counit]"
+            },
+            {
+              "annotated_tactic": [
+                "\"exact \\u27e8_, _, _, _, <a>Monad.beckAlgebraCoequalizer<\\/a> X\\u27e9\"",
+                "[{\"full_name\":\"CategoryTheory.Monad.beckAlgebraCoequalizer\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Monad\\/Coequalizer.lean\",\"def_pos\":[87,5],\"def_end_pos\":[87,27]}]"
+              ],
+              "state_after": "no goals",
+              "state_before": "A : Type u\u2081\nB : Type u\u2082\nC : Type u\u2083\ninst\u271d\u2075 : Category.{v\u2081, u\u2081} A\ninst\u271d\u2074 : Category.{v\u2082, u\u2082} B\ninst\u271d\u00b3 : Category.{v\u2083, u\u2083} C\nU : B \u2964 C\ninst\u271d\u00b2 : MonadicRightAdjoint U\nR : A \u2964 B\ninst\u271d\u00b9 : HasReflexiveCoequalizers A\ninst\u271d : (R \u22d9 U).IsRightAdjoint\nR' : A \u2964 (monadicAdjunction U).toMonad.Algebra := R \u22d9 Monad.comparison (monadicAdjunction U)\nthis : (R' \u22d9 (monadicAdjunction U).toMonad.forget).IsRightAdjoint :=\n  Adjunction.isRightAdjoint\n    ((Adjunction.ofIsRightAdjoint (R \u22d9 U)).ofNatIsoRight\n      (isoWhiskerLeft R (Monad.comparisonForget (monadicAdjunction U)).symm))\nX : (monadicAdjunction U).toMonad.Algebra\n\u22a2 RegularEpi { f := X.a, h := \u22ef }",
+              "tactic": "exact \u27e8_, _, _, _, Monad.beckAlgebraCoequalizer X\u27e9"
+            }
+          ],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/Lifting.lean"
+      }
+    ],
+    "input_proofs": 14,
+    "input_units": 2,
+    "proofs": 2,
+    "published_proofs": 0,
+    "published_transitions": 0,
+    "replay_failures": [],
+    "transitions": 12,
+    "validation_failures": [
+      {
+        "errors": [
+          "internal transition boundary mismatch",
+          "internal transition boundary mismatch"
+        ],
+        "file_path": "Mathlib/CategoryTheory/Adjunction/FullyFaithful.lean",
+        "proof_id": "mathlib:CategoryTheory.Adjunction.isIso_counit_app_iff_mem_essImage",
+        "provenance": {
+          "selection": {
+            "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+            "end": [
+              172,
+              19
+            ],
+            "file_path": "Mathlib/CategoryTheory/Adjunction/FullyFaithful.lean",
+            "full_name": "CategoryTheory.Adjunction.isIso_counit_app_iff_mem_essImage",
+            "start": [
+              165,
+              1
+            ],
+            "traced_tactics": [
+              {
+                "annotated_tactic": [
+                  "\"constructor\"",
+                  "[]"
+                ],
+                "state_after": "case mp\nC : Type u\u2081\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nL : C \u2964 D\nR : D \u2964 C\nh : L \u22a3 R\ninst\u271d\u00b9 : L.Faithful\ninst\u271d : L.Full\nX : D\n\u22a2 IsIso (h.counit.app X) \u2192 X \u2208 L.essImage\n\ncase mpr\nC : Type u\u2081\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nL : C \u2964 D\nR : D \u2964 C\nh : L \u22a3 R\ninst\u271d\u00b9 : L.Faithful\ninst\u271d : L.Full\nX : D\n\u22a2 X \u2208 L.essImage \u2192 IsIso (h.counit.app X)",
+                "state_before": "C : Type u\u2081\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nL : C \u2964 D\nR : D \u2964 C\nh : L \u22a3 R\ninst\u271d\u00b9 : L.Faithful\ninst\u271d : L.Full\nX : D\n\u22a2 IsIso (h.counit.app X) \u2194 X \u2208 L.essImage",
+                "tactic": "constructor"
+              },
+              {
+                "annotated_tactic": [
+                  "\"intro\"",
+                  "[]"
+                ],
+                "state_after": "case mp\nC : Type u\u2081\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nL : C \u2964 D\nR : D \u2964 C\nh : L \u22a3 R\ninst\u271d\u00b9 : L.Faithful\ninst\u271d : L.Full\nX : D\na\u271d : IsIso (h.counit.app X)\n\u22a2 X \u2208 L.essImage",
+                "state_before": "case mp\nC : Type u\u2081\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nL : C \u2964 D\nR : D \u2964 C\nh : L \u22a3 R\ninst\u271d\u00b9 : L.Faithful\ninst\u271d : L.Full\nX : D\n\u22a2 IsIso (h.counit.app X) \u2192 X \u2208 L.essImage",
+                "tactic": "intro"
+              },
+              {
+                "annotated_tactic": [
+                  "\"exact \\u27e8R.obj X, \\u27e8<a>asIso<\\/a> (h.counit.app X)\\u27e9\\u27e9\"",
+                  "[{\"full_name\":\"CategoryTheory.asIso\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Iso.lean\",\"def_pos\":[329,19],\"def_end_pos\":[329,24]}]"
+                ],
+                "state_after": "no goals",
+                "state_before": "case mp\nC : Type u\u2081\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nL : C \u2964 D\nR : D \u2964 C\nh : L \u22a3 R\ninst\u271d\u00b9 : L.Faithful\ninst\u271d : L.Full\nX : D\na\u271d : IsIso (h.counit.app X)\n\u22a2 X \u2208 L.essImage",
+                "tactic": "exact \u27e8R.obj X, \u27e8asIso (h.counit.app X)\u27e9\u27e9"
+              },
+              {
+                "annotated_tactic": [
+                  "\"rintro \\u27e8_, \\u27e8i\\u27e9\\u27e9\"",
+                  "[]"
+                ],
+                "state_after": "case mpr.intro.intro\nC : Type u\u2081\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nL : C \u2964 D\nR : D \u2964 C\nh : L \u22a3 R\ninst\u271d\u00b9 : L.Faithful\ninst\u271d : L.Full\nX : D\nw\u271d : C\ni : L.obj w\u271d \u2245 X\n\u22a2 IsIso (h.counit.app X)",
+                "state_before": "case mpr\nC : Type u\u2081\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nL : C \u2964 D\nR : D \u2964 C\nh : L \u22a3 R\ninst\u271d\u00b9 : L.Faithful\ninst\u271d : L.Full\nX : D\n\u22a2 X \u2208 L.essImage \u2192 IsIso (h.counit.app X)",
+                "tactic": "rintro \u27e8_, \u27e8i\u27e9\u27e9"
+              },
+              {
+                "annotated_tactic": [
+                  "\"rw [<a>NatTrans.isIso_app_iff_of_iso<\\/a> _ i.symm]\"",
+                  "[{\"full_name\":\"CategoryTheory.NatTrans.isIso_app_iff_of_iso\",\"def_path\":\"Mathlib\\/CategoryTheory\\/MorphismProperty\\/Basic.lean\",\"def_pos\":[393,7],\"def_end_pos\":[393,27]}]"
+                ],
+                "state_after": "case mpr.intro.intro\nC : Type u\u2081\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nL : C \u2964 D\nR : D \u2964 C\nh : L \u22a3 R\ninst\u271d\u00b9 : L.Faithful\ninst\u271d : L.Full\nX : D\nw\u271d : C\ni : L.obj w\u271d \u2245 X\n\u22a2 IsIso (h.counit.app (L.obj w\u271d))",
+                "state_before": "case mpr.intro.intro\nC : Type u\u2081\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nL : C \u2964 D\nR : D \u2964 C\nh : L \u22a3 R\ninst\u271d\u00b9 : L.Faithful\ninst\u271d : L.Full\nX : D\nw\u271d : C\ni : L.obj w\u271d \u2245 X\n\u22a2 IsIso (h.counit.app X)",
+                "tactic": "rw [NatTrans.isIso_app_iff_of_iso _ i.symm]"
+              },
+              {
+                "annotated_tactic": [
+                  "\"infer_instance\"",
+                  "[]"
+                ],
+                "state_after": "no goals",
+                "state_before": "case mpr.intro.intro\nC : Type u\u2081\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nL : C \u2964 D\nR : D \u2964 C\nh : L \u22a3 R\ninst\u271d\u00b9 : L.Faithful\ninst\u271d : L.Full\nX : D\nw\u271d : C\ni : L.obj w\u271d \u2245 X\n\u22a2 IsIso (h.counit.app (L.obj w\u271d))",
+                "tactic": "infer_instance"
+              }
+            ],
+            "url": "https://github.com/leanprover-community/mathlib4"
+          }
+        },
+        "theorem_name": "CategoryTheory.Adjunction.isIso_counit_app_iff_mem_essImage"
+      },
+      {
+        "errors": [
+          "internal transition boundary mismatch",
+          "internal transition boundary mismatch"
+        ],
+        "file_path": "Mathlib/CategoryTheory/Adjunction/FullyFaithful.lean",
+        "proof_id": "mathlib:CategoryTheory.Adjunction.isIso_unit_app_iff_mem_essImage",
+        "provenance": {
+          "selection": {
+            "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+            "end": [
+              195,
+              19
+            ],
+            "file_path": "Mathlib/CategoryTheory/Adjunction/FullyFaithful.lean",
+            "full_name": "CategoryTheory.Adjunction.isIso_unit_app_iff_mem_essImage",
+            "start": [
+              188,
+              1
+            ],
+            "traced_tactics": [
+              {
+                "annotated_tactic": [
+                  "\"constructor\"",
+                  "[]"
+                ],
+                "state_after": "case mp\nC : Type u\u2081\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nL : C \u2964 D\nR : D \u2964 C\nh : L \u22a3 R\ninst\u271d\u00b9 : R.Faithful\ninst\u271d : R.Full\nY : C\n\u22a2 IsIso (h.unit.app Y) \u2192 Y \u2208 R.essImage\n\ncase mpr\nC : Type u\u2081\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nL : C \u2964 D\nR : D \u2964 C\nh : L \u22a3 R\ninst\u271d\u00b9 : R.Faithful\ninst\u271d : R.Full\nY : C\n\u22a2 Y \u2208 R.essImage \u2192 IsIso (h.unit.app Y)",
+                "state_before": "C : Type u\u2081\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nL : C \u2964 D\nR : D \u2964 C\nh : L \u22a3 R\ninst\u271d\u00b9 : R.Faithful\ninst\u271d : R.Full\nY : C\n\u22a2 IsIso (h.unit.app Y) \u2194 Y \u2208 R.essImage",
+                "tactic": "constructor"
+              },
+              {
+                "annotated_tactic": [
+                  "\"intro\"",
+                  "[]"
+                ],
+                "state_after": "case mp\nC : Type u\u2081\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nL : C \u2964 D\nR : D \u2964 C\nh : L \u22a3 R\ninst\u271d\u00b9 : R.Faithful\ninst\u271d : R.Full\nY : C\na\u271d : IsIso (h.unit.app Y)\n\u22a2 Y \u2208 R.essImage",
+                "state_before": "case mp\nC : Type u\u2081\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nL : C \u2964 D\nR : D \u2964 C\nh : L \u22a3 R\ninst\u271d\u00b9 : R.Faithful\ninst\u271d : R.Full\nY : C\n\u22a2 IsIso (h.unit.app Y) \u2192 Y \u2208 R.essImage",
+                "tactic": "intro"
+              },
+              {
+                "annotated_tactic": [
+                  "\"exact \\u27e8L.obj Y, \\u27e8(<a>asIso<\\/a> (h.unit.app Y)).<a>symm<\\/a>\\u27e9\\u27e9\"",
+                  "[{\"full_name\":\"CategoryTheory.asIso\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Iso.lean\",\"def_pos\":[329,19],\"def_end_pos\":[329,24]},{\"full_name\":\"CategoryTheory.Iso.symm\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Iso.lean\",\"def_pos\":[94,5],\"def_end_pos\":[94,9]}]"
+                ],
+                "state_after": "no goals",
+                "state_before": "case mp\nC : Type u\u2081\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nL : C \u2964 D\nR : D \u2964 C\nh : L \u22a3 R\ninst\u271d\u00b9 : R.Faithful\ninst\u271d : R.Full\nY : C\na\u271d : IsIso (h.unit.app Y)\n\u22a2 Y \u2208 R.essImage",
+                "tactic": "exact \u27e8L.obj Y, \u27e8(asIso (h.unit.app Y)).symm\u27e9\u27e9"
+              },
+              {
+                "annotated_tactic": [
+                  "\"rintro \\u27e8_, \\u27e8i\\u27e9\\u27e9\"",
+                  "[]"
+                ],
+                "state_after": "case mpr.intro.intro\nC : Type u\u2081\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nL : C \u2964 D\nR : D \u2964 C\nh : L \u22a3 R\ninst\u271d\u00b9 : R.Faithful\ninst\u271d : R.Full\nY : C\nw\u271d : D\ni : R.obj w\u271d \u2245 Y\n\u22a2 IsIso (h.unit.app Y)",
+                "state_before": "case mpr\nC : Type u\u2081\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nL : C \u2964 D\nR : D \u2964 C\nh : L \u22a3 R\ninst\u271d\u00b9 : R.Faithful\ninst\u271d : R.Full\nY : C\n\u22a2 Y \u2208 R.essImage \u2192 IsIso (h.unit.app Y)",
+                "tactic": "rintro \u27e8_, \u27e8i\u27e9\u27e9"
+              },
+              {
+                "annotated_tactic": [
+                  "\"rw [<a>NatTrans.isIso_app_iff_of_iso<\\/a> _ i.symm]\"",
+                  "[{\"full_name\":\"CategoryTheory.NatTrans.isIso_app_iff_of_iso\",\"def_path\":\"Mathlib\\/CategoryTheory\\/MorphismProperty\\/Basic.lean\",\"def_pos\":[393,7],\"def_end_pos\":[393,27]}]"
+                ],
+                "state_after": "case mpr.intro.intro\nC : Type u\u2081\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nL : C \u2964 D\nR : D \u2964 C\nh : L \u22a3 R\ninst\u271d\u00b9 : R.Faithful\ninst\u271d : R.Full\nY : C\nw\u271d : D\ni : R.obj w\u271d \u2245 Y\n\u22a2 IsIso (h.unit.app (R.obj w\u271d))",
+                "state_before": "case mpr.intro.intro\nC : Type u\u2081\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nL : C \u2964 D\nR : D \u2964 C\nh : L \u22a3 R\ninst\u271d\u00b9 : R.Faithful\ninst\u271d : R.Full\nY : C\nw\u271d : D\ni : R.obj w\u271d \u2245 Y\n\u22a2 IsIso (h.unit.app Y)",
+                "tactic": "rw [NatTrans.isIso_app_iff_of_iso _ i.symm]"
+              },
+              {
+                "annotated_tactic": [
+                  "\"infer_instance\"",
+                  "[]"
+                ],
+                "state_after": "no goals",
+                "state_before": "case mpr.intro.intro\nC : Type u\u2081\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nL : C \u2964 D\nR : D \u2964 C\nh : L \u22a3 R\ninst\u271d\u00b9 : R.Faithful\ninst\u271d : R.Full\nY : C\nw\u271d : D\ni : R.obj w\u271d \u2245 Y\n\u22a2 IsIso (h.unit.app (R.obj w\u271d))",
+                "tactic": "infer_instance"
+              }
+            ],
+            "url": "https://github.com/leanprover-community/mathlib4"
+          }
+        },
+        "theorem_name": "CategoryTheory.Adjunction.isIso_unit_app_iff_mem_essImage"
+      }
+    ],
+    "validation_rejected_proofs": 2,
+    "zero_transition_proofs": 0
+  },
+  "shards": [],
+  "proof_ids": [],
+  "proof_keys": []
+}

manifests/batches/mathlib/000605.json

@@ -0,0 +1,349 @@
+{
+  "format": "leangpt-parquet-v2",
+  "batch": "mathlib/000605",
+  "batch_fingerprint": "52271aab40ae4fa6da65a9c9b9f84e9ddfeb03a3695d0af36b0b03ac2875e217",
+  "evidence": {
+    "batch_fingerprint": "52271aab40ae4fa6da65a9c9b9f84e9ddfeb03a3695d0af36b0b03ac2875e217",
+    "contamination_matches": [],
+    "failures": [
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Adjunction.hasColimit_of_comp_equivalence",
+        "id": "CategoryTheory.Adjunction.hasColimit_of_comp_equivalence",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            145,
+            79
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/Limits.lean",
+          "full_name": "CategoryTheory.Adjunction.hasColimit_of_comp_equivalence",
+          "start": [
+            141,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/Limits.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Adjunction.hasColimitsOfShape_of_equivalence",
+        "id": "CategoryTheory.Adjunction.hasColimitsOfShape_of_equivalence",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            151,
+            48
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/Limits.lean",
+          "full_name": "CategoryTheory.Adjunction.hasColimitsOfShape_of_equivalence",
+          "start": [
+            149,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/Limits.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Adjunction.hasLimit_comp_equivalence",
+        "id": "CategoryTheory.Adjunction.hasLimit_comp_equivalence",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            252,
+            62
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/Limits.lean",
+          "full_name": "CategoryTheory.Adjunction.hasLimit_comp_equivalence",
+          "start": [
+            249,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/Limits.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Adjunction.hasLimit_of_comp_equivalence",
+        "id": "CategoryTheory.Adjunction.hasLimit_of_comp_equivalence",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            259,
+            77
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/Limits.lean",
+          "full_name": "CategoryTheory.Adjunction.hasLimit_of_comp_equivalence",
+          "start": [
+            255,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/Limits.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Adjunction.hasLimitsOfShape_of_equivalence",
+        "id": "CategoryTheory.Adjunction.hasLimitsOfShape_of_equivalence",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            265,
+            46
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/Limits.lean",
+          "full_name": "CategoryTheory.Adjunction.hasLimitsOfShape_of_equivalence",
+          "start": [
+            263,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/Limits.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Adjunction.has_colimits_of_equivalence",
+        "id": "CategoryTheory.Adjunction.has_colimits_of_equivalence",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            157,
+            51
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/Limits.lean",
+          "full_name": "CategoryTheory.Adjunction.has_colimits_of_equivalence",
+          "start": [
+            155,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/Limits.lean"
+      },
+      {
+        "error": "no internal trace for tactic 'simpa using this'",
+        "full_name": "CategoryTheory.transferNatTransSelf_of_iso",
+        "id": "CategoryTheory.transferNatTransSelf_of_iso",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            254,
+            17
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/Mates.lean",
+          "full_name": "CategoryTheory.transferNatTransSelf_of_iso",
+          "start": [
+            250,
+            1
+          ],
+          "traced_tactics": [
+            {
+              "annotated_tactic": [
+                "\"suffices <a>IsIso<\\/a> ((<a>transferNatTransSelf<\\/a> adj\\u2081 adj\\u2082).<a>symm<\\/a> (<a>transferNatTransSelf<\\/a> adj\\u2081 adj\\u2082 f))\\n    by simpa using this\"",
+                "[{\"full_name\":\"CategoryTheory.IsIso\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Iso.lean\",\"def_pos\":[272,7],\"def_end_pos\":[272,12]},{\"full_name\":\"CategoryTheory.transferNatTransSelf\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Mates.lean\",\"def_pos\":[146,5],\"def_end_pos\":[146,25]},{\"full_name\":\"Equiv.symm\",\"def_path\":\"Mathlib\\/Logic\\/Equiv\\/Defs.lean\",\"def_pos\":[162,15],\"def_end_pos\":[162,19]},{\"full_name\":\"CategoryTheory.transferNatTransSelf\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Mates.lean\",\"def_pos\":[146,5],\"def_end_pos\":[146,25]}]"
+              ],
+              "state_after": "C : Type u\u2081\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\nL\u2081 L\u2082 L\u2083 : C \u2964 D\nR\u2081 R\u2082 R\u2083 : D \u2964 C\nadj\u2081 : L\u2081 \u22a3 R\u2081\nadj\u2082 : L\u2082 \u22a3 R\u2082\nadj\u2083 : L\u2083 \u22a3 R\u2083\nf : L\u2082 \u27f6 L\u2081\ninst\u271d : IsIso ((transferNatTransSelf adj\u2081 adj\u2082) f)\n\u22a2 IsIso ((transferNatTransSelf adj\u2081 adj\u2082).symm ((transferNatTransSelf adj\u2081 adj\u2082) f))",
+              "state_before": "C : Type u\u2081\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\nL\u2081 L\u2082 L\u2083 : C \u2964 D\nR\u2081 R\u2082 R\u2083 : D \u2964 C\nadj\u2081 : L\u2081 \u22a3 R\u2081\nadj\u2082 : L\u2082 \u22a3 R\u2082\nadj\u2083 : L\u2083 \u22a3 R\u2083\nf : L\u2082 \u27f6 L\u2081\ninst\u271d : IsIso ((transferNatTransSelf adj\u2081 adj\u2082) f)\n\u22a2 IsIso f",
+              "tactic": "suffices IsIso ((transferNatTransSelf adj\u2081 adj\u2082).symm (transferNatTransSelf adj\u2081 adj\u2082 f))\n  by simpa using this"
+            },
+            {
+              "annotated_tactic": [
+                "\"infer_instance\"",
+                "[]"
+              ],
+              "state_after": "no goals",
+              "state_before": "C : Type u\u2081\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\nL\u2081 L\u2082 L\u2083 : C \u2964 D\nR\u2081 R\u2082 R\u2083 : D \u2964 C\nadj\u2081 : L\u2081 \u22a3 R\u2081\nadj\u2082 : L\u2082 \u22a3 R\u2082\nadj\u2083 : L\u2083 \u22a3 R\u2083\nf : L\u2082 \u27f6 L\u2081\ninst\u271d : IsIso ((transferNatTransSelf adj\u2081 adj\u2082) f)\n\u22a2 IsIso ((transferNatTransSelf adj\u2081 adj\u2082).symm ((transferNatTransSelf adj\u2081 adj\u2082) f))",
+              "tactic": "infer_instance"
+            },
+            {
+              "annotated_tactic": [
+                "\"simpa using this\"",
+                "[]"
+              ],
+              "state_after": "no goals",
+              "state_before": "C : Type u\u2081\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\nL\u2081 L\u2082 L\u2083 : C \u2964 D\nR\u2081 R\u2082 R\u2083 : D \u2964 C\nadj\u2081 : L\u2081 \u22a3 R\u2081\nadj\u2082 : L\u2082 \u22a3 R\u2082\nadj\u2083 : L\u2083 \u22a3 R\u2083\nf : L\u2082 \u27f6 L\u2081\ninst\u271d : IsIso ((transferNatTransSelf adj\u2081 adj\u2082) f)\nthis : IsIso ((transferNatTransSelf adj\u2081 adj\u2082).symm ((transferNatTransSelf adj\u2081 adj\u2082) f))\n\u22a2 IsIso f",
+              "tactic": "simpa using this"
+            }
+          ],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/Mates.lean"
+      },
+      {
+        "error": "no internal trace for tactic 'simpa using this'",
+        "full_name": "CategoryTheory.transferNatTransSelf_symm_of_iso",
+        "id": "CategoryTheory.transferNatTransSelf_symm_of_iso",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            266,
+            17
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/Mates.lean",
+          "full_name": "CategoryTheory.transferNatTransSelf_symm_of_iso",
+          "start": [
+            262,
+            1
+          ],
+          "traced_tactics": [
+            {
+              "annotated_tactic": [
+                "\"suffices <a>IsIso<\\/a> ((<a>transferNatTransSelf<\\/a> adj\\u2081 adj\\u2082) ((<a>transferNatTransSelf<\\/a> adj\\u2081 adj\\u2082).<a>symm<\\/a> f))\\n    by simpa using this\"",
+                "[{\"full_name\":\"CategoryTheory.IsIso\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Iso.lean\",\"def_pos\":[272,7],\"def_end_pos\":[272,12]},{\"full_name\":\"CategoryTheory.transferNatTransSelf\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Mates.lean\",\"def_pos\":[146,5],\"def_end_pos\":[146,25]},{\"full_name\":\"CategoryTheory.transferNatTransSelf\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Mates.lean\",\"def_pos\":[146,5],\"def_end_pos\":[146,25]},{\"full_name\":\"Equiv.symm\",\"def_path\":\"Mathlib\\/Logic\\/Equiv\\/Defs.lean\",\"def_pos\":[162,15],\"def_end_pos\":[162,19]}]"
+              ],
+              "state_after": "C : Type u\u2081\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\nL\u2081 L\u2082 L\u2083 : C \u2964 D\nR\u2081 R\u2082 R\u2083 : D \u2964 C\nadj\u2081 : L\u2081 \u22a3 R\u2081\nadj\u2082 : L\u2082 \u22a3 R\u2082\nadj\u2083 : L\u2083 \u22a3 R\u2083\nf : R\u2081 \u27f6 R\u2082\ninst\u271d : IsIso ((transferNatTransSelf adj\u2081 adj\u2082).symm f)\n\u22a2 IsIso ((transferNatTransSelf adj\u2081 adj\u2082) ((transferNatTransSelf adj\u2081 adj\u2082).symm f))",
+              "state_before": "C : Type u\u2081\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\nL\u2081 L\u2082 L\u2083 : C \u2964 D\nR\u2081 R\u2082 R\u2083 : D \u2964 C\nadj\u2081 : L\u2081 \u22a3 R\u2081\nadj\u2082 : L\u2082 \u22a3 R\u2082\nadj\u2083 : L\u2083 \u22a3 R\u2083\nf : R\u2081 \u27f6 R\u2082\ninst\u271d : IsIso ((transferNatTransSelf adj\u2081 adj\u2082).symm f)\n\u22a2 IsIso f",
+              "tactic": "suffices IsIso ((transferNatTransSelf adj\u2081 adj\u2082) ((transferNatTransSelf adj\u2081 adj\u2082).symm f))\n  by simpa using this"
+            },
+            {
+              "annotated_tactic": [
+                "\"infer_instance\"",
+                "[]"
+              ],
+              "state_after": "no goals",
+              "state_before": "C : Type u\u2081\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\nL\u2081 L\u2082 L\u2083 : C \u2964 D\nR\u2081 R\u2082 R\u2083 : D \u2964 C\nadj\u2081 : L\u2081 \u22a3 R\u2081\nadj\u2082 : L\u2082 \u22a3 R\u2082\nadj\u2083 : L\u2083 \u22a3 R\u2083\nf : R\u2081 \u27f6 R\u2082\ninst\u271d : IsIso ((transferNatTransSelf adj\u2081 adj\u2082).symm f)\n\u22a2 IsIso ((transferNatTransSelf adj\u2081 adj\u2082) ((transferNatTransSelf adj\u2081 adj\u2082).symm f))",
+              "tactic": "infer_instance"
+            },
+            {
+              "annotated_tactic": [
+                "\"simpa using this\"",
+                "[]"
+              ],
+              "state_after": "no goals",
+              "state_before": "C : Type u\u2081\nD : Type u\u2082\ninst\u271d\u00b2 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b9 : Category.{v\u2082, u\u2082} D\nL\u2081 L\u2082 L\u2083 : C \u2964 D\nR\u2081 R\u2082 R\u2083 : D \u2964 C\nadj\u2081 : L\u2081 \u22a3 R\u2081\nadj\u2082 : L\u2082 \u22a3 R\u2082\nadj\u2083 : L\u2083 \u22a3 R\u2083\nf : R\u2081 \u27f6 R\u2082\ninst\u271d : IsIso ((transferNatTransSelf adj\u2081 adj\u2082).symm f)\nthis : IsIso ((transferNatTransSelf adj\u2081 adj\u2082) ((transferNatTransSelf adj\u2081 adj\u2082).symm f))\n\u22a2 IsIso f",
+              "tactic": "simpa using this"
+            }
+          ],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/Mates.lean"
+      }
+    ],
+    "input_proofs": 20,
+    "input_units": 2,
+    "proofs": 12,
+    "published_proofs": 11,
+    "published_transitions": 31,
+    "replay_failures": [],
+    "transitions": 34,
+    "validation_failures": [
+      {
+        "errors": [
+          "internal transition boundary mismatch"
+        ],
+        "file_path": "Mathlib/CategoryTheory/Adjunction/Mates.lean",
+        "proof_id": "mathlib:CategoryTheory.unit_transferNatTrans",
+        "provenance": {
+          "selection": {
+            "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+            "end": [
+              124,
+              14
+            ],
+            "file_path": "Mathlib/CategoryTheory/Adjunction/Mates.lean",
+            "full_name": "CategoryTheory.unit_transferNatTrans",
+            "start": [
+              118,
+              1
+            ],
+            "traced_tactics": [
+              {
+                "annotated_tactic": [
+                  "\"dsimp [<a>transferNatTrans<\\/a>]\"",
+                  "[{\"full_name\":\"CategoryTheory.transferNatTrans\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Mates.lean\",\"def_pos\":[76,5],\"def_end_pos\":[76,21]}]"
+                ],
+                "state_after": "C : Type u\u2081\nD : Type u\u2082\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nE : Type u\u2083\nF : Type u\u2084\ninst\u271d\u00b9 : Category.{v\u2083, u\u2083} E\ninst\u271d : Category.{v\u2084, u\u2084} F\nG : C \u2964 E\nH : D \u2964 F\nL\u2081 : C \u2964 D\nR\u2081 : D \u2964 C\nL\u2082 : E \u2964 F\nR\u2082 : F \u2964 E\nadj\u2081 : L\u2081 \u22a3 R\u2081\nadj\u2082 : L\u2082 \u22a3 R\u2082\nf : G \u22d9 L\u2082 \u27f6 L\u2081 \u22d9 H\nX : C\n\u22a2 G.map (adj\u2081.unit.app X) \u226b\n      adj\u2082.unit.app (G.obj (R\u2081.obj (L\u2081.obj X))) \u226b\n        R\u2082.map (f.app (R\u2081.obj (L\u2081.obj X)) \u226b H.map (adj\u2081.counit.app (L\u2081.obj X))) =\n    adj\u2082.unit.app (G.obj X) \u226b R\u2082.map (f.app X)",
+                "state_before": "C : Type u\u2081\nD : Type u\u2082\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nE : Type u\u2083\nF : Type u\u2084\ninst\u271d\u00b9 : Category.{v\u2083, u\u2083} E\ninst\u271d : Category.{v\u2084, u\u2084} F\nG : C \u2964 E\nH : D \u2964 F\nL\u2081 : C \u2964 D\nR\u2081 : D \u2964 C\nL\u2082 : E \u2964 F\nR\u2082 : F \u2964 E\nadj\u2081 : L\u2081 \u22a3 R\u2081\nadj\u2082 : L\u2082 \u22a3 R\u2082\nf : G \u22d9 L\u2082 \u27f6 L\u2081 \u22d9 H\nX : C\n\u22a2 G.map (adj\u2081.unit.app X) \u226b ((transferNatTrans adj\u2081 adj\u2082) f).app (L\u2081.obj X) =\n    adj\u2082.unit.app (G.obj ((\ud835\udfed C).obj X)) \u226b R\u2082.map (f.app ((\ud835\udfed C).obj X))",
+                "tactic": "dsimp [transferNatTrans]"
+              },
+              {
+                "annotated_tactic": [
+                  "\"rw [\\u2190 adj\\u2082.unit_naturality_assoc, \\u2190 R\\u2082.map_comp, \\u2190 <a>Functor.comp_map<\\/a> G L\\u2082, f.naturality_assoc,\\n    <a>Functor.comp_map<\\/a>, \\u2190 H.map_comp]\"",
+                  "[{\"full_name\":\"CategoryTheory.Functor.comp_map\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Functor\\/Basic.lean\",\"def_pos\":[122,9],\"def_end_pos\":[122,17]},{\"full_name\":\"CategoryTheory.Functor.comp_map\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Functor\\/Basic.lean\",\"def_pos\":[122,9],\"def_end_pos\":[122,17]}]"
+                ],
+                "state_after": "C : Type u\u2081\nD : Type u\u2082\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nE : Type u\u2083\nF : Type u\u2084\ninst\u271d\u00b9 : Category.{v\u2083, u\u2083} E\ninst\u271d : Category.{v\u2084, u\u2084} F\nG : C \u2964 E\nH : D \u2964 F\nL\u2081 : C \u2964 D\nR\u2081 : D \u2964 C\nL\u2082 : E \u2964 F\nR\u2082 : F \u2964 E\nadj\u2081 : L\u2081 \u22a3 R\u2081\nadj\u2082 : L\u2082 \u22a3 R\u2082\nf : G \u22d9 L\u2082 \u27f6 L\u2081 \u22d9 H\nX : C\n\u22a2 adj\u2082.unit.app (G.obj X) \u226b R\u2082.map (f.app X \u226b H.map (L\u2081.map (adj\u2081.unit.app X) \u226b adj\u2081.counit.app (L\u2081.obj X))) =\n    adj\u2082.unit.app (G.obj X) \u226b R\u2082.map (f.app X)",
+                "state_before": "C : Type u\u2081\nD : Type u\u2082\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nE : Type u\u2083\nF : Type u\u2084\ninst\u271d\u00b9 : Category.{v\u2083, u\u2083} E\ninst\u271d : Category.{v\u2084, u\u2084} F\nG : C \u2964 E\nH : D \u2964 F\nL\u2081 : C \u2964 D\nR\u2081 : D \u2964 C\nL\u2082 : E \u2964 F\nR\u2082 : F \u2964 E\nadj\u2081 : L\u2081 \u22a3 R\u2081\nadj\u2082 : L\u2082 \u22a3 R\u2082\nf : G \u22d9 L\u2082 \u27f6 L\u2081 \u22d9 H\nX : C\n\u22a2 G.map (adj\u2081.unit.app X) \u226b\n      adj\u2082.unit.app (G.obj (R\u2081.obj (L\u2081.obj X))) \u226b\n        R\u2082.map (f.app (R\u2081.obj (L\u2081.obj X)) \u226b H.map (adj\u2081.counit.app (L\u2081.obj X))) =\n    adj\u2082.unit.app (G.obj X) \u226b R\u2082.map (f.app X)",
+                "tactic": "rw [\u2190 adj\u2082.unit_naturality_assoc, \u2190 R\u2082.map_comp, \u2190 Functor.comp_map G L\u2082, f.naturality_assoc,\n  Functor.comp_map, \u2190 H.map_comp]"
+              },
+              {
+                "annotated_tactic": [
+                  "\"simp\"",
+                  "[]"
+                ],
+                "state_after": "no goals",
+                "state_before": "C : Type u\u2081\nD : Type u\u2082\ninst\u271d\u00b3 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b2 : Category.{v\u2082, u\u2082} D\nE : Type u\u2083\nF : Type u\u2084\ninst\u271d\u00b9 : Category.{v\u2083, u\u2083} E\ninst\u271d : Category.{v\u2084, u\u2084} F\nG : C \u2964 E\nH : D \u2964 F\nL\u2081 : C \u2964 D\nR\u2081 : D \u2964 C\nL\u2082 : E \u2964 F\nR\u2082 : F \u2964 E\nadj\u2081 : L\u2081 \u22a3 R\u2081\nadj\u2082 : L\u2082 \u22a3 R\u2082\nf : G \u22d9 L\u2082 \u27f6 L\u2081 \u22d9 H\nX : C\n\u22a2 adj\u2082.unit.app (G.obj X) \u226b R\u2082.map (f.app X \u226b H.map (L\u2081.map (adj\u2081.unit.app X) \u226b adj\u2081.counit.app (L\u2081.obj X))) =\n    adj\u2082.unit.app (G.obj X) \u226b R\u2082.map (f.app X)",
+                "tactic": "simp"
+              }
+            ],
+            "url": "https://github.com/leanprover-community/mathlib4"
+          }
+        },
+        "theorem_name": "CategoryTheory.unit_transferNatTrans"
+      }
+    ],
+    "validation_rejected_proofs": 1,
+    "zero_transition_proofs": 0
+  },
+  "shards": [
+    {
+      "path": "data/train/mathlib-000605-0000-769537ee44048135.parquet",
+      "sha256": "769537ee440481356692cc8346ce5d935343bebcb498cf088bcfa63650f58393",
+      "bytes": 184963,
+      "rows": 30,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    },
+    {
+      "path": "data/internal_test/mathlib-000605-0000-92c6e71c1aa1a9e8.parquet",
+      "sha256": "92c6e71c1aa1a9e81f6a46baba4772e3244b88c74f394e1baa6d81cd1ae55509",
+      "bytes": 49235,
+      "rows": 1,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    }
+  ],
+  "proof_ids": [
+    "mathlib:CategoryTheory.transferNatTransSelf_adjunction_id",
+    "mathlib:CategoryTheory.transferNatTransSelf_adjunction_id_symm",
+    "mathlib:CategoryTheory.transferNatTransSelf_comm",
+    "mathlib:CategoryTheory.transferNatTransSelf_comp",
+    "mathlib:CategoryTheory.transferNatTransSelf_counit",
+    "mathlib:CategoryTheory.transferNatTransSelf_id",
+    "mathlib:CategoryTheory.transferNatTransSelf_symm_comm",
+    "mathlib:CategoryTheory.transferNatTransSelf_symm_comp",
+    "mathlib:CategoryTheory.transferNatTransSelf_symm_id",
+    "mathlib:CategoryTheory.transferNatTrans_counit",
+    "mathlib:CategoryTheory.unit_transferNatTransSelf"
+  ],
+  "proof_keys": [
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Mates.lean\",null,null,\"CategoryTheory.transferNatTransSelf_adjunction_id\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Mates.lean\",null,null,\"CategoryTheory.transferNatTransSelf_adjunction_id_symm\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Mates.lean\",null,null,\"CategoryTheory.transferNatTransSelf_comm\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Mates.lean\",null,null,\"CategoryTheory.transferNatTransSelf_comp\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Mates.lean\",null,null,\"CategoryTheory.transferNatTransSelf_counit\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Mates.lean\",null,null,\"CategoryTheory.transferNatTransSelf_id\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Mates.lean\",null,null,\"CategoryTheory.transferNatTransSelf_symm_comm\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Mates.lean\",null,null,\"CategoryTheory.transferNatTransSelf_symm_comp\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Mates.lean\",null,null,\"CategoryTheory.transferNatTransSelf_symm_id\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Mates.lean\",null,null,\"CategoryTheory.transferNatTrans_counit\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Mates.lean\",null,null,\"CategoryTheory.unit_transferNatTransSelf\"]"
+  ]
+}

manifests/batches/mathlib/000606.json

@@ -0,0 +1,284 @@
+{
+  "format": "leangpt-parquet-v2",
+  "batch": "mathlib/000606",
+  "batch_fingerprint": "fc23376b3b58e044edf91c3e4bd0dd07463faa94507d140696b51500a2fa2160",
+  "evidence": {
+    "batch_fingerprint": "fc23376b3b58e044edf91c3e4bd0dd07463faa94507d140696b51500a2fa2160",
+    "contamination_matches": [],
+    "failures": [
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.equivEssImageOfReflective_map_counitIso_app_inv",
+        "id": "CategoryTheory.equivEssImageOfReflective_map_counitIso_app_inv",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            192,
+            61
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/Reflective.lean",
+          "full_name": "CategoryTheory.equivEssImageOfReflective_map_counitIso_app_inv",
+          "start": [
+            189,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/Reflective.lean"
+      },
+      {
+        "error": "no internal trace for tactic 'refine @mono_of_mono _ _ _ _ _ (\u03b5.app A) (section_ (\u03b5.app A)) ?_'",
+        "full_name": "CategoryTheory.mem_essImage_of_counit_isSplitEpi",
+        "id": "CategoryTheory.mem_essImage_of_counit_isSplitEpi",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            277,
+            65
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/Reflective.lean",
+          "full_name": "CategoryTheory.mem_essImage_of_counit_isSplitEpi",
+          "start": [
+            267,
+            1
+          ],
+          "traced_tactics": [
+            {
+              "annotated_tactic": [
+                "\"let \\u03b5 : <a>coreflector<\\/a> j \\u22d9 j \\u27f6 \\ud835\\udfed D  := (<a>coreflectorAdjunction<\\/a> j).<a>counit<\\/a>\"",
+                "[{\"full_name\":\"CategoryTheory.coreflector\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Reflective.lean\",\"def_pos\":[238,5],\"def_end_pos\":[238,16]},{\"full_name\":\"CategoryTheory.coreflectorAdjunction\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Reflective.lean\",\"def_pos\":[241,5],\"def_end_pos\":[241,26]},{\"full_name\":\"CategoryTheory.Adjunction.counit\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Basic.lean\",\"def_pos\":[67,3],\"def_end_pos\":[67,9]}]"
+              ],
+              "state_after": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\nj : C \u2964 D\ninst\u271d\u00b9 : Coreflective j\nA : D\ninst\u271d : IsSplitEpi ((coreflectorAdjunction j).counit.app A)\n\u03b5 : coreflector j \u22d9 j \u27f6 \ud835\udfed D := (coreflectorAdjunction j).counit\n\u22a2 A \u2208 j.essImage",
+              "state_before": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\nj : C \u2964 D\ninst\u271d\u00b9 : Coreflective j\nA : D\ninst\u271d : IsSplitEpi ((coreflectorAdjunction j).counit.app A)\n\u22a2 A \u2208 j.essImage",
+              "tactic": "let \u03b5 : coreflector j \u22d9 j \u27f6 \ud835\udfed D  := (coreflectorAdjunction j).counit"
+            },
+            {
+              "annotated_tactic": [
+                "\"haveI : <a>IsIso<\\/a> (\\u03b5.app (j.obj ((<a>coreflector<\\/a> j).<a>obj<\\/a> A))) :=\\n    <a>Functor.essImage.counit_isIso<\\/a> ((j.obj_mem_essImage _))\"",
+                "[{\"full_name\":\"CategoryTheory.IsIso\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Iso.lean\",\"def_pos\":[272,7],\"def_end_pos\":[272,12]},{\"full_name\":\"CategoryTheory.coreflector\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Reflective.lean\",\"def_pos\":[238,5],\"def_end_pos\":[238,16]},{\"full_name\":\"Prefunctor.obj\",\"def_path\":\"Mathlib\\/Combinatorics\\/Quiver\\/Basic.lean\",\"def_pos\":[59,3],\"def_end_pos\":[59,6]},{\"full_name\":\"CategoryTheory.Functor.essImage.counit_isIso\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Reflective.lean\",\"def_pos\":[263,7],\"def_end_pos\":[263,36]}]"
+              ],
+              "state_after": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\nj : C \u2964 D\ninst\u271d\u00b9 : Coreflective j\nA : D\ninst\u271d : IsSplitEpi ((coreflectorAdjunction j).counit.app A)\n\u03b5 : coreflector j \u22d9 j \u27f6 \ud835\udfed D := (coreflectorAdjunction j).counit\nthis : IsIso (\u03b5.app (j.obj ((coreflector j).obj A)))\n\u22a2 A \u2208 j.essImage",
+              "state_before": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\nj : C \u2964 D\ninst\u271d\u00b9 : Coreflective j\nA : D\ninst\u271d : IsSplitEpi ((coreflectorAdjunction j).counit.app A)\n\u03b5 : coreflector j \u22d9 j \u27f6 \ud835\udfed D := (coreflectorAdjunction j).counit\n\u22a2 A \u2208 j.essImage",
+              "tactic": "haveI : IsIso (\u03b5.app (j.obj ((coreflector j).obj A))) :=\n  Functor.essImage.counit_isIso ((j.obj_mem_essImage _))"
+            },
+            {
+              "annotated_tactic": [
+                "\"have : <a>Mono<\\/a> (\\u03b5.app A) := by\\n    refine @<a>mono_of_mono<\\/a> _ _ _ _ _ (\\u03b5.app A) (<a>section_<\\/a> (\\u03b5.app A)) ?_\\n    rw [show \\u03b5.app A \\u226b <a>section_<\\/a> _ = _ from (\\u03b5.naturality (<a>section_<\\/a> (\\u03b5.app A))).<a>symm<\\/a>]\\n    apply <a>mono_comp<\\/a> _ (\\u03b5.app (j.obj ((<a>coreflector<\\/a> j).<a>obj<\\/a> A)))\"",
+                "[{\"full_name\":\"CategoryTheory.Mono\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Category\\/Basic.lean\",\"def_pos\":[295,7],\"def_end_pos\":[295,11]},{\"full_name\":\"CategoryTheory.mono_of_mono\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Category\\/Basic.lean\",\"def_pos\":[341,9],\"def_end_pos\":[341,21]},{\"full_name\":\"CategoryTheory.section_\",\"def_path\":\"Mathlib\\/CategoryTheory\\/EpiMono.lean\",\"def_pos\":[129,19],\"def_end_pos\":[129,27]},{\"full_name\":\"CategoryTheory.section_\",\"def_path\":\"Mathlib\\/CategoryTheory\\/EpiMono.lean\",\"def_pos\":[129,19],\"def_end_pos\":[129,27]},{\"full_name\":\"CategoryTheory.section_\",\"def_path\":\"Mathlib\\/CategoryTheory\\/EpiMono.lean\",\"def_pos\":[129,19],\"def_end_pos\":[129,27]},{\"full_name\":\"Eq.symm\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Prelude.lean\",\"def_pos\":[323,9],\"def_end_pos\":[323,16]},{\"full_name\":\"CategoryTheory.mono_comp\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Category\\/Basic.lean\",\"def_pos\":[333,9],\"def_end_pos\":[333,18]},{\"full_name\":\"CategoryTheory.coreflector\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Reflective.lean\",\"def_pos\":[238,5],\"def_end_pos\":[238,16]},{\"full_name\":\"Prefunctor.obj\",\"def_path\":\"Mathlib\\/Combinatorics\\/Quiver\\/Basic.lean\",\"def_pos\":[59,3],\"def_end_pos\":[59,6]}]"
+              ],
+              "state_after": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\nj : C \u2964 D\ninst\u271d\u00b9 : Coreflective j\nA : D\ninst\u271d : IsSplitEpi ((coreflectorAdjunction j).counit.app A)\n\u03b5 : coreflector j \u22d9 j \u27f6 \ud835\udfed D := (coreflectorAdjunction j).counit\nthis\u271d : IsIso (\u03b5.app (j.obj ((coreflector j).obj A)))\nthis : Mono (\u03b5.app A)\n\u22a2 A \u2208 j.essImage",
+              "state_before": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\nj : C \u2964 D\ninst\u271d\u00b9 : Coreflective j\nA : D\ninst\u271d : IsSplitEpi ((coreflectorAdjunction j).counit.app A)\n\u03b5 : coreflector j \u22d9 j \u27f6 \ud835\udfed D := (coreflectorAdjunction j).counit\nthis : IsIso (\u03b5.app (j.obj ((coreflector j).obj A)))\n\u22a2 A \u2208 j.essImage",
+              "tactic": "have : Mono (\u03b5.app A) := by\n  refine @mono_of_mono _ _ _ _ _ (\u03b5.app A) (section_ (\u03b5.app A)) ?_\n  rw [show \u03b5.app A \u226b section_ _ = _ from (\u03b5.naturality (section_ (\u03b5.app A))).symm]\n  apply mono_comp _ (\u03b5.app (j.obj ((coreflector j).obj A)))"
+            },
+            {
+              "annotated_tactic": [
+                "\"haveI := <a>isIso_of_mono_of_isSplitEpi<\\/a> (\\u03b5.app A)\"",
+                "[{\"full_name\":\"CategoryTheory.isIso_of_mono_of_isSplitEpi\",\"def_path\":\"Mathlib\\/CategoryTheory\\/EpiMono.lean\",\"def_pos\":[149,9],\"def_end_pos\":[149,36]}]"
+              ],
+              "state_after": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\nj : C \u2964 D\ninst\u271d\u00b9 : Coreflective j\nA : D\ninst\u271d : IsSplitEpi ((coreflectorAdjunction j).counit.app A)\n\u03b5 : coreflector j \u22d9 j \u27f6 \ud835\udfed D := (coreflectorAdjunction j).counit\nthis\u271d\u00b9 : IsIso (\u03b5.app (j.obj ((coreflector j).obj A)))\nthis\u271d : Mono (\u03b5.app A)\nthis : IsIso (\u03b5.app A)\n\u22a2 A \u2208 j.essImage",
+              "state_before": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\nj : C \u2964 D\ninst\u271d\u00b9 : Coreflective j\nA : D\ninst\u271d : IsSplitEpi ((coreflectorAdjunction j).counit.app A)\n\u03b5 : coreflector j \u22d9 j \u27f6 \ud835\udfed D := (coreflectorAdjunction j).counit\nthis\u271d : IsIso (\u03b5.app (j.obj ((coreflector j).obj A)))\nthis : Mono (\u03b5.app A)\n\u22a2 A \u2208 j.essImage",
+              "tactic": "haveI := isIso_of_mono_of_isSplitEpi (\u03b5.app A)"
+            },
+            {
+              "annotated_tactic": [
+                "\"exact (<a>coreflectorAdjunction<\\/a> j).<a>mem_essImage_of_counit_isIso<\\/a> A\"",
+                "[{\"full_name\":\"CategoryTheory.coreflectorAdjunction\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Reflective.lean\",\"def_pos\":[241,5],\"def_end_pos\":[241,26]},{\"full_name\":\"CategoryTheory.Adjunction.mem_essImage_of_counit_isIso\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/FullyFaithful.lean\",\"def_pos\":[174,7],\"def_end_pos\":[174,35]}]"
+              ],
+              "state_after": "no goals",
+              "state_before": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\nj : C \u2964 D\ninst\u271d\u00b9 : Coreflective j\nA : D\ninst\u271d : IsSplitEpi ((coreflectorAdjunction j).counit.app A)\n\u03b5 : coreflector j \u22d9 j \u27f6 \ud835\udfed D := (coreflectorAdjunction j).counit\nthis\u271d\u00b9 : IsIso (\u03b5.app (j.obj ((coreflector j).obj A)))\nthis\u271d : Mono (\u03b5.app A)\nthis : IsIso (\u03b5.app A)\n\u22a2 A \u2208 j.essImage",
+              "tactic": "exact (coreflectorAdjunction j).mem_essImage_of_counit_isIso A"
+            },
+            {
+              "annotated_tactic": [
+                "\"refine @<a>mono_of_mono<\\/a> _ _ _ _ _ (\\u03b5.app A) (<a>section_<\\/a> (\\u03b5.app A)) ?_\"",
+                "[{\"full_name\":\"CategoryTheory.mono_of_mono\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Category\\/Basic.lean\",\"def_pos\":[341,9],\"def_end_pos\":[341,21]},{\"full_name\":\"CategoryTheory.section_\",\"def_path\":\"Mathlib\\/CategoryTheory\\/EpiMono.lean\",\"def_pos\":[129,19],\"def_end_pos\":[129,27]}]"
+              ],
+              "state_after": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\nj : C \u2964 D\ninst\u271d\u00b9 : Coreflective j\nA : D\ninst\u271d : IsSplitEpi ((coreflectorAdjunction j).counit.app A)\n\u03b5 : coreflector j \u22d9 j \u27f6 \ud835\udfed D := (coreflectorAdjunction j).counit\nthis : IsIso (\u03b5.app (j.obj ((coreflector j).obj A)))\n\u22a2 Mono (\u03b5.app A \u226b section_ (\u03b5.app A))",
+              "state_before": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\nj : C \u2964 D\ninst\u271d\u00b9 : Coreflective j\nA : D\ninst\u271d : IsSplitEpi ((coreflectorAdjunction j).counit.app A)\n\u03b5 : coreflector j \u22d9 j \u27f6 \ud835\udfed D := (coreflectorAdjunction j).counit\nthis : IsIso (\u03b5.app (j.obj ((coreflector j).obj A)))\n\u22a2 Mono (\u03b5.app A)",
+              "tactic": "refine @mono_of_mono _ _ _ _ _ (\u03b5.app A) (section_ (\u03b5.app A)) ?_"
+            },
+            {
+              "annotated_tactic": [
+                "\"rw [show \\u03b5.app A \\u226b <a>section_<\\/a> _ = _ from (\\u03b5.naturality (<a>section_<\\/a> (\\u03b5.app A))).<a>symm<\\/a>]\"",
+                "[{\"full_name\":\"CategoryTheory.section_\",\"def_path\":\"Mathlib\\/CategoryTheory\\/EpiMono.lean\",\"def_pos\":[129,19],\"def_end_pos\":[129,27]},{\"full_name\":\"CategoryTheory.section_\",\"def_path\":\"Mathlib\\/CategoryTheory\\/EpiMono.lean\",\"def_pos\":[129,19],\"def_end_pos\":[129,27]},{\"full_name\":\"Eq.symm\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Prelude.lean\",\"def_pos\":[323,9],\"def_end_pos\":[323,16]}]"
+              ],
+              "state_after": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\nj : C \u2964 D\ninst\u271d\u00b9 : Coreflective j\nA : D\ninst\u271d : IsSplitEpi ((coreflectorAdjunction j).counit.app A)\n\u03b5 : coreflector j \u22d9 j \u27f6 \ud835\udfed D := (coreflectorAdjunction j).counit\nthis : IsIso (\u03b5.app (j.obj ((coreflector j).obj A)))\n\u22a2 Mono ((coreflector j \u22d9 j).map (section_ (\u03b5.app A)) \u226b \u03b5.app ((coreflector j \u22d9 j).obj A))",
+              "state_before": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\nj : C \u2964 D\ninst\u271d\u00b9 : Coreflective j\nA : D\ninst\u271d : IsSplitEpi ((coreflectorAdjunction j).counit.app A)\n\u03b5 : coreflector j \u22d9 j \u27f6 \ud835\udfed D := (coreflectorAdjunction j).counit\nthis : IsIso (\u03b5.app (j.obj ((coreflector j).obj A)))\n\u22a2 Mono (\u03b5.app A \u226b section_ (\u03b5.app A))",
+              "tactic": "rw [show \u03b5.app A \u226b section_ _ = _ from (\u03b5.naturality (section_ (\u03b5.app A))).symm]"
+            },
+            {
+              "annotated_tactic": [
+                "\"apply <a>mono_comp<\\/a> _ (\\u03b5.app (j.obj ((<a>coreflector<\\/a> j).<a>obj<\\/a> A)))\"",
+                "[{\"full_name\":\"CategoryTheory.mono_comp\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Category\\/Basic.lean\",\"def_pos\":[333,9],\"def_end_pos\":[333,18]},{\"full_name\":\"CategoryTheory.coreflector\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Reflective.lean\",\"def_pos\":[238,5],\"def_end_pos\":[238,16]},{\"full_name\":\"Prefunctor.obj\",\"def_path\":\"Mathlib\\/Combinatorics\\/Quiver\\/Basic.lean\",\"def_pos\":[59,3],\"def_end_pos\":[59,6]}]"
+              ],
+              "state_after": "no goals",
+              "state_before": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\nj : C \u2964 D\ninst\u271d\u00b9 : Coreflective j\nA : D\ninst\u271d : IsSplitEpi ((coreflectorAdjunction j).counit.app A)\n\u03b5 : coreflector j \u22d9 j \u27f6 \ud835\udfed D := (coreflectorAdjunction j).counit\nthis : IsIso (\u03b5.app (j.obj ((coreflector j).obj A)))\n\u22a2 Mono ((coreflector j \u22d9 j).map (section_ (\u03b5.app A)) \u226b \u03b5.app ((coreflector j \u22d9 j).obj A))",
+              "tactic": "apply mono_comp _ (\u03b5.app (j.obj ((coreflector j).obj A)))"
+            }
+          ],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/Reflective.lean"
+      },
+      {
+        "error": "no internal trace for tactic 'refine @epi_of_epi _ _ _ _ _ (retraction (\u03b7.app A)) (\u03b7.app A) ?_'",
+        "full_name": "CategoryTheory.mem_essImage_of_unit_isSplitMono",
+        "id": "CategoryTheory.mem_essImage_of_unit_isSplitMono",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            103,
+            61
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/Reflective.lean",
+          "full_name": "CategoryTheory.mem_essImage_of_unit_isSplitMono",
+          "start": [
+            93,
+            1
+          ],
+          "traced_tactics": [
+            {
+              "annotated_tactic": [
+                "\"let \\u03b7 : \\ud835\\udfed C \\u27f6 <a>reflector<\\/a> i \\u22d9 i := (<a>reflectorAdjunction<\\/a> i).<a>unit<\\/a>\"",
+                "[{\"full_name\":\"CategoryTheory.reflector\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Reflective.lean\",\"def_pos\":[46,5],\"def_end_pos\":[46,14]},{\"full_name\":\"CategoryTheory.reflectorAdjunction\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Reflective.lean\",\"def_pos\":[49,5],\"def_end_pos\":[49,24]},{\"full_name\":\"CategoryTheory.Adjunction.unit\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Basic.lean\",\"def_pos\":[65,3],\"def_end_pos\":[65,7]}]"
+              ],
+              "state_after": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\ninst\u271d\u00b9 : Reflective i\nA : C\ninst\u271d : IsSplitMono ((reflectorAdjunction i).unit.app A)\n\u03b7 : \ud835\udfed C \u27f6 reflector i \u22d9 i := (reflectorAdjunction i).unit\n\u22a2 A \u2208 i.essImage",
+              "state_before": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\ninst\u271d\u00b9 : Reflective i\nA : C\ninst\u271d : IsSplitMono ((reflectorAdjunction i).unit.app A)\n\u22a2 A \u2208 i.essImage",
+              "tactic": "let \u03b7 : \ud835\udfed C \u27f6 reflector i \u22d9 i := (reflectorAdjunction i).unit"
+            },
+            {
+              "annotated_tactic": [
+                "\"haveI : <a>IsIso<\\/a> (\\u03b7.app (i.obj ((<a>reflector<\\/a> i).<a>obj<\\/a> A))) :=\\n    <a>Functor.essImage.unit_isIso<\\/a> ((i.obj_mem_essImage _))\"",
+                "[{\"full_name\":\"CategoryTheory.IsIso\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Iso.lean\",\"def_pos\":[272,7],\"def_end_pos\":[272,12]},{\"full_name\":\"CategoryTheory.reflector\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Reflective.lean\",\"def_pos\":[46,5],\"def_end_pos\":[46,14]},{\"full_name\":\"Prefunctor.obj\",\"def_path\":\"Mathlib\\/Combinatorics\\/Quiver\\/Basic.lean\",\"def_pos\":[59,3],\"def_end_pos\":[59,6]},{\"full_name\":\"CategoryTheory.Functor.essImage.unit_isIso\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Reflective.lean\",\"def_pos\":[87,9],\"def_end_pos\":[87,36]}]"
+              ],
+              "state_after": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\ninst\u271d\u00b9 : Reflective i\nA : C\ninst\u271d : IsSplitMono ((reflectorAdjunction i).unit.app A)\n\u03b7 : \ud835\udfed C \u27f6 reflector i \u22d9 i := (reflectorAdjunction i).unit\nthis : IsIso (\u03b7.app (i.obj ((reflector i).obj A)))\n\u22a2 A \u2208 i.essImage",
+              "state_before": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\ninst\u271d\u00b9 : Reflective i\nA : C\ninst\u271d : IsSplitMono ((reflectorAdjunction i).unit.app A)\n\u03b7 : \ud835\udfed C \u27f6 reflector i \u22d9 i := (reflectorAdjunction i).unit\n\u22a2 A \u2208 i.essImage",
+              "tactic": "haveI : IsIso (\u03b7.app (i.obj ((reflector i).obj A))) :=\n  Functor.essImage.unit_isIso ((i.obj_mem_essImage _))"
+            },
+            {
+              "annotated_tactic": [
+                "\"have : <a>Epi<\\/a> (\\u03b7.app A) := by\\n    refine @<a>epi_of_epi<\\/a> _ _ _ _ _ (<a>retraction<\\/a> (\\u03b7.app A)) (\\u03b7.app A) ?_\\n    rw [show <a>retraction<\\/a> _ \\u226b \\u03b7.app A = _ from \\u03b7.naturality (<a>retraction<\\/a> (\\u03b7.app A))]\\n    apply <a>epi_comp<\\/a> (\\u03b7.app (i.obj ((<a>reflector<\\/a> i).<a>obj<\\/a> A)))\"",
+                "[{\"full_name\":\"CategoryTheory.Epi\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Category\\/Basic.lean\",\"def_pos\":[285,7],\"def_end_pos\":[285,10]},{\"full_name\":\"CategoryTheory.epi_of_epi\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Category\\/Basic.lean\",\"def_pos\":[356,9],\"def_end_pos\":[356,19]},{\"full_name\":\"CategoryTheory.retraction\",\"def_path\":\"Mathlib\\/CategoryTheory\\/EpiMono.lean\",\"def_pos\":[101,19],\"def_end_pos\":[101,29]},{\"full_name\":\"CategoryTheory.retraction\",\"def_path\":\"Mathlib\\/CategoryTheory\\/EpiMono.lean\",\"def_pos\":[101,19],\"def_end_pos\":[101,29]},{\"full_name\":\"CategoryTheory.retraction\",\"def_path\":\"Mathlib\\/CategoryTheory\\/EpiMono.lean\",\"def_pos\":[101,19],\"def_end_pos\":[101,29]},{\"full_name\":\"CategoryTheory.epi_comp\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Category\\/Basic.lean\",\"def_pos\":[325,9],\"def_end_pos\":[325,17]},{\"full_name\":\"CategoryTheory.reflector\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Reflective.lean\",\"def_pos\":[46,5],\"def_end_pos\":[46,14]},{\"full_name\":\"Prefunctor.obj\",\"def_path\":\"Mathlib\\/Combinatorics\\/Quiver\\/Basic.lean\",\"def_pos\":[59,3],\"def_end_pos\":[59,6]}]"
+              ],
+              "state_after": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\ninst\u271d\u00b9 : Reflective i\nA : C\ninst\u271d : IsSplitMono ((reflectorAdjunction i).unit.app A)\n\u03b7 : \ud835\udfed C \u27f6 reflector i \u22d9 i := (reflectorAdjunction i).unit\nthis\u271d : IsIso (\u03b7.app (i.obj ((reflector i).obj A)))\nthis : Epi (\u03b7.app A)\n\u22a2 A \u2208 i.essImage",
+              "state_before": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\ninst\u271d\u00b9 : Reflective i\nA : C\ninst\u271d : IsSplitMono ((reflectorAdjunction i).unit.app A)\n\u03b7 : \ud835\udfed C \u27f6 reflector i \u22d9 i := (reflectorAdjunction i).unit\nthis : IsIso (\u03b7.app (i.obj ((reflector i).obj A)))\n\u22a2 A \u2208 i.essImage",
+              "tactic": "have : Epi (\u03b7.app A) := by\n  refine @epi_of_epi _ _ _ _ _ (retraction (\u03b7.app A)) (\u03b7.app A) ?_\n  rw [show retraction _ \u226b \u03b7.app A = _ from \u03b7.naturality (retraction (\u03b7.app A))]\n  apply epi_comp (\u03b7.app (i.obj ((reflector i).obj A)))"
+            },
+            {
+              "annotated_tactic": [
+                "\"haveI := <a>isIso_of_epi_of_isSplitMono<\\/a> (\\u03b7.app A)\"",
+                "[{\"full_name\":\"CategoryTheory.isIso_of_epi_of_isSplitMono\",\"def_path\":\"Mathlib\\/CategoryTheory\\/EpiMono.lean\",\"def_pos\":[122,9],\"def_end_pos\":[122,36]}]"
+              ],
+              "state_after": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\ninst\u271d\u00b9 : Reflective i\nA : C\ninst\u271d : IsSplitMono ((reflectorAdjunction i).unit.app A)\n\u03b7 : \ud835\udfed C \u27f6 reflector i \u22d9 i := (reflectorAdjunction i).unit\nthis\u271d\u00b9 : IsIso (\u03b7.app (i.obj ((reflector i).obj A)))\nthis\u271d : Epi (\u03b7.app A)\nthis : IsIso (\u03b7.app A)\n\u22a2 A \u2208 i.essImage",
+              "state_before": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\ninst\u271d\u00b9 : Reflective i\nA : C\ninst\u271d : IsSplitMono ((reflectorAdjunction i).unit.app A)\n\u03b7 : \ud835\udfed C \u27f6 reflector i \u22d9 i := (reflectorAdjunction i).unit\nthis\u271d : IsIso (\u03b7.app (i.obj ((reflector i).obj A)))\nthis : Epi (\u03b7.app A)\n\u22a2 A \u2208 i.essImage",
+              "tactic": "haveI := isIso_of_epi_of_isSplitMono (\u03b7.app A)"
+            },
+            {
+              "annotated_tactic": [
+                "\"exact (<a>reflectorAdjunction<\\/a> i).<a>mem_essImage_of_unit_isIso<\\/a> A\"",
+                "[{\"full_name\":\"CategoryTheory.reflectorAdjunction\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Reflective.lean\",\"def_pos\":[49,5],\"def_end_pos\":[49,24]},{\"full_name\":\"CategoryTheory.Adjunction.mem_essImage_of_unit_isIso\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/FullyFaithful.lean\",\"def_pos\":[198,9],\"def_end_pos\":[198,35]}]"
+              ],
+              "state_after": "no goals",
+              "state_before": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\ninst\u271d\u00b9 : Reflective i\nA : C\ninst\u271d : IsSplitMono ((reflectorAdjunction i).unit.app A)\n\u03b7 : \ud835\udfed C \u27f6 reflector i \u22d9 i := (reflectorAdjunction i).unit\nthis\u271d\u00b9 : IsIso (\u03b7.app (i.obj ((reflector i).obj A)))\nthis\u271d : Epi (\u03b7.app A)\nthis : IsIso (\u03b7.app A)\n\u22a2 A \u2208 i.essImage",
+              "tactic": "exact (reflectorAdjunction i).mem_essImage_of_unit_isIso A"
+            },
+            {
+              "annotated_tactic": [
+                "\"refine @<a>epi_of_epi<\\/a> _ _ _ _ _ (<a>retraction<\\/a> (\\u03b7.app A)) (\\u03b7.app A) ?_\"",
+                "[{\"full_name\":\"CategoryTheory.epi_of_epi\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Category\\/Basic.lean\",\"def_pos\":[356,9],\"def_end_pos\":[356,19]},{\"full_name\":\"CategoryTheory.retraction\",\"def_path\":\"Mathlib\\/CategoryTheory\\/EpiMono.lean\",\"def_pos\":[101,19],\"def_end_pos\":[101,29]}]"
+              ],
+              "state_after": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\ninst\u271d\u00b9 : Reflective i\nA : C\ninst\u271d : IsSplitMono ((reflectorAdjunction i).unit.app A)\n\u03b7 : \ud835\udfed C \u27f6 reflector i \u22d9 i := (reflectorAdjunction i).unit\nthis : IsIso (\u03b7.app (i.obj ((reflector i).obj A)))\n\u22a2 Epi (retraction (\u03b7.app A) \u226b \u03b7.app A)",
+              "state_before": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\ninst\u271d\u00b9 : Reflective i\nA : C\ninst\u271d : IsSplitMono ((reflectorAdjunction i).unit.app A)\n\u03b7 : \ud835\udfed C \u27f6 reflector i \u22d9 i := (reflectorAdjunction i).unit\nthis : IsIso (\u03b7.app (i.obj ((reflector i).obj A)))\n\u22a2 Epi (\u03b7.app A)",
+              "tactic": "refine @epi_of_epi _ _ _ _ _ (retraction (\u03b7.app A)) (\u03b7.app A) ?_"
+            },
+            {
+              "annotated_tactic": [
+                "\"rw [show <a>retraction<\\/a> _ \\u226b \\u03b7.app A = _ from \\u03b7.naturality (<a>retraction<\\/a> (\\u03b7.app A))]\"",
+                "[{\"full_name\":\"CategoryTheory.retraction\",\"def_path\":\"Mathlib\\/CategoryTheory\\/EpiMono.lean\",\"def_pos\":[101,19],\"def_end_pos\":[101,29]},{\"full_name\":\"CategoryTheory.retraction\",\"def_path\":\"Mathlib\\/CategoryTheory\\/EpiMono.lean\",\"def_pos\":[101,19],\"def_end_pos\":[101,29]}]"
+              ],
+              "state_after": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\ninst\u271d\u00b9 : Reflective i\nA : C\ninst\u271d : IsSplitMono ((reflectorAdjunction i).unit.app A)\n\u03b7 : \ud835\udfed C \u27f6 reflector i \u22d9 i := (reflectorAdjunction i).unit\nthis : IsIso (\u03b7.app (i.obj ((reflector i).obj A)))\n\u22a2 Epi (\u03b7.app ((reflector i \u22d9 i).obj A) \u226b (reflector i \u22d9 i).map (retraction (\u03b7.app A)))",
+              "state_before": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\ninst\u271d\u00b9 : Reflective i\nA : C\ninst\u271d : IsSplitMono ((reflectorAdjunction i).unit.app A)\n\u03b7 : \ud835\udfed C \u27f6 reflector i \u22d9 i := (reflectorAdjunction i).unit\nthis : IsIso (\u03b7.app (i.obj ((reflector i).obj A)))\n\u22a2 Epi (retraction (\u03b7.app A) \u226b \u03b7.app A)",
+              "tactic": "rw [show retraction _ \u226b \u03b7.app A = _ from \u03b7.naturality (retraction (\u03b7.app A))]"
+            },
+            {
+              "annotated_tactic": [
+                "\"apply <a>epi_comp<\\/a> (\\u03b7.app (i.obj ((<a>reflector<\\/a> i).<a>obj<\\/a> A)))\"",
+                "[{\"full_name\":\"CategoryTheory.epi_comp\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Category\\/Basic.lean\",\"def_pos\":[325,9],\"def_end_pos\":[325,17]},{\"full_name\":\"CategoryTheory.reflector\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Adjunction\\/Reflective.lean\",\"def_pos\":[46,5],\"def_end_pos\":[46,14]},{\"full_name\":\"Prefunctor.obj\",\"def_path\":\"Mathlib\\/Combinatorics\\/Quiver\\/Basic.lean\",\"def_pos\":[59,3],\"def_end_pos\":[59,6]}]"
+              ],
+              "state_after": "no goals",
+              "state_before": "C : Type u\u2081\nD : Type u\u2082\nE : Type u\u2083\ninst\u271d\u2074 : Category.{v\u2081, u\u2081} C\ninst\u271d\u00b3 : Category.{v\u2082, u\u2082} D\ninst\u271d\u00b2 : Category.{v\u2083, u\u2083} E\ni : D \u2964 C\ninst\u271d\u00b9 : Reflective i\nA : C\ninst\u271d : IsSplitMono ((reflectorAdjunction i).unit.app A)\n\u03b7 : \ud835\udfed C \u27f6 reflector i \u22d9 i := (reflectorAdjunction i).unit\nthis : IsIso (\u03b7.app (i.obj ((reflector i).obj A)))\n\u22a2 Epi (\u03b7.app ((reflector i \u22d9 i).obj A) \u226b (reflector i \u22d9 i).map (retraction (\u03b7.app A)))",
+              "tactic": "apply epi_comp (\u03b7.app (i.obj ((reflector i).obj A)))"
+            }
+          ],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/Reflective.lean"
+      }
+    ],
+    "input_proofs": 15,
+    "input_units": 2,
+    "proofs": 12,
+    "published_proofs": 12,
+    "published_transitions": 16,
+    "replay_failures": [],
+    "transitions": 16,
+    "validation_failures": [],
+    "validation_rejected_proofs": 0,
+    "zero_transition_proofs": 0
+  },
+  "shards": [
+    {
+      "path": "data/train/mathlib-000606-0000-f573e05b1e1bd441.parquet",
+      "sha256": "f573e05b1e1bd4414582d761464b91a1a9eb1ec4a04ce976599acda0ff3315e1",
+      "bytes": 112006,
+      "rows": 12,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    },
+    {
+      "path": "data/dev/mathlib-000606-0000-9b47c55b4cc6fd55.parquet",
+      "sha256": "9b47c55b4cc6fd55fefe25b53dfa0ace0f45aa8168868689d45ede4667d14fdc",
+      "bytes": 59382,
+      "rows": 2,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    },
+    {
+      "path": "data/internal_test/mathlib-000606-0000-6695ee59163d450c.parquet",
+      "sha256": "6695ee59163d450c2ae11c9aab80685666a8aa3ae54a97ac1c1b347f873e2809",
+      "bytes": 50712,
+      "rows": 2,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    }
+  ],
+  "proof_ids": [
+    "mathlib:CategoryTheory.Adjunction.map_restrictFullyFaithful_counit_app",
+    "mathlib:CategoryTheory.Adjunction.map_restrictFullyFaithful_unit_app",
+    "mathlib:CategoryTheory.Adjunction.restrictFullyFaithful_homEquiv_apply",
+    "mathlib:CategoryTheory.Functor.essImage.counit_isIso",
+    "mathlib:CategoryTheory.Functor.essImage.unit_isIso",
+    "mathlib:CategoryTheory.counit_obj_eq_map_counit",
+    "mathlib:CategoryTheory.equivEssImageOfReflective_map_counitIso_app_hom",
+    "mathlib:CategoryTheory.unitCompPartialBijectiveAux_symm_apply",
+    "mathlib:CategoryTheory.unitCompPartialBijective_natural",
+    "mathlib:CategoryTheory.unitCompPartialBijective_symm_apply",
+    "mathlib:CategoryTheory.unitCompPartialBijective_symm_natural",
+    "mathlib:CategoryTheory.unit_obj_eq_map_unit"
+  ],
+  "proof_keys": [
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Reflective.lean\",null,null,\"CategoryTheory.Functor.essImage.counit_isIso\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Reflective.lean\",null,null,\"CategoryTheory.Functor.essImage.unit_isIso\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Reflective.lean\",null,null,\"CategoryTheory.counit_obj_eq_map_counit\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Reflective.lean\",null,null,\"CategoryTheory.equivEssImageOfReflective_map_counitIso_app_hom\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Reflective.lean\",null,null,\"CategoryTheory.unitCompPartialBijectiveAux_symm_apply\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Reflective.lean\",null,null,\"CategoryTheory.unitCompPartialBijective_natural\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Reflective.lean\",null,null,\"CategoryTheory.unitCompPartialBijective_symm_apply\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Reflective.lean\",null,null,\"CategoryTheory.unitCompPartialBijective_symm_natural\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Reflective.lean\",null,null,\"CategoryTheory.unit_obj_eq_map_unit\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Restrict.lean\",null,null,\"CategoryTheory.Adjunction.map_restrictFullyFaithful_counit_app\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Restrict.lean\",null,null,\"CategoryTheory.Adjunction.map_restrictFullyFaithful_unit_app\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Restrict.lean\",null,null,\"CategoryTheory.Adjunction.restrictFullyFaithful_homEquiv_apply\"]"
+  ]
+}

manifests/batches/mathlib/000607.json

@@ -0,0 +1,167 @@
+{
+  "format": "leangpt-parquet-v2",
+  "batch": "mathlib/000607",
+  "batch_fingerprint": "2e1023e369b686f12bae681d0d33d3d2d6604bae99b8c11decc1114486dbb0db",
+  "evidence": {
+    "batch_fingerprint": "2e1023e369b686f12bae681d0d33d3d2d6604bae99b8c11decc1114486dbb0db",
+    "contamination_matches": [],
+    "failures": [
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Adjunction.leftAdjointUniq_inv_app",
+        "id": "CategoryTheory.Adjunction.leftAdjointUniq_inv_app",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            158,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/Unique.lean",
+          "full_name": "CategoryTheory.Adjunction.leftAdjointUniq_inv_app",
+          "start": [
+            156,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/Unique.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Adjunction.rightAdjointUniq_inv_app",
+        "id": "CategoryTheory.Adjunction.rightAdjointUniq_inv_app",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            229,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Adjunction/Unique.lean",
+          "full_name": "CategoryTheory.Adjunction.rightAdjointUniq_inv_app",
+          "start": [
+            227,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Adjunction/Unique.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.isIso_iff_mono_and_epi",
+        "id": "CategoryTheory.isIso_iff_mono_and_epi",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            44,
+            82
+          ],
+          "file_path": "Mathlib/CategoryTheory/Balanced.lean",
+          "full_name": "CategoryTheory.isIso_iff_mono_and_epi",
+          "start": [
+            43,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Balanced.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.isIso_of_mono_of_epi",
+        "id": "CategoryTheory.isIso_of_mono_of_epi",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            40,
+            34
+          ],
+          "file_path": "Mathlib/CategoryTheory/Balanced.lean",
+          "full_name": "CategoryTheory.isIso_of_mono_of_epi",
+          "start": [
+            39,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Balanced.lean"
+      }
+    ],
+    "input_proofs": 23,
+    "input_units": 2,
+    "proofs": 19,
+    "published_proofs": 19,
+    "published_transitions": 38,
+    "replay_failures": [],
+    "transitions": 38,
+    "validation_failures": [],
+    "validation_rejected_proofs": 0,
+    "zero_transition_proofs": 0
+  },
+  "shards": [
+    {
+      "path": "data/train/mathlib-000607-0000-086dd4c6b5e424d2.parquet",
+      "sha256": "086dd4c6b5e424d261540ffc4a0c71dd00a92e47f7a03d948e4ad3a5ffa36392",
+      "bytes": 138127,
+      "rows": 31,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    },
+    {
+      "path": "data/internal_test/mathlib-000607-0000-559cf9704cc3f0a1.parquet",
+      "sha256": "559cf9704cc3f0a1077accbcbd08544508c792db07ae9c775b7089e807052433",
+      "bytes": 58517,
+      "rows": 7,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    }
+  ],
+  "proof_ids": [
+    "mathlib:CategoryTheory.Adjunction.homEquiv_leftAdjointUniq_hom_app",
+    "mathlib:CategoryTheory.Adjunction.homEquiv_symm_rightAdjointUniq_hom_app",
+    "mathlib:CategoryTheory.Adjunction.leftAdjointUniq_hom_app_counit",
+    "mathlib:CategoryTheory.Adjunction.leftAdjointUniq_hom_counit",
+    "mathlib:CategoryTheory.Adjunction.leftAdjointUniq_refl",
+    "mathlib:CategoryTheory.Adjunction.leftAdjointUniq_trans",
+    "mathlib:CategoryTheory.Adjunction.natTransEquiv_comp",
+    "mathlib:CategoryTheory.Adjunction.natTransEquiv_comp_symm",
+    "mathlib:CategoryTheory.Adjunction.natTransEquiv_id",
+    "mathlib:CategoryTheory.Adjunction.natTransEquiv_id_symm",
+    "mathlib:CategoryTheory.Adjunction.rightAdjointUniq_hom_app_counit",
+    "mathlib:CategoryTheory.Adjunction.rightAdjointUniq_hom_counit",
+    "mathlib:CategoryTheory.Adjunction.rightAdjointUniq_refl",
+    "mathlib:CategoryTheory.Adjunction.rightAdjointUniq_trans",
+    "mathlib:CategoryTheory.Adjunction.rightAdjointUniq_trans_app",
+    "mathlib:CategoryTheory.Adjunction.unit_leftAdjointUniq_hom_app",
+    "mathlib:CategoryTheory.Adjunction.unit_rightAdjointUniq_hom",
+    "mathlib:CategoryTheory.Adjunction.unit_rightAdjointUniq_hom_app",
+    "mathlib:CategoryTheory.balanced_opposite"
+  ],
+  "proof_keys": [
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Unique.lean\",null,null,\"CategoryTheory.Adjunction.homEquiv_leftAdjointUniq_hom_app\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Unique.lean\",null,null,\"CategoryTheory.Adjunction.homEquiv_symm_rightAdjointUniq_hom_app\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Unique.lean\",null,null,\"CategoryTheory.Adjunction.leftAdjointUniq_hom_app_counit\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Unique.lean\",null,null,\"CategoryTheory.Adjunction.leftAdjointUniq_hom_counit\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Unique.lean\",null,null,\"CategoryTheory.Adjunction.leftAdjointUniq_refl\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Unique.lean\",null,null,\"CategoryTheory.Adjunction.leftAdjointUniq_trans\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Unique.lean\",null,null,\"CategoryTheory.Adjunction.natTransEquiv_comp\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Unique.lean\",null,null,\"CategoryTheory.Adjunction.natTransEquiv_comp_symm\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Unique.lean\",null,null,\"CategoryTheory.Adjunction.natTransEquiv_id\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Unique.lean\",null,null,\"CategoryTheory.Adjunction.natTransEquiv_id_symm\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Unique.lean\",null,null,\"CategoryTheory.Adjunction.rightAdjointUniq_hom_app_counit\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Unique.lean\",null,null,\"CategoryTheory.Adjunction.rightAdjointUniq_hom_counit\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Unique.lean\",null,null,\"CategoryTheory.Adjunction.rightAdjointUniq_refl\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Unique.lean\",null,null,\"CategoryTheory.Adjunction.rightAdjointUniq_trans\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Unique.lean\",null,null,\"CategoryTheory.Adjunction.rightAdjointUniq_trans_app\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Unique.lean\",null,null,\"CategoryTheory.Adjunction.unit_leftAdjointUniq_hom_app\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Unique.lean\",null,null,\"CategoryTheory.Adjunction.unit_rightAdjointUniq_hom\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Adjunction/Unique.lean\",null,null,\"CategoryTheory.Adjunction.unit_rightAdjointUniq_hom_app\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Balanced.lean\",null,null,\"CategoryTheory.balanced_opposite\"]"
+  ]
+}

manifests/batches/mathlib/000609.json

@@ -0,0 +1,404 @@
+{
+  "format": "leangpt-parquet-v2",
+  "batch": "mathlib/000609",
+  "batch_fingerprint": "c58622f8dc48219fdd678a975f4e73ea9e1d1bcfa6b60fb8a85f75775a8a120f",
+  "evidence": {
+    "batch_fingerprint": "c58622f8dc48219fdd678a975f4e73ea9e1d1bcfa6b60fb8a85f75775a8a120f",
+    "batch_outcome": "all_inputs_failed_with_evidence",
+    "contamination_matches": [],
+    "failures": [
+      {
+        "error": "no internal trace for tactic 'apply Eq.trans <;> assumption'",
+        "full_name": "CategoryTheory.FreeBicategory.normalizeAux_congr",
+        "id": "CategoryTheory.FreeBicategory.normalizeAux_congr",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            157,
+            21
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Coherence.lean",
+          "full_name": "CategoryTheory.FreeBicategory.normalizeAux_congr",
+          "start": [
+            148,
+            1
+          ],
+          "traced_tactics": [
+            {
+              "annotated_tactic": [
+                "\"rcases \\u03b7 with \\u27e8\\u03b7'\\u27e9\"",
+                "[]"
+              ],
+              "state_after": "case mk\nB : Type u\ninst\u271d : Quiver B\na b c : B\np : Path a b\nf g : Hom b c\n\u03b7 : f \u27f6 g\n\u03b7' : Hom\u2082 f g\n\u22a2 normalizeAux p f = normalizeAux p g",
+              "state_before": "B : Type u\ninst\u271d : Quiver B\na b c : B\np : Path a b\nf g : Hom b c\n\u03b7 : f \u27f6 g\n\u22a2 normalizeAux p f = normalizeAux p g",
+              "tactic": "rcases \u03b7 with \u27e8\u03b7'\u27e9"
+            },
+            {
+              "annotated_tactic": [
+                "\"apply @<a>congr_fun<\\/a> _ _ fun p => <a>normalizeAux<\\/a> p f\"",
+                "[{\"full_name\":\"congr_fun\",\"def_path\":\".lake\\/packages\\/batteries\\/Batteries\\/Logic.lean\",\"def_pos\":[78,7],\"def_end_pos\":[78,16]},{\"full_name\":\"CategoryTheory.FreeBicategory.normalizeAux\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/Coherence.lean\",\"def_pos\":[107,5],\"def_end_pos\":[107,17]}]"
+              ],
+              "state_after": "case mk.h\nB : Type u\ninst\u271d : Quiver B\na b c : B\np : Path a b\nf g : Hom b c\n\u03b7 : f \u27f6 g\n\u03b7' : Hom\u2082 f g\n\u22a2 (fun p => normalizeAux p f) = fun p => normalizeAux p g",
+              "state_before": "case mk\nB : Type u\ninst\u271d : Quiver B\na b c : B\np : Path a b\nf g : Hom b c\n\u03b7 : f \u27f6 g\n\u03b7' : Hom\u2082 f g\n\u22a2 normalizeAux p f = normalizeAux p g",
+              "tactic": "apply @congr_fun _ _ fun p => normalizeAux p f"
+            },
+            {
+              "annotated_tactic": [
+                "\"clear p \\u03b7\"",
+                "[]"
+              ],
+              "state_after": "case mk.h\nB : Type u\ninst\u271d : Quiver B\na b c : B\nf g : Hom b c\n\u03b7' : Hom\u2082 f g\n\u22a2 (fun p => normalizeAux p f) = fun p => normalizeAux p g",
+              "state_before": "case mk.h\nB : Type u\ninst\u271d : Quiver B\na b c : B\np : Path a b\nf g : Hom b c\n\u03b7 : f \u27f6 g\n\u03b7' : Hom\u2082 f g\n\u22a2 (fun p => normalizeAux p f) = fun p => normalizeAux p g",
+              "tactic": "clear p \u03b7"
+            },
+            {
+              "annotated_tactic": [
+                "\"induction \\u03b7' with\\n  | <a>vcomp<\\/a> _ _ _ _ => apply <a>Eq.trans<\\/a> <;> assumption\\n  | <a>whisker_left<\\/a> _ _ ih => funext; apply <a>congr_fun<\\/a> ih\\n  | <a>whisker_right<\\/a> _ _ ih => funext; apply <a>congr_arg\\u2082<\\/a> _ (<a>congr_fun<\\/a> ih _) <a>rfl<\\/a>\\n  | _ => funext; rfl\"",
+                "[{\"full_name\":\"CategoryTheory.FreeBicategory.Hom\\u2082.vcomp\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/Free.lean\",\"def_pos\":[71,5],\"def_end_pos\":[71,10]},{\"full_name\":\"Eq.trans\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Prelude.lean\",\"def_pos\":[335,9],\"def_end_pos\":[335,17]},{\"full_name\":\"CategoryTheory.FreeBicategory.Hom\\u2082.whisker_left\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/Free.lean\",\"def_pos\":[72,5],\"def_end_pos\":[72,17]},{\"full_name\":\"congr_fun\",\"def_path\":\".lake\\/packages\\/batteries\\/Batteries\\/Logic.lean\",\"def_pos\":[78,7],\"def_end_pos\":[78,16]},{\"full_name\":\"CategoryTheory.FreeBicategory.Hom\\u2082.whisker_right\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/Free.lean\",\"def_pos\":[74,5],\"def_end_pos\":[74,18]},{\"full_name\":\"congr_arg\\u2082\",\"def_path\":\".lake\\/packages\\/batteries\\/Batteries\\/Logic.lean\",\"def_pos\":[77,7],\"def_end_pos\":[77,17]},{\"full_name\":\"congr_fun\",\"def_path\":\".lake\\/packages\\/batteries\\/Batteries\\/Logic.lean\",\"def_pos\":[78,7],\"def_end_pos\":[78,16]},{\"full_name\":\"rfl\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Prelude.lean\",\"def_pos\":[294,22],\"def_end_pos\":[294,25]}]"
+              ],
+              "state_after": "no goals",
+              "state_before": "case mk.h\nB : Type u\ninst\u271d : Quiver B\na b c : B\nf g : Hom b c\n\u03b7' : Hom\u2082 f g\n\u22a2 (fun p => normalizeAux p f) = fun p => normalizeAux p g",
+              "tactic": "induction \u03b7' with\n| vcomp _ _ _ _ => apply Eq.trans <;> assumption\n| whisker_left _ _ ih => funext; apply congr_fun ih\n| whisker_right _ _ ih => funext; apply congr_arg\u2082 _ (congr_fun ih _) rfl\n| _ => funext; rfl"
+            },
+            {
+              "annotated_tactic": [
+                "\"apply <a>Eq.trans<\\/a> <;> assumption\"",
+                "[{\"full_name\":\"Eq.trans\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Prelude.lean\",\"def_pos\":[335,9],\"def_end_pos\":[335,17]}]"
+              ],
+              "state_after": "no goals",
+              "state_before": "case mk.h.vcomp\nB : Type u\ninst\u271d : Quiver B\na b c : B\nf g : Hom b c\na\u271d b\u271d : FreeBicategory B\nf\u271d g\u271d h\u271d : a\u271d \u27f6 b\u271d\n\u03b7\u271d : Hom\u2082 f\u271d g\u271d\n\u03b8\u271d : Hom\u2082 g\u271d h\u271d\n\u03b7_ih\u271d : (fun p => normalizeAux p f\u271d) = fun p => normalizeAux p g\u271d\n\u03b8_ih\u271d : (fun p => normalizeAux p g\u271d) = fun p => normalizeAux p h\u271d\n\u22a2 (fun p => normalizeAux p f\u271d) = fun p => normalizeAux p h\u271d",
+              "tactic": "apply Eq.trans <;> assumption"
+            },
+            {
+              "annotated_tactic": [
+                "\"funext\"",
+                "[]"
+              ],
+              "state_after": "case mk.h.whisker_left.h\nB : Type u\ninst\u271d : Quiver B\na b c : B\nf g : Hom b c\na\u271d b\u271d c\u271d : FreeBicategory B\nf\u271d : a\u271d \u27f6 b\u271d\ng\u271d h\u271d : b\u271d \u27f6 c\u271d\n\u03b7\u271d : Hom\u2082 g\u271d h\u271d\nih : (fun p => normalizeAux p g\u271d) = fun p => normalizeAux p h\u271d\nx\u271d : Path a a\u271d\n\u22a2 normalizeAux x\u271d (f\u271d \u226b g\u271d) = normalizeAux x\u271d (f\u271d \u226b h\u271d)",
+              "state_before": "case mk.h.whisker_left\nB : Type u\ninst\u271d : Quiver B\na b c : B\nf g : Hom b c\na\u271d b\u271d c\u271d : FreeBicategory B\nf\u271d : a\u271d \u27f6 b\u271d\ng\u271d h\u271d : b\u271d \u27f6 c\u271d\n\u03b7\u271d : Hom\u2082 g\u271d h\u271d\nih : (fun p => normalizeAux p g\u271d) = fun p => normalizeAux p h\u271d\n\u22a2 (fun p => normalizeAux p (f\u271d \u226b g\u271d)) = fun p => normalizeAux p (f\u271d \u226b h\u271d)",
+              "tactic": "funext"
+            },
+            {
+              "annotated_tactic": [
+                "\"apply <a>congr_fun<\\/a> ih\"",
+                "[{\"full_name\":\"congr_fun\",\"def_path\":\".lake\\/packages\\/batteries\\/Batteries\\/Logic.lean\",\"def_pos\":[78,7],\"def_end_pos\":[78,16]}]"
+              ],
+              "state_after": "no goals",
+              "state_before": "case mk.h.whisker_left.h\nB : Type u\ninst\u271d : Quiver B\na b c : B\nf g : Hom b c\na\u271d b\u271d c\u271d : FreeBicategory B\nf\u271d : a\u271d \u27f6 b\u271d\ng\u271d h\u271d : b\u271d \u27f6 c\u271d\n\u03b7\u271d : Hom\u2082 g\u271d h\u271d\nih : (fun p => normalizeAux p g\u271d) = fun p => normalizeAux p h\u271d\nx\u271d : Path a a\u271d\n\u22a2 normalizeAux x\u271d (f\u271d \u226b g\u271d) = normalizeAux x\u271d (f\u271d \u226b h\u271d)",
+              "tactic": "apply congr_fun ih"
+            },
+            {
+              "annotated_tactic": [
+                "\"funext\"",
+                "[]"
+              ],
+              "state_after": "case mk.h.whisker_right.h\nB : Type u\ninst\u271d : Quiver B\na b c : B\nf g : Hom b c\na\u271d b\u271d c\u271d : FreeBicategory B\nf\u271d g\u271d : a\u271d \u27f6 b\u271d\nh\u271d : b\u271d \u27f6 c\u271d\n\u03b7\u271d : Hom\u2082 f\u271d g\u271d\nih : (fun p => normalizeAux p f\u271d) = fun p => normalizeAux p g\u271d\nx\u271d : Path a a\u271d\n\u22a2 normalizeAux x\u271d (Hom.comp f\u271d h\u271d) = normalizeAux x\u271d (Hom.comp g\u271d h\u271d)",
+              "state_before": "case mk.h.whisker_right\nB : Type u\ninst\u271d : Quiver B\na b c : B\nf g : Hom b c\na\u271d b\u271d c\u271d : FreeBicategory B\nf\u271d g\u271d : a\u271d \u27f6 b\u271d\nh\u271d : b\u271d \u27f6 c\u271d\n\u03b7\u271d : Hom\u2082 f\u271d g\u271d\nih : (fun p => normalizeAux p f\u271d) = fun p => normalizeAux p g\u271d\n\u22a2 (fun p => normalizeAux p (Hom.comp f\u271d h\u271d)) = fun p => normalizeAux p (Hom.comp g\u271d h\u271d)",
+              "tactic": "funext"
+            },
+            {
+              "annotated_tactic": [
+                "\"apply <a>congr_arg\\u2082<\\/a> _ (<a>congr_fun<\\/a> ih _) <a>rfl<\\/a>\"",
+                "[{\"full_name\":\"congr_arg\\u2082\",\"def_path\":\".lake\\/packages\\/batteries\\/Batteries\\/Logic.lean\",\"def_pos\":[77,7],\"def_end_pos\":[77,17]},{\"full_name\":\"congr_fun\",\"def_path\":\".lake\\/packages\\/batteries\\/Batteries\\/Logic.lean\",\"def_pos\":[78,7],\"def_end_pos\":[78,16]},{\"full_name\":\"rfl\",\"def_path\":\".lake\\/packages\\/lean4\\/src\\/lean\\/Init\\/Prelude.lean\",\"def_pos\":[294,22],\"def_end_pos\":[294,25]}]"
+              ],
+              "state_after": "no goals",
+              "state_before": "case mk.h.whisker_right.h\nB : Type u\ninst\u271d : Quiver B\na b c : B\nf g : Hom b c\na\u271d b\u271d c\u271d : FreeBicategory B\nf\u271d g\u271d : a\u271d \u27f6 b\u271d\nh\u271d : b\u271d \u27f6 c\u271d\n\u03b7\u271d : Hom\u2082 f\u271d g\u271d\nih : (fun p => normalizeAux p f\u271d) = fun p => normalizeAux p g\u271d\nx\u271d : Path a a\u271d\n\u22a2 normalizeAux x\u271d (Hom.comp f\u271d h\u271d) = normalizeAux x\u271d (Hom.comp g\u271d h\u271d)",
+              "tactic": "apply congr_arg\u2082 _ (congr_fun ih _) rfl"
+            },
+            {
+              "annotated_tactic": [
+                "\"funext\"",
+                "[]"
+              ],
+              "state_after": "case mk.h.left_unitor_inv.h\nB : Type u\ninst\u271d : Quiver B\na b c : B\nf g : Hom b c\na\u271d b\u271d : FreeBicategory B\nf\u271d : a\u271d \u27f6 b\u271d\nx\u271d : Path a a\u271d\n\u22a2 normalizeAux x\u271d f\u271d = normalizeAux x\u271d (\ud835\udfd9 a\u271d \u226b f\u271d)",
+              "state_before": "case mk.h.left_unitor_inv\nB : Type u\ninst\u271d : Quiver B\na b c : B\nf g : Hom b c\na\u271d b\u271d : FreeBicategory B\nf\u271d : a\u271d \u27f6 b\u271d\n\u22a2 (fun p => normalizeAux p f\u271d) = fun p => normalizeAux p (\ud835\udfd9 a\u271d \u226b f\u271d)",
+              "tactic": "funext"
+            },
+            {
+              "annotated_tactic": [
+                "\"rfl\"",
+                "[]"
+              ],
+              "state_after": "no goals",
+              "state_before": "case mk.h.left_unitor_inv.h\nB : Type u\ninst\u271d : Quiver B\na b c : B\nf g : Hom b c\na\u271d b\u271d : FreeBicategory B\nf\u271d : a\u271d \u27f6 b\u271d\nx\u271d : Path a a\u271d\n\u22a2 normalizeAux x\u271d f\u271d = normalizeAux x\u271d (\ud835\udfd9 a\u271d \u226b f\u271d)",
+              "tactic": "rfl"
+            }
+          ],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Coherence.lean"
+      },
+      {
+        "error": "no internal trace for tactic 'rfl'",
+        "full_name": "CategoryTheory.FreeBicategory.normalizeAux_nil_comp",
+        "id": "CategoryTheory.FreeBicategory.normalizeAux_nil_comp",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            193,
+            71
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Coherence.lean",
+          "full_name": "CategoryTheory.FreeBicategory.normalizeAux_nil_comp",
+          "start": [
+            188,
+            1
+          ],
+          "traced_tactics": [
+            {
+              "annotated_tactic": [
+                "\"induction g generalizing a with\\n  | <a>id<\\/a> => rfl\\n  | <a>of<\\/a> => rfl\\n  | <a>comp<\\/a> g _ ihf ihg => erw [ihg (f.comp g), ihf f, ihg g, <a>comp_assoc<\\/a>]\"",
+                "[{\"full_name\":\"CategoryTheory.FreeBicategory.Hom.id\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/Free.lean\",\"def_pos\":[52,5],\"def_end_pos\":[52,7]},{\"full_name\":\"CategoryTheory.FreeBicategory.Hom.of\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/Free.lean\",\"def_pos\":[51,5],\"def_end_pos\":[51,7]},{\"full_name\":\"CategoryTheory.FreeBicategory.Hom.comp\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/Free.lean\",\"def_pos\":[53,5],\"def_end_pos\":[53,9]},{\"full_name\":\"Quiver.Path.comp_assoc\",\"def_path\":\"Mathlib\\/Combinatorics\\/Quiver\\/Path.lean\",\"def_pos\":[111,9],\"def_end_pos\":[111,19]}]"
+              ],
+              "state_after": "no goals",
+              "state_before": "B : Type u\ninst\u271d : Quiver B\na b c : B\nf : Hom a b\ng : Hom b c\n\u22a2 normalizeAux nil (f.comp g) = (normalizeAux nil f).comp (normalizeAux nil g)",
+              "tactic": "induction g generalizing a with\n| id => rfl\n| of => rfl\n| comp g _ ihf ihg => erw [ihg (f.comp g), ihf f, ihg g, comp_assoc]"
+            },
+            {
+              "annotated_tactic": [
+                "\"rfl\"",
+                "[]"
+              ],
+              "state_after": "no goals",
+              "state_before": "case id\nB : Type u\ninst\u271d : Quiver B\nb c a\u271d a : B\nf : Hom a a\u271d\n\u22a2 normalizeAux nil (f.comp (Hom.id a\u271d)) = (normalizeAux nil f).comp (normalizeAux nil (Hom.id a\u271d))",
+              "tactic": "rfl"
+            },
+            {
+              "annotated_tactic": [
+                "\"rfl\"",
+                "[]"
+              ],
+              "state_after": "no goals",
+              "state_before": "case of\nB : Type u\ninst\u271d : Quiver B\nb c a\u271d b\u271d : B\nf\u271d : a\u271d \u27f6 b\u271d\na : B\nf : Hom a a\u271d\n\u22a2 normalizeAux nil (f.comp (Hom.of f\u271d)) = (normalizeAux nil f).comp (normalizeAux nil (Hom.of f\u271d))",
+              "tactic": "rfl"
+            },
+            {
+              "annotated_tactic": [
+                "\"erw [ihg (f.comp g), ihf f, ihg g, <a>comp_assoc<\\/a>]\"",
+                "[{\"full_name\":\"Quiver.Path.comp_assoc\",\"def_path\":\"Mathlib\\/Combinatorics\\/Quiver\\/Path.lean\",\"def_pos\":[111,9],\"def_end_pos\":[111,19]}]"
+              ],
+              "state_after": "no goals",
+              "state_before": "case comp\nB : Type u\ninst\u271d : Quiver B\nb c a\u271d b\u271d c\u271d : B\ng : Hom a\u271d b\u271d\ng\u271d : Hom b\u271d c\u271d\nihf : \u2200 {a : B} (f : Hom a a\u271d), normalizeAux nil (f.comp g) = (normalizeAux nil f).comp (normalizeAux nil g)\nihg : \u2200 {a : B} (f : Hom a b\u271d), normalizeAux nil (f.comp g\u271d) = (normalizeAux nil f).comp (normalizeAux nil g\u271d)\na : B\nf : Hom a a\u271d\n\u22a2 normalizeAux nil (f.comp (g.comp g\u271d)) = (normalizeAux nil f).comp (normalizeAux nil (g.comp g\u271d))",
+              "tactic": "erw [ihg (f.comp g), ihf f, ihg g, comp_assoc]"
+            }
+          ],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Coherence.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.FreeBicategory.preinclusion_obj",
+        "id": "CategoryTheory.FreeBicategory.preinclusion_obj",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            90,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Coherence.lean",
+          "full_name": "CategoryTheory.FreeBicategory.preinclusion_obj",
+          "start": [
+            89,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Coherence.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Bicategory.LeftExtension.w",
+        "id": "CategoryTheory.Bicategory.LeftExtension.w",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            74,
+            22
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Extension.lean",
+          "full_name": "CategoryTheory.Bicategory.LeftExtension.w",
+          "start": [
+            72,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Extension.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Bicategory.LeftExtension.whisker_extension",
+        "id": "CategoryTheory.Bicategory.LeftExtension.whisker_extension",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            98,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Extension.lean",
+          "full_name": "CategoryTheory.Bicategory.LeftExtension.whisker_extension",
+          "start": [
+            96,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Extension.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Bicategory.LeftExtension.whisker_unit",
+        "id": "CategoryTheory.Bicategory.LeftExtension.whisker_unit",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            103,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Extension.lean",
+          "full_name": "CategoryTheory.Bicategory.LeftExtension.whisker_unit",
+          "start": [
+            101,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Extension.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Bicategory.LeftLift.w",
+        "id": "CategoryTheory.Bicategory.LeftLift.w",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            165,
+            22
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Extension.lean",
+          "full_name": "CategoryTheory.Bicategory.LeftLift.w",
+          "start": [
+            163,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Extension.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Bicategory.LeftLift.whisker_lift",
+        "id": "CategoryTheory.Bicategory.LeftLift.whisker_lift",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            189,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Extension.lean",
+          "full_name": "CategoryTheory.Bicategory.LeftLift.whisker_lift",
+          "start": [
+            187,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Extension.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Bicategory.LeftLift.whisker_unit",
+        "id": "CategoryTheory.Bicategory.LeftLift.whisker_unit",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            194,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Extension.lean",
+          "full_name": "CategoryTheory.Bicategory.LeftLift.whisker_unit",
+          "start": [
+            192,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Extension.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Bicategory.RightExtension.w",
+        "id": "CategoryTheory.Bicategory.RightExtension.w",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            256,
+            24
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Extension.lean",
+          "full_name": "CategoryTheory.Bicategory.RightExtension.w",
+          "start": [
+            254,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Extension.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Bicategory.RightLift.w",
+        "id": "CategoryTheory.Bicategory.RightLift.w",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            301,
+            24
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Extension.lean",
+          "full_name": "CategoryTheory.Bicategory.RightLift.w",
+          "start": [
+            299,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Extension.lean"
+      }
+    ],
+    "input_proofs": 11,
+    "input_units": 2,
+    "proofs": 0,
+    "published_proofs": 0,
+    "published_transitions": 0,
+    "replay_failures": [],
+    "transitions": 0,
+    "validation_failures": [],
+    "validation_rejected_proofs": 0,
+    "zero_transition_proofs": 0
+  },
+  "shards": [],
+  "proof_ids": [],
+  "proof_keys": []
+}

manifests/batches/mathlib/000610.json

@@ -0,0 +1,376 @@
+{
+  "format": "leangpt-parquet-v2",
+  "batch": "mathlib/000610",
+  "batch_fingerprint": "146bf60f62379228cf35d1a033e9b72027e7d4a17af169eb2aa73b0c1cd965a7",
+  "evidence": {
+    "batch_fingerprint": "146bf60f62379228cf35d1a033e9b72027e7d4a17af169eb2aa73b0c1cd965a7",
+    "contamination_matches": [],
+    "failures": [
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.FreeBicategory.comp_def",
+        "id": "CategoryTheory.FreeBicategory.comp_def",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            251,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Free.lean",
+          "full_name": "CategoryTheory.FreeBicategory.comp_def",
+          "start": [
+            250,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Free.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.FreeBicategory.liftHom_comp",
+        "id": "CategoryTheory.FreeBicategory.liftHom_comp",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            319,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Free.lean",
+          "full_name": "CategoryTheory.FreeBicategory.liftHom_comp",
+          "start": [
+            317,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Free.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.FreeBicategory.liftHom_id",
+        "id": "CategoryTheory.FreeBicategory.liftHom_id",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            313,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Free.lean",
+          "full_name": "CategoryTheory.FreeBicategory.liftHom_id",
+          "start": [
+            312,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Free.lean"
+      },
+      {
+        "error": "no internal trace for tactic 'dsimp [liftHom\u2082]'",
+        "full_name": "CategoryTheory.FreeBicategory.liftHom\u2082_congr",
+        "id": "CategoryTheory.FreeBicategory.liftHom\u2082_congr",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            347,
+            84
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Free.lean",
+          "full_name": "CategoryTheory.FreeBicategory.liftHom\u2082_congr",
+          "start": [
+            346,
+            1
+          ],
+          "traced_tactics": [
+            {
+              "annotated_tactic": [
+                "\"induction H <;> (dsimp [<a>liftHom\\u2082<\\/a>]; aesop_cat)\"",
+                "[{\"full_name\":\"CategoryTheory.FreeBicategory.liftHom\\u2082\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/Free.lean\",\"def_pos\":[331,5],\"def_end_pos\":[331,13]}]"
+              ],
+              "state_after": "no goals",
+              "state_before": "B : Type u\u2081\ninst\u271d\u00b9 : Quiver B\nC : Type u\u2082\ninst\u271d : Bicategory C\nF : B \u2964q C\na b : FreeBicategory B\nf g : a \u27f6 b\n\u03b7 \u03b8 : Hom\u2082 f g\nH : Rel \u03b7 \u03b8\n\u22a2 liftHom\u2082 F \u03b7 = liftHom\u2082 F \u03b8",
+              "tactic": "induction H <;> (dsimp [liftHom\u2082]; aesop_cat)"
+            },
+            {
+              "annotated_tactic": [
+                "\"dsimp [<a>liftHom\\u2082<\\/a>]\"",
+                "[{\"full_name\":\"CategoryTheory.FreeBicategory.liftHom\\u2082\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/Free.lean\",\"def_pos\":[331,5],\"def_end_pos\":[331,13]}]"
+              ],
+              "state_after": "case triangle\nB : Type u\u2081\ninst\u271d\u00b9 : Quiver B\nC : Type u\u2082\ninst\u271d : Bicategory C\nF : B \u2964q C\na b : FreeBicategory B\nf g : a \u27f6 b\n\u03b7 \u03b8 : Hom\u2082 f g\na\u271d b\u271d c\u271d : B\nf\u271d : Hom a\u271d b\u271d\ng\u271d : Hom b\u271d c\u271d\n\u22a2 (\u03b1_ (liftHom F f\u271d) (\ud835\udfd9 (F.obj b\u271d)) (liftHom F g\u271d)).hom \u226b liftHom F f\u271d \u25c1 (\u03bb_ (liftHom F g\u271d)).hom =\n    (\u03c1_ (liftHom F f\u271d)).hom \u25b7 liftHom F g\u271d",
+              "state_before": "case triangle\nB : Type u\u2081\ninst\u271d\u00b9 : Quiver B\nC : Type u\u2082\ninst\u271d : Bicategory C\nF : B \u2964q C\na b : FreeBicategory B\nf g : a \u27f6 b\n\u03b7 \u03b8 : Hom\u2082 f g\na\u271d b\u271d c\u271d : B\nf\u271d : Hom a\u271d b\u271d\ng\u271d : Hom b\u271d c\u271d\n\u22a2 liftHom\u2082 F ((Hom\u2082.associator f\u271d (Hom.id b\u271d) g\u271d).vcomp (Hom\u2082.whisker_left f\u271d (Hom\u2082.left_unitor g\u271d))) =\n    liftHom\u2082 F (Hom\u2082.whisker_right g\u271d (Hom\u2082.right_unitor f\u271d))",
+              "tactic": "dsimp [liftHom\u2082]"
+            },
+            {
+              "annotated_tactic": [
+                "\"aesop_cat\"",
+                "[]"
+              ],
+              "state_after": "no goals",
+              "state_before": "case triangle\nB : Type u\u2081\ninst\u271d\u00b9 : Quiver B\nC : Type u\u2082\ninst\u271d : Bicategory C\nF : B \u2964q C\na b : FreeBicategory B\nf g : a \u27f6 b\n\u03b7 \u03b8 : Hom\u2082 f g\na\u271d b\u271d c\u271d : B\nf\u271d : Hom a\u271d b\u271d\ng\u271d : Hom b\u271d c\u271d\n\u22a2 (\u03b1_ (liftHom F f\u271d) (\ud835\udfd9 (F.obj b\u271d)) (liftHom F g\u271d)).hom \u226b liftHom F f\u271d \u25c1 (\u03bb_ (liftHom F g\u271d)).hom =\n    (\u03c1_ (liftHom F f\u271d)).hom \u25b7 liftHom F g\u271d",
+              "tactic": "aesop_cat"
+            }
+          ],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Free.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.FreeBicategory.mk_associator_hom",
+        "id": "CategoryTheory.FreeBicategory.mk_associator_hom",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            261,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Free.lean",
+          "full_name": "CategoryTheory.FreeBicategory.mk_associator_hom",
+          "start": [
+            260,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Free.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.FreeBicategory.mk_associator_inv",
+        "id": "CategoryTheory.FreeBicategory.mk_associator_inv",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            266,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Free.lean",
+          "full_name": "CategoryTheory.FreeBicategory.mk_associator_inv",
+          "start": [
+            265,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Free.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.FreeBicategory.mk_id",
+        "id": "CategoryTheory.FreeBicategory.mk_id",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            256,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Free.lean",
+          "full_name": "CategoryTheory.FreeBicategory.mk_id",
+          "start": [
+            255,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Free.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.FreeBicategory.mk_left_unitor_hom",
+        "id": "CategoryTheory.FreeBicategory.mk_left_unitor_hom",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            271,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Free.lean",
+          "full_name": "CategoryTheory.FreeBicategory.mk_left_unitor_hom",
+          "start": [
+            270,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Free.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.FreeBicategory.mk_left_unitor_inv",
+        "id": "CategoryTheory.FreeBicategory.mk_left_unitor_inv",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            276,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Free.lean",
+          "full_name": "CategoryTheory.FreeBicategory.mk_left_unitor_inv",
+          "start": [
+            275,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Free.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.FreeBicategory.mk_right_unitor_hom",
+        "id": "CategoryTheory.FreeBicategory.mk_right_unitor_hom",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            281,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Free.lean",
+          "full_name": "CategoryTheory.FreeBicategory.mk_right_unitor_hom",
+          "start": [
+            280,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Free.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.FreeBicategory.mk_right_unitor_inv",
+        "id": "CategoryTheory.FreeBicategory.mk_right_unitor_inv",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            286,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Free.lean",
+          "full_name": "CategoryTheory.FreeBicategory.mk_right_unitor_inv",
+          "start": [
+            285,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Free.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.FreeBicategory.mk_vcomp",
+        "id": "CategoryTheory.FreeBicategory.mk_vcomp",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            227,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Free.lean",
+          "full_name": "CategoryTheory.FreeBicategory.mk_vcomp",
+          "start": [
+            225,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Free.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.FreeBicategory.mk_whisker_left",
+        "id": "CategoryTheory.FreeBicategory.mk_whisker_left",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            233,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Free.lean",
+          "full_name": "CategoryTheory.FreeBicategory.mk_whisker_left",
+          "start": [
+            231,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Free.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.FreeBicategory.mk_whisker_right",
+        "id": "CategoryTheory.FreeBicategory.mk_whisker_right",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            239,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Free.lean",
+          "full_name": "CategoryTheory.FreeBicategory.mk_whisker_right",
+          "start": [
+            237,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Free.lean"
+      }
+    ],
+    "input_proofs": 17,
+    "input_units": 2,
+    "proofs": 3,
+    "published_proofs": 3,
+    "published_transitions": 4,
+    "replay_failures": [],
+    "transitions": 4,
+    "validation_failures": [],
+    "validation_rejected_proofs": 0,
+    "zero_transition_proofs": 0
+  },
+  "shards": [
+    {
+      "path": "data/train/mathlib-000610-0000-8a6385cacf8046d0.parquet",
+      "sha256": "8a6385cacf8046d0c6188b9685967d8284cd6cca2d52603ff438dd9a457b181e",
+      "bytes": 56635,
+      "rows": 4,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    }
+  ],
+  "proof_ids": [
+    "mathlib:CategoryTheory.OplaxFunctor.map\u2082_hom_inv",
+    "mathlib:CategoryTheory.OplaxFunctor.map\u2082_inv",
+    "mathlib:CategoryTheory.OplaxFunctor.map\u2082_inv_hom"
+  ],
+  "proof_keys": [
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Bicategory/Functor/Oplax.lean\",null,null,\"CategoryTheory.OplaxFunctor.map\u2082_hom_inv\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Bicategory/Functor/Oplax.lean\",null,null,\"CategoryTheory.OplaxFunctor.map\u2082_inv\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Bicategory/Functor/Oplax.lean\",null,null,\"CategoryTheory.OplaxFunctor.map\u2082_inv_hom\"]"
+  ]
+}

manifests/batches/mathlib/000611.json

@@ -0,0 +1,194 @@
+{
+  "format": "leangpt-parquet-v2",
+  "batch": "mathlib/000611",
+  "batch_fingerprint": "6a1004fffb7488e0c50f2c70c2a3df7f1bce858c5692fe1d80cab67e9420f833",
+  "evidence": {
+    "batch_fingerprint": "6a1004fffb7488e0c50f2c70c2a3df7f1bce858c5692fe1d80cab67e9420f833",
+    "contamination_matches": [],
+    "failures": [
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Pseudofunctor.to_oplax_mapComp",
+        "id": "CategoryTheory.Pseudofunctor.to_oplax_mapComp",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            196,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Functor/Pseudofunctor.lean",
+          "full_name": "CategoryTheory.Pseudofunctor.to_oplax_mapComp",
+          "start": [
+            194,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Functor/Pseudofunctor.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Pseudofunctor.to_oplax_mapId",
+        "id": "CategoryTheory.Pseudofunctor.to_oplax_mapId",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            190,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Functor/Pseudofunctor.lean",
+          "full_name": "CategoryTheory.Pseudofunctor.to_oplax_mapId",
+          "start": [
+            189,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Functor/Pseudofunctor.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Pseudofunctor.to_oplax_obj",
+        "id": "CategoryTheory.Pseudofunctor.to_oplax_obj",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            177,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Functor/Pseudofunctor.lean",
+          "full_name": "CategoryTheory.Pseudofunctor.to_oplax_obj",
+          "start": [
+            176,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Functor/Pseudofunctor.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Bicategory.LeftExtension.IsKan.fac",
+        "id": "CategoryTheory.Bicategory.LeftExtension.IsKan.fac",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            75,
+            38
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Kan/IsKan.lean",
+          "full_name": "CategoryTheory.Bicategory.LeftExtension.IsKan.fac",
+          "start": [
+            73,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Kan/IsKan.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Bicategory.LeftExtension.IsKan.hom_ext",
+        "id": "CategoryTheory.Bicategory.LeftExtension.IsKan.hom_ext",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            81,
+            42
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Kan/IsKan.lean",
+          "full_name": "CategoryTheory.Bicategory.LeftExtension.IsKan.hom_ext",
+          "start": [
+            79,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Kan/IsKan.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Bicategory.LeftLift.IsKan.fac",
+        "id": "CategoryTheory.Bicategory.LeftLift.IsKan.fac",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            137,
+            38
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Kan/IsKan.lean",
+          "full_name": "CategoryTheory.Bicategory.LeftLift.IsKan.fac",
+          "start": [
+            135,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Kan/IsKan.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.Bicategory.LeftLift.IsKan.hom_ext",
+        "id": "CategoryTheory.Bicategory.LeftLift.IsKan.hom_ext",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            143,
+            42
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/Kan/IsKan.lean",
+          "full_name": "CategoryTheory.Bicategory.LeftLift.IsKan.hom_ext",
+          "start": [
+            141,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/Kan/IsKan.lean"
+      }
+    ],
+    "input_proofs": 10,
+    "input_units": 2,
+    "proofs": 3,
+    "published_proofs": 3,
+    "published_transitions": 4,
+    "replay_failures": [],
+    "transitions": 4,
+    "validation_failures": [],
+    "validation_rejected_proofs": 0,
+    "zero_transition_proofs": 0
+  },
+  "shards": [
+    {
+      "path": "data/train/mathlib-000611-0000-e8a48fa47d8206dd.parquet",
+      "sha256": "e8a48fa47d8206dd186fb3e7bfc0b9c327d9f8f925bc7a551a741f50ad4d7f24",
+      "bytes": 56659,
+      "rows": 4,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    }
+  ],
+  "proof_ids": [
+    "mathlib:CategoryTheory.Pseudofunctor.map\u2082_hom_inv",
+    "mathlib:CategoryTheory.Pseudofunctor.map\u2082_inv",
+    "mathlib:CategoryTheory.Pseudofunctor.map\u2082_inv_hom"
+  ],
+  "proof_keys": [
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Bicategory/Functor/Pseudofunctor.lean\",null,null,\"CategoryTheory.Pseudofunctor.map\u2082_hom_inv\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Bicategory/Functor/Pseudofunctor.lean\",null,null,\"CategoryTheory.Pseudofunctor.map\u2082_inv\"]",
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Bicategory/Functor/Pseudofunctor.lean\",null,null,\"CategoryTheory.Pseudofunctor.map\u2082_inv_hom\"]"
+  ]
+}

manifests/batches/mathlib/000612.json

@@ -0,0 +1,525 @@
+{
+  "format": "leangpt-parquet-v2",
+  "batch": "mathlib/000612",
+  "batch_fingerprint": "03d1a8b069e5b1035b5619641ce2d5dcc6e9ababdc4258ae08a61141b56aa2d5",
+  "evidence": {
+    "batch_fingerprint": "03d1a8b069e5b1035b5619641ce2d5dcc6e9ababdc4258ae08a61141b56aa2d5",
+    "contamination_matches": [],
+    "failures": [
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.LocallyDiscrete.comp_as",
+        "id": "CategoryTheory.LocallyDiscrete.comp_as",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            76,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/LocallyDiscrete.lean",
+          "full_name": "CategoryTheory.LocallyDiscrete.comp_as",
+          "start": [
+            74,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/LocallyDiscrete.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.LocallyDiscrete.eq_of_hom",
+        "id": "CategoryTheory.LocallyDiscrete.eq_of_hom",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            88,
+            25
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/LocallyDiscrete.lean",
+          "full_name": "CategoryTheory.LocallyDiscrete.eq_of_hom",
+          "start": [
+            87,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/LocallyDiscrete.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.LocallyDiscrete.id_as",
+        "id": "CategoryTheory.LocallyDiscrete.id_as",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            72,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/LocallyDiscrete.lean",
+          "full_name": "CategoryTheory.LocallyDiscrete.id_as",
+          "start": [
+            70,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/LocallyDiscrete.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "CategoryTheory.LocallyDiscrete.mk_as",
+        "id": "CategoryTheory.LocallyDiscrete.mk_as",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            47,
+            59
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/LocallyDiscrete.lean",
+          "full_name": "CategoryTheory.LocallyDiscrete.mk_as",
+          "start": [
+            47,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/LocallyDiscrete.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "Quiver.Hom.comp_toLoc",
+        "id": "Quiver.Hom.comp_toLoc",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            178,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/LocallyDiscrete.lean",
+          "full_name": "Quiver.Hom.comp_toLoc",
+          "start": [
+            176,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/LocallyDiscrete.lean"
+      },
+      {
+        "error": "theorem has no selected tactic transitions",
+        "full_name": "Quiver.Hom.id_toLoc",
+        "id": "Quiver.Hom.id_toLoc",
+        "reason": "import_failure",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            174,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/LocallyDiscrete.lean",
+          "full_name": "Quiver.Hom.id_toLoc",
+          "start": [
+            172,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/LocallyDiscrete.lean"
+      },
+      {
+        "full_name": "CategoryTheory.OplaxNatTrans.Modification.comp_app'",
+        "id": "CategoryTheory.OplaxNatTrans.Modification.comp_app'",
+        "reason": "missing_trace",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            291,
+            6
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/NaturalTransformation.lean",
+          "full_name": "CategoryTheory.OplaxNatTrans.Modification.comp_app'",
+          "start": [
+            288,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/NaturalTransformation.lean"
+      },
+      {
+        "full_name": "CategoryTheory.OplaxNatTrans.Modification.id_app'",
+        "id": "CategoryTheory.OplaxNatTrans.Modification.id_app'",
+        "reason": "missing_trace",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            286,
+            50
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/NaturalTransformation.lean",
+          "full_name": "CategoryTheory.OplaxNatTrans.Modification.id_app'",
+          "start": [
+            284,
+            1
+          ],
+          "traced_tactics": [],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/NaturalTransformation.lean"
+      },
+      {
+        "full_name": "CategoryTheory.OplaxNatTrans.Modification.whiskerLeft_naturality",
+        "id": "CategoryTheory.OplaxNatTrans.Modification.whiskerLeft_naturality",
+        "reason": "missing_trace",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            248,
+            43
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/NaturalTransformation.lean",
+          "full_name": "CategoryTheory.OplaxNatTrans.Modification.whiskerLeft_naturality",
+          "start": [
+            246,
+            1
+          ],
+          "traced_tactics": [
+            {
+              "annotated_tactic": [
+                "\"simp_rw [\\u2190 <a>whiskerLeft_comp<\\/a>, <a>naturality<\\/a>]\"",
+                "[{\"full_name\":\"CategoryTheory.Bicategory.whiskerLeft_comp\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/Basic.lean\",\"def_pos\":[75,3],\"def_end_pos\":[75,19]},{\"full_name\":\"CategoryTheory.OplaxNatTrans.Modification.naturality\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/NaturalTransformation.lean\",\"def_pos\":[208,3],\"def_end_pos\":[208,13]}]"
+              ],
+              "state_after": "no goals",
+              "state_before": "B : Type u\u2081\ninst\u271d\u00b9 : Bicategory B\nC : Type u\u2082\ninst\u271d : Bicategory C\nF G : OplaxFunctor B C\n\u03b7 \u03b8 \u03b9 : F \u27f6 G\n\u0393 : Modification \u03b7 \u03b8\na b c : B\na' : C\nf : a' \u27f6 (\u2191F.toPrelaxFunctor).obj b\ng : b \u27f6 c\n\u22a2 f \u25c1 (\u2191F.toPrelaxFunctor).map g \u25c1 \u0393.app c \u226b f \u25c1 \u03b8.naturality g =\n    f \u25c1 \u03b7.naturality g \u226b f \u25c1 \u0393.app b \u25b7 (\u2191G.toPrelaxFunctor).map g",
+              "tactic": "simp_rw [\u2190 whiskerLeft_comp, naturality]"
+            }
+          ],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/NaturalTransformation.lean"
+      },
+      {
+        "full_name": "CategoryTheory.OplaxNatTrans.Modification.whiskerRight_naturality",
+        "id": "CategoryTheory.OplaxNatTrans.Modification.whiskerRight_naturality",
+        "reason": "missing_trace",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            255,
+            84
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/NaturalTransformation.lean",
+          "full_name": "CategoryTheory.OplaxNatTrans.Modification.whiskerRight_naturality",
+          "start": [
+            252,
+            1
+          ],
+          "traced_tactics": [
+            {
+              "annotated_tactic": [
+                "\"simp_rw [<a>associator_inv_naturality_middle_assoc<\\/a>, \\u2190 <a>comp_whiskerRight<\\/a>, <a>naturality<\\/a>]\"",
+                "[{\"full_name\":\"CategoryTheory.Bicategory.associator_inv_naturality_middle_assoc\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/Basic.lean\",\"def_pos\":[358,3],\"def_end_pos\":[358,10]},{\"full_name\":\"CategoryTheory.Bicategory.comp_whiskerRight\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/Basic.lean\",\"def_pos\":[91,3],\"def_end_pos\":[91,20]},{\"full_name\":\"CategoryTheory.OplaxNatTrans.Modification.naturality\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/NaturalTransformation.lean\",\"def_pos\":[208,3],\"def_end_pos\":[208,13]}]"
+              ],
+              "state_after": "no goals",
+              "state_before": "B : Type u\u2081\ninst\u271d\u00b9 : Bicategory B\nC : Type u\u2082\ninst\u271d : Bicategory C\nF G : OplaxFunctor B C\n\u03b7 \u03b8 \u03b9 : F \u27f6 G\n\u0393 : Modification \u03b7 \u03b8\na b c : B\na' : C\nf : a \u27f6 b\ng : (\u2191G.toPrelaxFunctor).obj b \u27f6 a'\n\u22a2 (\u2191F.toPrelaxFunctor).map f \u25c1 \u0393.app b \u25b7 g \u226b (\u03b1_ ((\u2191F.toPrelaxFunctor).map f) (\u03b8.app b) g).inv \u226b \u03b8.naturality f \u25b7 g =\n    (\u03b1_ ((\u2191F.toPrelaxFunctor).map f) (\u03b7.app b) g).inv \u226b \u03b7.naturality f \u25b7 g \u226b \u0393.app a \u25b7 (\u2191G.toPrelaxFunctor).map f \u25b7 g",
+              "tactic": "simp_rw [associator_inv_naturality_middle_assoc, \u2190 comp_whiskerRight, naturality]"
+            }
+          ],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/NaturalTransformation.lean"
+      },
+      {
+        "full_name": "CategoryTheory.OplaxNatTrans.ext",
+        "id": "CategoryTheory.OplaxNatTrans.ext",
+        "reason": "missing_trace",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            282,
+            10
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/NaturalTransformation.lean",
+          "full_name": "CategoryTheory.OplaxNatTrans.ext",
+          "start": [
+            277,
+            1
+          ],
+          "traced_tactics": [
+            {
+              "annotated_tactic": [
+                "\"apply <a>Modification.ext<\\/a>\"",
+                "[{\"full_name\":\"CategoryTheory.OplaxNatTrans.Modification.ext\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/NaturalTransformation.lean\",\"def_pos\":[205,3],\"def_end_pos\":[205,6]}]"
+              ],
+              "state_after": "case app\nB : Type u\u2081\ninst\u271d\u00b9 : Bicategory B\nC : Type u\u2082\ninst\u271d : Bicategory C\nF\u271d G\u271d : OplaxFunctor B C\n\u03b7 \u03b8 \u03b9 : F\u271d \u27f6 G\u271d\nF G : OplaxFunctor B C\n\u03b1 \u03b2 : F \u27f6 G\nm n : \u03b1 \u27f6 \u03b2\nw : \u2200 (b : B), m.app b = n.app b\n\u22a2 m.app = n.app",
+              "state_before": "B : Type u\u2081\ninst\u271d\u00b9 : Bicategory B\nC : Type u\u2082\ninst\u271d : Bicategory C\nF\u271d G\u271d : OplaxFunctor B C\n\u03b7 \u03b8 \u03b9 : F\u271d \u27f6 G\u271d\nF G : OplaxFunctor B C\n\u03b1 \u03b2 : F \u27f6 G\nm n : \u03b1 \u27f6 \u03b2\nw : \u2200 (b : B), m.app b = n.app b\n\u22a2 m = n",
+              "tactic": "apply Modification.ext"
+            },
+            {
+              "annotated_tactic": [
+                "\"ext\"",
+                "[]"
+              ],
+              "state_after": "case app.h\nB : Type u\u2081\ninst\u271d\u00b9 : Bicategory B\nC : Type u\u2082\ninst\u271d : Bicategory C\nF\u271d G\u271d : OplaxFunctor B C\n\u03b7 \u03b8 \u03b9 : F\u271d \u27f6 G\u271d\nF G : OplaxFunctor B C\n\u03b1 \u03b2 : F \u27f6 G\nm n : \u03b1 \u27f6 \u03b2\nw : \u2200 (b : B), m.app b = n.app b\nx\u271d : B\n\u22a2 m.app x\u271d = n.app x\u271d",
+              "state_before": "case app\nB : Type u\u2081\ninst\u271d\u00b9 : Bicategory B\nC : Type u\u2082\ninst\u271d : Bicategory C\nF\u271d G\u271d : OplaxFunctor B C\n\u03b7 \u03b8 \u03b9 : F\u271d \u27f6 G\u271d\nF G : OplaxFunctor B C\n\u03b1 \u03b2 : F \u27f6 G\nm n : \u03b1 \u27f6 \u03b2\nw : \u2200 (b : B), m.app b = n.app b\n\u22a2 m.app = n.app",
+              "tactic": "ext"
+            },
+            {
+              "annotated_tactic": [
+                "\"apply w\"",
+                "[]"
+              ],
+              "state_after": "no goals",
+              "state_before": "case app.h\nB : Type u\u2081\ninst\u271d\u00b9 : Bicategory B\nC : Type u\u2082\ninst\u271d : Bicategory C\nF\u271d G\u271d : OplaxFunctor B C\n\u03b7 \u03b8 \u03b9 : F\u271d \u27f6 G\u271d\nF G : OplaxFunctor B C\n\u03b1 \u03b2 : F \u27f6 G\nm n : \u03b1 \u27f6 \u03b2\nw : \u2200 (b : B), m.app b = n.app b\nx\u271d : B\n\u22a2 m.app x\u271d = n.app x\u271d",
+              "tactic": "apply w"
+            }
+          ],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/NaturalTransformation.lean"
+      },
+      {
+        "full_name": "CategoryTheory.OplaxNatTrans.whiskerLeft_naturality_comp",
+        "id": "CategoryTheory.OplaxNatTrans.whiskerLeft_naturality_comp",
+        "reason": "missing_trace",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            124,
+            48
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/NaturalTransformation.lean",
+          "full_name": "CategoryTheory.OplaxNatTrans.whiskerLeft_naturality_comp",
+          "start": [
+            118,
+            1
+          ],
+          "traced_tactics": [
+            {
+              "annotated_tactic": [
+                "\"simp_rw [\\u2190 <a>whiskerLeft_comp<\\/a>, <a>naturality_comp<\\/a>]\"",
+                "[{\"full_name\":\"CategoryTheory.Bicategory.whiskerLeft_comp\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/Basic.lean\",\"def_pos\":[75,3],\"def_end_pos\":[75,19]},{\"full_name\":\"CategoryTheory.OplaxNatTrans.naturality_comp\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/NaturalTransformation.lean\",\"def_pos\":[55,3],\"def_end_pos\":[55,18]}]"
+              ],
+              "state_after": "no goals",
+              "state_before": "B : Type u\u2081\ninst\u271d\u00b9 : Bicategory B\nC : Type u\u2082\ninst\u271d : Bicategory C\nF G H : OplaxFunctor B C\n\u03b7 : OplaxNatTrans F G\n\u03b8 : OplaxNatTrans G H\na b c : B\na' : C\nf : a' \u27f6 (\u2191G.toPrelaxFunctor).obj a\ng : a \u27f6 b\nh : b \u27f6 c\n\u22a2 f \u25c1 \u03b8.naturality (g \u226b h) \u226b f \u25c1 \u03b8.app a \u25c1 H.mapComp g h =\n    f \u25c1 G.mapComp g h \u25b7 \u03b8.app c \u226b\n      f \u25c1 (\u03b1_ ((\u2191G.toPrelaxFunctor).map g) ((\u2191G.toPrelaxFunctor).map h) (\u03b8.app c)).hom \u226b\n        f \u25c1 (\u2191G.toPrelaxFunctor).map g \u25c1 \u03b8.naturality h \u226b\n          f \u25c1 (\u03b1_ ((\u2191G.toPrelaxFunctor).map g) (\u03b8.app b) ((\u2191H.toPrelaxFunctor).map h)).inv \u226b\n            f \u25c1 \u03b8.naturality g \u25b7 (\u2191H.toPrelaxFunctor).map h \u226b\n              f \u25c1 (\u03b1_ (\u03b8.app a) ((\u2191H.toPrelaxFunctor).map g) ((\u2191H.toPrelaxFunctor).map h)).hom",
+              "tactic": "simp_rw [\u2190 whiskerLeft_comp, naturality_comp]"
+            }
+          ],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/NaturalTransformation.lean"
+      },
+      {
+        "full_name": "CategoryTheory.OplaxNatTrans.whiskerLeft_naturality_id",
+        "id": "CategoryTheory.OplaxNatTrans.whiskerLeft_naturality_id",
+        "reason": "missing_trace",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            144,
+            46
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/NaturalTransformation.lean",
+          "full_name": "CategoryTheory.OplaxNatTrans.whiskerLeft_naturality_id",
+          "start": [
+            141,
+            1
+          ],
+          "traced_tactics": [
+            {
+              "annotated_tactic": [
+                "\"simp_rw [\\u2190 <a>whiskerLeft_comp<\\/a>, <a>naturality_id<\\/a>]\"",
+                "[{\"full_name\":\"CategoryTheory.Bicategory.whiskerLeft_comp\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/Basic.lean\",\"def_pos\":[75,3],\"def_end_pos\":[75,19]},{\"full_name\":\"CategoryTheory.OplaxNatTrans.naturality_id\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/NaturalTransformation.lean\",\"def_pos\":[50,3],\"def_end_pos\":[50,16]}]"
+              ],
+              "state_after": "no goals",
+              "state_before": "B : Type u\u2081\ninst\u271d\u00b9 : Bicategory B\nC : Type u\u2082\ninst\u271d : Bicategory C\nF G H : OplaxFunctor B C\n\u03b7 : OplaxNatTrans F G\n\u03b8 : OplaxNatTrans G H\na b c : B\na' : C\nf : a' \u27f6 (\u2191G.toPrelaxFunctor).obj a\n\u22a2 f \u25c1 \u03b8.naturality (\ud835\udfd9 a) \u226b f \u25c1 \u03b8.app a \u25c1 H.mapId a =\n    f \u25c1 G.mapId a \u25b7 \u03b8.app a \u226b f \u25c1 (\u03bb_ (\u03b8.app a)).hom \u226b f \u25c1 (\u03c1_ (\u03b8.app a)).inv",
+              "tactic": "simp_rw [\u2190 whiskerLeft_comp, naturality_id]"
+            }
+          ],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/NaturalTransformation.lean"
+      },
+      {
+        "full_name": "CategoryTheory.OplaxNatTrans.whiskerLeft_naturality_naturality",
+        "id": "CategoryTheory.OplaxNatTrans.whiskerLeft_naturality_naturality",
+        "reason": "missing_trace",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            107,
+            54
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/NaturalTransformation.lean",
+          "full_name": "CategoryTheory.OplaxNatTrans.whiskerLeft_naturality_naturality",
+          "start": [
+            104,
+            1
+          ],
+          "traced_tactics": [
+            {
+              "annotated_tactic": [
+                "\"simp_rw [\\u2190 <a>whiskerLeft_comp<\\/a>, <a>naturality_naturality<\\/a>]\"",
+                "[{\"full_name\":\"CategoryTheory.Bicategory.whiskerLeft_comp\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/Basic.lean\",\"def_pos\":[75,3],\"def_end_pos\":[75,19]},{\"full_name\":\"CategoryTheory.OplaxNatTrans.naturality_naturality\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/NaturalTransformation.lean\",\"def_pos\":[46,3],\"def_end_pos\":[46,24]}]"
+              ],
+              "state_after": "no goals",
+              "state_before": "B : Type u\u2081\ninst\u271d\u00b9 : Bicategory B\nC : Type u\u2082\ninst\u271d : Bicategory C\nF G H : OplaxFunctor B C\n\u03b7 : OplaxNatTrans F G\n\u03b8 : OplaxNatTrans G H\na b c : B\na' : C\nf : a' \u27f6 (\u2191G.toPrelaxFunctor).obj a\ng h : a \u27f6 b\n\u03b2 : g \u27f6 h\n\u22a2 f \u25c1 G.map\u2082 \u03b2 \u25b7 \u03b8.app b \u226b f \u25c1 \u03b8.naturality h = f \u25c1 \u03b8.naturality g \u226b f \u25c1 \u03b8.app a \u25c1 H.map\u2082 \u03b2",
+              "tactic": "simp_rw [\u2190 whiskerLeft_comp, naturality_naturality]"
+            }
+          ],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/NaturalTransformation.lean"
+      },
+      {
+        "full_name": "CategoryTheory.OplaxNatTrans.whiskerRight_naturality_comp",
+        "id": "CategoryTheory.OplaxNatTrans.whiskerRight_naturality_comp",
+        "reason": "missing_trace",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            137,
+            88
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/NaturalTransformation.lean",
+          "full_name": "CategoryTheory.OplaxNatTrans.whiskerRight_naturality_comp",
+          "start": [
+            128,
+            1
+          ],
+          "traced_tactics": [
+            {
+              "annotated_tactic": [
+                "\"rw [\\u2190 <a>associator_naturality_middle<\\/a>, \\u2190 <a>comp_whiskerRight_assoc<\\/a>, <a>naturality_comp<\\/a>]\"",
+                "[{\"full_name\":\"CategoryTheory.Bicategory.associator_naturality_middle\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/Basic.lean\",\"def_pos\":[354,9],\"def_end_pos\":[354,37]},{\"full_name\":\"CategoryTheory.Bicategory.comp_whiskerRight_assoc\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/Basic.lean\",\"def_pos\":[177,12],\"def_end_pos\":[177,19]},{\"full_name\":\"CategoryTheory.OplaxNatTrans.naturality_comp\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/NaturalTransformation.lean\",\"def_pos\":[55,3],\"def_end_pos\":[55,18]}]"
+              ],
+              "state_after": "B : Type u\u2081\ninst\u271d\u00b9 : Bicategory B\nC : Type u\u2082\ninst\u271d : Bicategory C\nF G H : OplaxFunctor B C\n\u03b7 : OplaxNatTrans F G\n\u03b8 : OplaxNatTrans G H\na b c : B\na' : C\nf : a \u27f6 b\ng : b \u27f6 c\nh : (\u2191G.toPrelaxFunctor).obj c \u27f6 a'\n\u22a2 (F.mapComp f g \u25b7 \u03b7.app c \u226b\n          (\u03b1_ ((\u2191F.toPrelaxFunctor).map f) ((\u2191F.toPrelaxFunctor).map g) (\u03b7.app c)).hom \u226b\n            (\u2191F.toPrelaxFunctor).map f \u25c1 \u03b7.naturality g \u226b\n              (\u03b1_ ((\u2191F.toPrelaxFunctor).map f) (\u03b7.app b) ((\u2191G.toPrelaxFunctor).map g)).inv \u226b\n                \u03b7.naturality f \u25b7 (\u2191G.toPrelaxFunctor).map g \u226b\n                  (\u03b1_ (\u03b7.app a) ((\u2191G.toPrelaxFunctor).map f) ((\u2191G.toPrelaxFunctor).map g)).hom) \u25b7\n        h \u226b\n      (\u03b1_ (\u03b7.app a) ((\u2191G.toPrelaxFunctor).map f \u226b (\u2191G.toPrelaxFunctor).map g) h).hom =\n    F.mapComp f g \u25b7 \u03b7.app c \u25b7 h \u226b\n      (\u03b1_ ((\u2191F.toPrelaxFunctor).map f) ((\u2191F.toPrelaxFunctor).map g) (\u03b7.app c)).hom \u25b7 h \u226b\n        (\u03b1_ ((\u2191F.toPrelaxFunctor).map f) ((\u2191F.toPrelaxFunctor).map g \u226b \u03b7.app c) h).hom \u226b\n          (\u2191F.toPrelaxFunctor).map f \u25c1 \u03b7.naturality g \u25b7 h \u226b\n            (\u03b1_ ((\u2191F.toPrelaxFunctor).map f) (\u03b7.app b \u226b (\u2191G.toPrelaxFunctor).map g) h).inv \u226b\n              (\u03b1_ ((\u2191F.toPrelaxFunctor).map f) (\u03b7.app b) ((\u2191G.toPrelaxFunctor).map g)).inv \u25b7 h \u226b\n                \u03b7.naturality f \u25b7 (\u2191G.toPrelaxFunctor).map g \u25b7 h \u226b\n                  (\u03b1_ (\u03b7.app a) ((\u2191G.toPrelaxFunctor).map f) ((\u2191G.toPrelaxFunctor).map g)).hom \u25b7 h \u226b\n                    (\u03b1_ (\u03b7.app a) ((\u2191G.toPrelaxFunctor).map f \u226b (\u2191G.toPrelaxFunctor).map g) h).hom",
+              "state_before": "B : Type u\u2081\ninst\u271d\u00b9 : Bicategory B\nC : Type u\u2082\ninst\u271d : Bicategory C\nF G H : OplaxFunctor B C\n\u03b7 : OplaxNatTrans F G\n\u03b8 : OplaxNatTrans G H\na b c : B\na' : C\nf : a \u27f6 b\ng : b \u27f6 c\nh : (\u2191G.toPrelaxFunctor).obj c \u27f6 a'\n\u22a2 \u03b7.naturality (f \u226b g) \u25b7 h \u226b (\u03b1_ (\u03b7.app a) ((\u2191G.toPrelaxFunctor).map (f \u226b g)) h).hom \u226b \u03b7.app a \u25c1 G.mapComp f g \u25b7 h =\n    F.mapComp f g \u25b7 \u03b7.app c \u25b7 h \u226b\n      (\u03b1_ ((\u2191F.toPrelaxFunctor).map f) ((\u2191F.toPrelaxFunctor).map g) (\u03b7.app c)).hom \u25b7 h \u226b\n        (\u03b1_ ((\u2191F.toPrelaxFunctor).map f) ((\u2191F.toPrelaxFunctor).map g \u226b \u03b7.app c) h).hom \u226b\n          (\u2191F.toPrelaxFunctor).map f \u25c1 \u03b7.naturality g \u25b7 h \u226b\n            (\u03b1_ ((\u2191F.toPrelaxFunctor).map f) (\u03b7.app b \u226b (\u2191G.toPrelaxFunctor).map g) h).inv \u226b\n              (\u03b1_ ((\u2191F.toPrelaxFunctor).map f) (\u03b7.app b) ((\u2191G.toPrelaxFunctor).map g)).inv \u25b7 h \u226b\n                \u03b7.naturality f \u25b7 (\u2191G.toPrelaxFunctor).map g \u25b7 h \u226b\n                  (\u03b1_ (\u03b7.app a) ((\u2191G.toPrelaxFunctor).map f) ((\u2191G.toPrelaxFunctor).map g)).hom \u25b7 h \u226b\n                    (\u03b1_ (\u03b7.app a) ((\u2191G.toPrelaxFunctor).map f \u226b (\u2191G.toPrelaxFunctor).map g) h).hom",
+              "tactic": "rw [\u2190 associator_naturality_middle, \u2190 comp_whiskerRight_assoc, naturality_comp]"
+            },
+            {
+              "annotated_tactic": [
+                "\"simp\"",
+                "[]"
+              ],
+              "state_after": "no goals",
+              "state_before": "B : Type u\u2081\ninst\u271d\u00b9 : Bicategory B\nC : Type u\u2082\ninst\u271d : Bicategory C\nF G H : OplaxFunctor B C\n\u03b7 : OplaxNatTrans F G\n\u03b8 : OplaxNatTrans G H\na b c : B\na' : C\nf : a \u27f6 b\ng : b \u27f6 c\nh : (\u2191G.toPrelaxFunctor).obj c \u27f6 a'\n\u22a2 (F.mapComp f g \u25b7 \u03b7.app c \u226b\n          (\u03b1_ ((\u2191F.toPrelaxFunctor).map f) ((\u2191F.toPrelaxFunctor).map g) (\u03b7.app c)).hom \u226b\n            (\u2191F.toPrelaxFunctor).map f \u25c1 \u03b7.naturality g \u226b\n              (\u03b1_ ((\u2191F.toPrelaxFunctor).map f) (\u03b7.app b) ((\u2191G.toPrelaxFunctor).map g)).inv \u226b\n                \u03b7.naturality f \u25b7 (\u2191G.toPrelaxFunctor).map g \u226b\n                  (\u03b1_ (\u03b7.app a) ((\u2191G.toPrelaxFunctor).map f) ((\u2191G.toPrelaxFunctor).map g)).hom) \u25b7\n        h \u226b\n      (\u03b1_ (\u03b7.app a) ((\u2191G.toPrelaxFunctor).map f \u226b (\u2191G.toPrelaxFunctor).map g) h).hom =\n    F.mapComp f g \u25b7 \u03b7.app c \u25b7 h \u226b\n      (\u03b1_ ((\u2191F.toPrelaxFunctor).map f) ((\u2191F.toPrelaxFunctor).map g) (\u03b7.app c)).hom \u25b7 h \u226b\n        (\u03b1_ ((\u2191F.toPrelaxFunctor).map f) ((\u2191F.toPrelaxFunctor).map g \u226b \u03b7.app c) h).hom \u226b\n          (\u2191F.toPrelaxFunctor).map f \u25c1 \u03b7.naturality g \u25b7 h \u226b\n            (\u03b1_ ((\u2191F.toPrelaxFunctor).map f) (\u03b7.app b \u226b (\u2191G.toPrelaxFunctor).map g) h).inv \u226b\n              (\u03b1_ ((\u2191F.toPrelaxFunctor).map f) (\u03b7.app b) ((\u2191G.toPrelaxFunctor).map g)).inv \u25b7 h \u226b\n                \u03b7.naturality f \u25b7 (\u2191G.toPrelaxFunctor).map g \u25b7 h \u226b\n                  (\u03b1_ (\u03b7.app a) ((\u2191G.toPrelaxFunctor).map f) ((\u2191G.toPrelaxFunctor).map g)).hom \u25b7 h \u226b\n                    (\u03b1_ (\u03b7.app a) ((\u2191G.toPrelaxFunctor).map f \u226b (\u2191G.toPrelaxFunctor).map g) h).hom",
+              "tactic": "simp"
+            }
+          ],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/NaturalTransformation.lean"
+      },
+      {
+        "full_name": "CategoryTheory.OplaxNatTrans.whiskerRight_naturality_id",
+        "id": "CategoryTheory.OplaxNatTrans.whiskerRight_naturality_id",
+        "reason": "missing_trace",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            151,
+            86
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/NaturalTransformation.lean",
+          "full_name": "CategoryTheory.OplaxNatTrans.whiskerRight_naturality_id",
+          "start": [
+            148,
+            1
+          ],
+          "traced_tactics": [
+            {
+              "annotated_tactic": [
+                "\"rw [\\u2190 <a>associator_naturality_middle<\\/a>, \\u2190 <a>comp_whiskerRight_assoc<\\/a>, <a>naturality_id<\\/a>]\"",
+                "[{\"full_name\":\"CategoryTheory.Bicategory.associator_naturality_middle\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/Basic.lean\",\"def_pos\":[354,9],\"def_end_pos\":[354,37]},{\"full_name\":\"CategoryTheory.Bicategory.comp_whiskerRight_assoc\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/Basic.lean\",\"def_pos\":[177,12],\"def_end_pos\":[177,19]},{\"full_name\":\"CategoryTheory.OplaxNatTrans.naturality_id\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/NaturalTransformation.lean\",\"def_pos\":[50,3],\"def_end_pos\":[50,16]}]"
+              ],
+              "state_after": "B : Type u\u2081\ninst\u271d\u00b9 : Bicategory B\nC : Type u\u2082\ninst\u271d : Bicategory C\nF G H : OplaxFunctor B C\n\u03b7 : OplaxNatTrans F G\n\u03b8 : OplaxNatTrans G H\na b c : B\na' : C\nf : (\u2191G.toPrelaxFunctor).obj a \u27f6 a'\n\u22a2 (F.mapId a \u25b7 \u03b7.app a \u226b (\u03bb_ (\u03b7.app a)).hom \u226b (\u03c1_ (\u03b7.app a)).inv) \u25b7 f \u226b\n      (\u03b1_ (\u03b7.app a) (\ud835\udfd9 ((\u2191G.toPrelaxFunctor).obj a)) f).hom =\n    F.mapId a \u25b7 \u03b7.app a \u25b7 f \u226b\n      (\u03bb_ (\u03b7.app a)).hom \u25b7 f \u226b (\u03c1_ (\u03b7.app a)).inv \u25b7 f \u226b (\u03b1_ (\u03b7.app a) (\ud835\udfd9 ((\u2191G.toPrelaxFunctor).obj a)) f).hom",
+              "state_before": "B : Type u\u2081\ninst\u271d\u00b9 : Bicategory B\nC : Type u\u2082\ninst\u271d : Bicategory C\nF G H : OplaxFunctor B C\n\u03b7 : OplaxNatTrans F G\n\u03b8 : OplaxNatTrans G H\na b c : B\na' : C\nf : (\u2191G.toPrelaxFunctor).obj a \u27f6 a'\n\u22a2 \u03b7.naturality (\ud835\udfd9 a) \u25b7 f \u226b (\u03b1_ (\u03b7.app a) ((\u2191G.toPrelaxFunctor).map (\ud835\udfd9 a)) f).hom \u226b \u03b7.app a \u25c1 G.mapId a \u25b7 f =\n    F.mapId a \u25b7 \u03b7.app a \u25b7 f \u226b\n      (\u03bb_ (\u03b7.app a)).hom \u25b7 f \u226b (\u03c1_ (\u03b7.app a)).inv \u25b7 f \u226b (\u03b1_ (\u03b7.app a) (\ud835\udfd9 ((\u2191G.toPrelaxFunctor).obj a)) f).hom",
+              "tactic": "rw [\u2190 associator_naturality_middle, \u2190 comp_whiskerRight_assoc, naturality_id]"
+            },
+            {
+              "annotated_tactic": [
+                "\"simp\"",
+                "[]"
+              ],
+              "state_after": "no goals",
+              "state_before": "B : Type u\u2081\ninst\u271d\u00b9 : Bicategory B\nC : Type u\u2082\ninst\u271d : Bicategory C\nF G H : OplaxFunctor B C\n\u03b7 : OplaxNatTrans F G\n\u03b8 : OplaxNatTrans G H\na b c : B\na' : C\nf : (\u2191G.toPrelaxFunctor).obj a \u27f6 a'\n\u22a2 (F.mapId a \u25b7 \u03b7.app a \u226b (\u03bb_ (\u03b7.app a)).hom \u226b (\u03c1_ (\u03b7.app a)).inv) \u25b7 f \u226b\n      (\u03b1_ (\u03b7.app a) (\ud835\udfd9 ((\u2191G.toPrelaxFunctor).obj a)) f).hom =\n    F.mapId a \u25b7 \u03b7.app a \u25b7 f \u226b\n      (\u03bb_ (\u03b7.app a)).hom \u25b7 f \u226b (\u03c1_ (\u03b7.app a)).inv \u25b7 f \u226b (\u03b1_ (\u03b7.app a) (\ud835\udfd9 ((\u2191G.toPrelaxFunctor).obj a)) f).hom",
+              "tactic": "simp"
+            }
+          ],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/NaturalTransformation.lean"
+      },
+      {
+        "full_name": "CategoryTheory.OplaxNatTrans.whiskerRight_naturality_naturality",
+        "id": "CategoryTheory.OplaxNatTrans.whiskerRight_naturality_naturality",
+        "reason": "missing_trace",
+        "selection": {
+          "commit": "29dcec074de168ac2bf835a77ef68bbe069194c5",
+          "end": [
+            114,
+            84
+          ],
+          "file_path": "Mathlib/CategoryTheory/Bicategory/NaturalTransformation.lean",
+          "full_name": "CategoryTheory.OplaxNatTrans.whiskerRight_naturality_naturality",
+          "start": [
+            111,
+            1
+          ],
+          "traced_tactics": [
+            {
+              "annotated_tactic": [
+                "\"rw [\\u2190 <a>comp_whiskerRight<\\/a>, <a>naturality_naturality<\\/a>, <a>comp_whiskerRight<\\/a>, <a>whisker_assoc<\\/a>]\"",
+                "[{\"full_name\":\"CategoryTheory.Bicategory.comp_whiskerRight\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/Basic.lean\",\"def_pos\":[91,3],\"def_end_pos\":[91,20]},{\"full_name\":\"CategoryTheory.OplaxNatTrans.naturality_naturality\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/NaturalTransformation.lean\",\"def_pos\":[46,3],\"def_end_pos\":[46,24]},{\"full_name\":\"CategoryTheory.Bicategory.comp_whiskerRight\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/Basic.lean\",\"def_pos\":[91,3],\"def_end_pos\":[91,20]},{\"full_name\":\"CategoryTheory.Bicategory.whisker_assoc\",\"def_path\":\"Mathlib\\/CategoryTheory\\/Bicategory\\/Basic.lean\",\"def_pos\":[105,3],\"def_end_pos\":[105,16]}]"
+              ],
+              "state_after": "no goals",
+              "state_before": "B : Type u\u2081\ninst\u271d\u00b9 : Bicategory B\nC : Type u\u2082\ninst\u271d : Bicategory C\nF G H : OplaxFunctor B C\n\u03b7 : OplaxNatTrans F G\n\u03b8 : OplaxNatTrans G H\na b c : B\na' : C\nf g : a \u27f6 b\n\u03b2 : f \u27f6 g\nh : (\u2191G.toPrelaxFunctor).obj b \u27f6 a'\n\u22a2 F.map\u2082 \u03b2 \u25b7 \u03b7.app b \u25b7 h \u226b \u03b7.naturality g \u25b7 h =\n    \u03b7.naturality f \u25b7 h \u226b\n      (\u03b1_ (\u03b7.app a) ((\u2191G.toPrelaxFunctor).map f) h).hom \u226b\n        \u03b7.app a \u25c1 G.map\u2082 \u03b2 \u25b7 h \u226b (\u03b1_ (\u03b7.app a) ((\u2191G.toPrelaxFunctor).map g) h).inv",
+              "tactic": "rw [\u2190 comp_whiskerRight, naturality_naturality, comp_whiskerRight, whisker_assoc]"
+            }
+          ],
+          "url": "https://github.com/leanprover-community/mathlib4"
+        },
+        "source_file": "Mathlib/CategoryTheory/Bicategory/NaturalTransformation.lean"
+      }
+    ],
+    "input_proofs": 18,
+    "input_units": 2,
+    "proofs": 1,
+    "published_proofs": 1,
+    "published_transitions": 2,
+    "replay_failures": [],
+    "transitions": 2,
+    "validation_failures": [],
+    "validation_rejected_proofs": 0,
+    "zero_transition_proofs": 0
+  },
+  "shards": [
+    {
+      "path": "data/train/mathlib-000612-0000-4acd377a7e154442.parquet",
+      "sha256": "4acd377a7e15444279e36fefb4b9a1d94a57bab4333c31fe8622b507a3cb6673",
+      "bytes": 31117,
+      "rows": 2,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    }
+  ],
+  "proof_ids": [
+    "mathlib:CategoryTheory.LocallyDiscrete.eqToHom_toLoc"
+  ],
+  "proof_keys": [
+    "[\"mathlib\",\"29dcec074de168ac2bf835a77ef68bbe069194c5\",\"Mathlib/CategoryTheory/Bicategory/LocallyDiscrete.lean\",null,null,\"CategoryTheory.LocallyDiscrete.eqToHom_toLoc\"]"
+  ]
+}

manifests/batches/numina/001362.json

@@ -0,0 +1,44 @@
+{
+  "format": "leangpt-parquet-v2",
+  "batch": "numina/001362",
+  "batch_fingerprint": "ed201ea09445a88d473cce6db4677a0f72039419572a83fc23024a7991e77648",
+  "evidence": {
+    "batch_fingerprint": "ed201ea09445a88d473cce6db4677a0f72039419572a83fc23024a7991e77648",
+    "contamination_matches": [],
+    "failures": [],
+    "input_proofs": 5,
+    "input_units": 5,
+    "proofs": 5,
+    "published_proofs": 5,
+    "published_transitions": 26,
+    "replay_failures": [],
+    "trace_mode": "bundle",
+    "transitions": 26,
+    "validation_failures": [],
+    "validation_rejected_proofs": 0,
+    "zero_transition_proofs": 0
+  },
+  "shards": [
+    {
+      "path": "data/train/numina-001362-0000-07d4aac4f2c73cb7.parquet",
+      "sha256": "07d4aac4f2c73cb74b34740a134d540fa219ad3430120cf59e4bfbff2514fa97",
+      "bytes": 409554,
+      "rows": 26,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    }
+  ],
+  "proof_ids": [
+    "numina:06c31283-ec79-58bc-bda0-8b0e4c1a1ccd",
+    "numina:2cc3b9bb-6083-546a-80e7-5d4cb9b6c734",
+    "numina:52a9cd40-e7d6-5062-bdcd-bf990a94e70b",
+    "numina:62c57e3d-31b2-5a43-b3f8-dc50e902f846",
+    "numina:de65a5fd-5013-5229-aeff-423b1d7803e0"
+  ],
+  "proof_keys": [
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006810.lean\",\"68bef04828fcbdd70d6a44a9d1ffb67ce53172a5bd7403a9483eef427d3e86b1\",0,\"number_theory_227175\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006811.lean\",\"55eb8a561827d92288fa8499a750e9fc9dcbe586c46beb0f1d94eb80b9d55554\",0,\"number_theory_607988\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006812.lean\",\"ee0ac2bba4c545032d4a1504506a19951473416c55d03d3017e581e0bab0f120\",0,\"inequalities_58034\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006813.lean\",\"66ed0500730999297071456f879b7b0624cdedbd9ccd1b40829ae32d607ff1e0\",0,\"number_theory_610773\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006814.lean\",\"e5bc60d85d855cc8835429c42a3175987fa85616555d2339ddc76656ef7912dc\",0,\"algebra_279704\"]"
+  ]
+}

manifests/batches/numina/001363.json

@@ -0,0 +1,51 @@
+{
+  "format": "leangpt-parquet-v2",
+  "batch": "numina/001363",
+  "batch_fingerprint": "7eb27cdcca79e2634be40232843c253830695fe6c05ce7db26bee234daa585ce",
+  "evidence": {
+    "batch_fingerprint": "7eb27cdcca79e2634be40232843c253830695fe6c05ce7db26bee234daa585ce",
+    "contamination_matches": [],
+    "failures": [],
+    "input_proofs": 5,
+    "input_units": 5,
+    "proofs": 5,
+    "published_proofs": 5,
+    "published_transitions": 34,
+    "replay_failures": [],
+    "trace_mode": "bundle",
+    "transitions": 34,
+    "validation_failures": [],
+    "validation_rejected_proofs": 0,
+    "zero_transition_proofs": 0
+  },
+  "shards": [
+    {
+      "path": "data/train/numina-001363-0000-c392bca7d7be13ea.parquet",
+      "sha256": "c392bca7d7be13ea52e45cfbdf0b811e634ca7ba333b9470e9dc9701fcf9d4b0",
+      "bytes": 75798,
+      "rows": 12,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    },
+    {
+      "path": "data/dev/numina-001363-0000-1f348d7140efcddd.parquet",
+      "sha256": "1f348d7140efcddde3b187ac3c91e0944e46cdfb04a6cc1f3a5ff95149251853",
+      "bytes": 121256,
+      "rows": 22,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    }
+  ],
+  "proof_ids": [
+    "numina:2b2d9d2c-f5ff-5ee7-9b15-560008e7b98c",
+    "numina:7b986bd2-4427-588f-8472-af24e59dc3a6",
+    "numina:b0f30728-b7cf-5801-a266-9a5ec6abc626",
+    "numina:c394f877-b60b-5520-91fd-43768d460fcf",
+    "numina:d60302a3-ef47-53ef-bb01-8a0914c0ba69"
+  ],
+  "proof_keys": [
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006815.lean\",\"f3d314756a33a1bf0d835e01e95fd8e25aca3da312cbcdb45063796a17a509f3\",0,\"algebra_96192\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006816.lean\",\"ae92096a78c856a789ea5580dac5ed9cf521ad1e7961b26db0acbefce2ac7ea6\",0,\"algebra_9354\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006817.lean\",\"e82ce3dd3f4c0d8129a1b953a2c0b8428781dc5bb6f5465a29f2a497e5167005\",0,\"algebra_21436\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006818.lean\",\"66f14453123baf6b03bd0930974f2fd62227d25fa6dd0dadb8e2cf573793c472\",0,\"number_theory_16169\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006819.lean\",\"a570e9f31e543baf2be2eba3837cf702511fb6dc8109161f6a06601e49246fca\",0,\"algebra_265138\"]"
+  ]
+}

manifests/batches/numina/001364.json

@@ -0,0 +1,51 @@
+{
+  "format": "leangpt-parquet-v2",
+  "batch": "numina/001364",
+  "batch_fingerprint": "32f3d502cc97f277f08f9b90037bb9522bcfce8cc763f9f0ec6b378cec8689e5",
+  "evidence": {
+    "batch_fingerprint": "32f3d502cc97f277f08f9b90037bb9522bcfce8cc763f9f0ec6b378cec8689e5",
+    "contamination_matches": [],
+    "failures": [],
+    "input_proofs": 5,
+    "input_units": 5,
+    "proofs": 5,
+    "published_proofs": 5,
+    "published_transitions": 60,
+    "replay_failures": [],
+    "trace_mode": "bundle",
+    "transitions": 60,
+    "validation_failures": [],
+    "validation_rejected_proofs": 0,
+    "zero_transition_proofs": 0
+  },
+  "shards": [
+    {
+      "path": "data/train/numina-001364-0000-28228af4cbef5e3b.parquet",
+      "sha256": "28228af4cbef5e3bdd081093930d5c0251050fbc5fe8566d3ff4453092e4dae1",
+      "bytes": 442998,
+      "rows": 46,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    },
+    {
+      "path": "data/dev/numina-001364-0000-e6a00bf93224ed42.parquet",
+      "sha256": "e6a00bf93224ed42f12f0ed160a358869663fdf63445871201f288faf7ce0bb4",
+      "bytes": 80085,
+      "rows": 14,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    }
+  ],
+  "proof_ids": [
+    "numina:369d2c1d-748a-5e6f-951b-b1d86f7d58d8",
+    "numina:7ebb150b-baeb-54e6-a8be-8a1255d511a4",
+    "numina:7f144aa2-6577-530b-8b9f-b9e9ad2413b9",
+    "numina:e87fc15a-96af-50cf-ad50-553fa320f941",
+    "numina:f3bd68db-0494-5991-93bb-680e20ceea4d"
+  ],
+  "proof_keys": [
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006820.lean\",\"7976ff05500e173efeee1fc6717ccf0b079496c79ac860ff40c3c3069a339163\",0,\"inequalities_607989\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006821.lean\",\"be3af552ab6abbb1eb86a485ad52f6ec300326bf916155f3b12c7a5222afce01\",0,\"algebra_604278\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006822.lean\",\"b5bf3326ec23358f7ed0fa538be0f32d540b26e9983f4f528ed5794df7e24a26\",0,\"algebra_20287\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006823.lean\",\"8b3882265401b86fa7a10b83d99c2efb0691a398b795e383f68332fff4d63c9e\",0,\"algebra_9205\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006824.lean\",\"a9d8cfa602777c0c9e7a67e23de76db569d9a74c3413d586fcc5ebc9044f26ee\",0,\"algebra_21442\"]"
+  ]
+}

manifests/batches/numina/001365.json

@@ -0,0 +1,44 @@
+{
+  "format": "leangpt-parquet-v2",
+  "batch": "numina/001365",
+  "batch_fingerprint": "4fe45d8046ccbd3a09c3c463f0f5e298e4bcae750343759a3c03301cf3f1c258",
+  "evidence": {
+    "batch_fingerprint": "4fe45d8046ccbd3a09c3c463f0f5e298e4bcae750343759a3c03301cf3f1c258",
+    "contamination_matches": [],
+    "failures": [],
+    "input_proofs": 5,
+    "input_units": 5,
+    "proofs": 5,
+    "published_proofs": 5,
+    "published_transitions": 20,
+    "replay_failures": [],
+    "trace_mode": "bundle",
+    "transitions": 20,
+    "validation_failures": [],
+    "validation_rejected_proofs": 0,
+    "zero_transition_proofs": 0
+  },
+  "shards": [
+    {
+      "path": "data/train/numina-001365-0000-1cd485350b31e2ca.parquet",
+      "sha256": "1cd485350b31e2ca87b9f4a8b8c6a1dfe3ab2122221997420131d6f83d026c23",
+      "bytes": 235669,
+      "rows": 20,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    }
+  ],
+  "proof_ids": [
+    "numina:0a5fb768-9080-5a0a-a7bd-2248ebf9e23a",
+    "numina:30929670-59e0-5d04-9b11-65554d163300",
+    "numina:3b1e549b-b33d-5e4a-a1a6-6ad80d027094",
+    "numina:3f68a756-382d-5a5b-9f42-ef157ec961fa",
+    "numina:a3b6f8e9-5303-5afc-9479-30e42ccfdd06"
+  ],
+  "proof_keys": [
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006825.lean\",\"267d3ab1a623d8552bb613b48274f927812e297641e160869873d06ddb078025\",0,\"number_theory_234617\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006826.lean\",\"6f73072e09dca78a15fa896065dda8e2d309387a3e2064d2fd1228a65a23fc04\",0,\"number_theory_96211\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006827.lean\",\"ef4aea5835c0e54da41ee24b82cd052a36e410e846158a3975a446361efd6169\",0,\"inequalities_128586\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006828.lean\",\"9f309ff808ce2cbce22b838a1aee611fff90f289402b10071a79f3b15e6dae92\",0,\"algebra_16170\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006829.lean\",\"f2d64de101cfdd17e5fde720122a6c715f7bc4a018c31bf5cd6c75a3c89afba6\",0,\"inequalities_37789\"]"
+  ]
+}

manifests/batches/numina/001366.json

@@ -0,0 +1,44 @@
+{
+  "format": "leangpt-parquet-v2",
+  "batch": "numina/001366",
+  "batch_fingerprint": "a88faaef478d5de354e5e558a610130e9355e33e82a4324b3f51c2b1509e6d2e",
+  "evidence": {
+    "batch_fingerprint": "a88faaef478d5de354e5e558a610130e9355e33e82a4324b3f51c2b1509e6d2e",
+    "contamination_matches": [],
+    "failures": [],
+    "input_proofs": 5,
+    "input_units": 5,
+    "proofs": 5,
+    "published_proofs": 5,
+    "published_transitions": 27,
+    "replay_failures": [],
+    "trace_mode": "bundle",
+    "transitions": 27,
+    "validation_failures": [],
+    "validation_rejected_proofs": 0,
+    "zero_transition_proofs": 0
+  },
+  "shards": [
+    {
+      "path": "data/train/numina-001366-0000-8d80ac3b355c732a.parquet",
+      "sha256": "8d80ac3b355c732a17edc95b3143d15d8d5d36395a09f15751aa80b7b867fb67",
+      "bytes": 384118,
+      "rows": 27,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    }
+  ],
+  "proof_ids": [
+    "numina:08df4dc6-0037-57b5-b7ba-fffb9ab391c4",
+    "numina:4a8632ea-4804-55e0-9f8a-78ba4aecdcd4",
+    "numina:7f906ad4-f089-5396-9f2b-f0aa7300bf2c",
+    "numina:a92d05ba-5243-5268-b399-f7d53c7b8251",
+    "numina:f3c5218a-e8de-59dc-ad15-b64437d137f9"
+  ],
+  "proof_keys": [
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006830.lean\",\"244ceb33a98625c51af50066460c196d008621abe2ce3c1fbba40236539747a8\",0,\"algebra_265201\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006831.lean\",\"4207685e1158281ae35ee6a62009c279202740f12df237fff2bdd7a2fc3d0f95\",0,\"algebra_20292\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006832.lean\",\"9a4c13bde9dcc94904e2f73630eb6d4d0262d78f062a5c73f96779da8ef8c119\",0,\"inequalities_188095\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006833.lean\",\"54483f75701591e09bad59e2e9e448318ba8565bcf7963c552c562cf5ee1f1a5\",0,\"algebra_234782\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006834.lean\",\"293c0b4dd17a9c096448eb254349d6caba4a0655bd587023f21620b9da01a3f5\",0,\"algebra_96124\"]"
+  ]
+}

manifests/batches/numina/001367.json

@@ -0,0 +1,51 @@
+{
+  "format": "leangpt-parquet-v2",
+  "batch": "numina/001367",
+  "batch_fingerprint": "95aaaf0521ff5167a8832cce307b6a8824a9ccfa3b907faa44438c2400de83b4",
+  "evidence": {
+    "batch_fingerprint": "95aaaf0521ff5167a8832cce307b6a8824a9ccfa3b907faa44438c2400de83b4",
+    "contamination_matches": [],
+    "failures": [],
+    "input_proofs": 5,
+    "input_units": 5,
+    "proofs": 5,
+    "published_proofs": 5,
+    "published_transitions": 13,
+    "replay_failures": [],
+    "trace_mode": "bundle",
+    "transitions": 13,
+    "validation_failures": [],
+    "validation_rejected_proofs": 0,
+    "zero_transition_proofs": 0
+  },
+  "shards": [
+    {
+      "path": "data/train/numina-001367-0000-781c50bbe3b24c77.parquet",
+      "sha256": "781c50bbe3b24c77aade7fec3871c5422f34dd2c698ea718de2468c6f32e4d37",
+      "bytes": 98145,
+      "rows": 12,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    },
+    {
+      "path": "data/internal_test/numina-001367-0000-b7c3bcc9ee807031.parquet",
+      "sha256": "b7c3bcc9ee807031b874979751611bcfa65afbf81fcd406804e2db2a6e8b4e19",
+      "bytes": 51225,
+      "rows": 1,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    }
+  ],
+  "proof_ids": [
+    "numina:4af0f7cd-b3ae-5f1a-a4ff-fac7d9f1dfd5",
+    "numina:6e7855e2-5d2f-56e8-be5e-36806cdc4163",
+    "numina:931e08d8-c317-5837-99fc-7878404c81a9",
+    "numina:a49bd290-9cab-599b-b402-52b503b3f781",
+    "numina:c4819f6c-d9d7-5596-bf54-35d8c6487c47"
+  ],
+  "proof_keys": [
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006835.lean\",\"3c9e68b84fe15e0b3c289984a137edf23a3d899062f457b4cf11b6fb146b9610\",0,\"algebra_10173\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006836.lean\",\"f3cad91d8c698ca8f6f55840fe229730452341ab891e278d8f217917d97a3d6e\",0,\"algebra_15981\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006837.lean\",\"339f0393c8ab50eea9e93542681bf4b0474f5689c4725ca95c71aaa3393e5c78\",0,\"inequalities_49841\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006838.lean\",\"3c5a0ac94ba1a6f1046597f224daedd20efe87979f61559423a1b228f2add8f4\",0,\"algebra_265305\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006839.lean\",\"ea140c1b169dbf7e1b3b9a902c495dbeb9f9098aa05e042c466642530c7d9c17\",0,\"inequalities_277168\"]"
+  ]
+}

manifests/batches/numina/001368.json

@@ -0,0 +1,44 @@
+{
+  "format": "leangpt-parquet-v2",
+  "batch": "numina/001368",
+  "batch_fingerprint": "96820eedb903249ca488381494f6fef4d9967db8a379b338c5dd26ad4cc46a8d",
+  "evidence": {
+    "batch_fingerprint": "96820eedb903249ca488381494f6fef4d9967db8a379b338c5dd26ad4cc46a8d",
+    "contamination_matches": [],
+    "failures": [],
+    "input_proofs": 5,
+    "input_units": 5,
+    "proofs": 5,
+    "published_proofs": 5,
+    "published_transitions": 26,
+    "replay_failures": [],
+    "trace_mode": "bundle",
+    "transitions": 26,
+    "validation_failures": [],
+    "validation_rejected_proofs": 0,
+    "zero_transition_proofs": 0
+  },
+  "shards": [
+    {
+      "path": "data/train/numina-001368-0000-201963d8063e8214.parquet",
+      "sha256": "201963d8063e8214961fe9ec1647060d468dca70c60481aeb0b0060bc72f41c2",
+      "bytes": 200328,
+      "rows": 26,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    }
+  ],
+  "proof_ids": [
+    "numina:1de68176-68a2-5d1c-ad2d-5eba3f0ba0bd",
+    "numina:3dc3a7c4-3403-518f-9fcc-e2281ac26a7b",
+    "numina:47d24c12-98c5-50d5-8d6b-dd15ad581c50",
+    "numina:7c4bd3c8-e25e-5a66-97c0-fb301c625f7c",
+    "numina:acaa8786-51e9-5ccf-9946-4d3dc3a5bd8c"
+  ],
+  "proof_keys": [
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006840.lean\",\"301a7e8d935c9430b7713ba5ba14ba73beb0d759e924c70163645db4d62bfb86\",0,\"number_theory_610784\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006841.lean\",\"c253df9eccfe40375a8e8697d64bc957f28b5ce1e5903bd6f5aa5d1e16394f16\",0,\"algebra_20300\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006842.lean\",\"157506854f5211ddadccd8143351e7c6f6adbae2d049cffb54b20fdd43a524c9\",0,\"inequalities_164485\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006843.lean\",\"153d0d79f3915626e286a1208318e5abeb010e202a3b5d37d399f489321cc289\",0,\"number_theory_112197\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006844.lean\",\"253c968e0193fbe9900639947c70fa95dcd0eba0df22b10081f56cf94bdb7dd2\",0,\"inequalities_43462\"]"
+  ]
+}

manifests/batches/numina/001369.json

@@ -0,0 +1,51 @@
+{
+  "format": "leangpt-parquet-v2",
+  "batch": "numina/001369",
+  "batch_fingerprint": "2f9ea60f4bf90e276926d739df977e03ceb5609af020ab046b8a3361ec859abe",
+  "evidence": {
+    "batch_fingerprint": "2f9ea60f4bf90e276926d739df977e03ceb5609af020ab046b8a3361ec859abe",
+    "contamination_matches": [],
+    "failures": [],
+    "input_proofs": 5,
+    "input_units": 5,
+    "proofs": 5,
+    "published_proofs": 5,
+    "published_transitions": 27,
+    "replay_failures": [],
+    "trace_mode": "bundle",
+    "transitions": 27,
+    "validation_failures": [],
+    "validation_rejected_proofs": 0,
+    "zero_transition_proofs": 0
+  },
+  "shards": [
+    {
+      "path": "data/train/numina-001369-0000-b60edbfc3b1dca9b.parquet",
+      "sha256": "b60edbfc3b1dca9b3774117c1e30ab94ba4d566153a6dd4c7ef9b9ad244e0dba",
+      "bytes": 372361,
+      "rows": 18,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    },
+    {
+      "path": "data/internal_test/numina-001369-0000-1126942117434f2f.parquet",
+      "sha256": "1126942117434f2f7dfeb5876ade0c01dcdbe2780e4a35ae8e8b093a8cf09f7f",
+      "bytes": 105836,
+      "rows": 9,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    }
+  ],
+  "proof_ids": [
+    "numina:5498eb8e-0959-5bf2-9f76-17a5c6597150",
+    "numina:7ba8821f-1628-5718-8b99-fec8459f201c",
+    "numina:a2a8f4f8-2ccc-5913-a293-8b22fa686b13",
+    "numina:ba49ced1-8203-574a-a44b-f6c47b8fd04b",
+    "numina:f3fe5f12-f991-5088-9dee-f488abd9da05"
+  ],
+  "proof_keys": [
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006845.lean\",\"522eef4d2b563e25ea7b292222acfe5d5043a2c2b3005a235eb804f914c61d42\",0,\"number_theory_610786\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006846.lean\",\"c06ac9ceb4ea9dedb49d680ac85e94d86a65e2bfe11c8479506576be72d95e83\",0,\"algebra_96057\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006847.lean\",\"3c8401281e724bc2a56f1c41e390d649410b4502083bef7128d5870d2e35af58\",0,\"number_theory_234838\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006848.lean\",\"ed4d723e1d72e135065727f2bd5d69a085c7788222c0c6bf51f5cf34935e4b7a\",0,\"number_theory_112262\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006849.lean\",\"c13aeeba12bf5038d68d01b9dc69b174bc8408be62042abb62b4374a03a13cad\",0,\"algebra_10189\"]"
+  ]
+}

manifests/batches/numina/001370.json

@@ -0,0 +1,44 @@
+{
+  "format": "leangpt-parquet-v2",
+  "batch": "numina/001370",
+  "batch_fingerprint": "6eebdce65ed84f6d6a2a00529c9d90cd5dc806e73f85a904d8deb5c252f71d93",
+  "evidence": {
+    "batch_fingerprint": "6eebdce65ed84f6d6a2a00529c9d90cd5dc806e73f85a904d8deb5c252f71d93",
+    "contamination_matches": [],
+    "failures": [],
+    "input_proofs": 5,
+    "input_units": 5,
+    "proofs": 5,
+    "published_proofs": 5,
+    "published_transitions": 66,
+    "replay_failures": [],
+    "trace_mode": "bundle",
+    "transitions": 66,
+    "validation_failures": [],
+    "validation_rejected_proofs": 0,
+    "zero_transition_proofs": 0
+  },
+  "shards": [
+    {
+      "path": "data/train/numina-001370-0000-757c10ebf6efc279.parquet",
+      "sha256": "757c10ebf6efc279fea3d6bc4203989fa6837d1ec8b7b465e40844120825ad1e",
+      "bytes": 673542,
+      "rows": 66,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    }
+  ],
+  "proof_ids": [
+    "numina:09fe542e-9fcb-5911-9011-88c8ea32efba",
+    "numina:39ec1fd1-0ff9-578e-abc9-8d5c788f6308",
+    "numina:aa0be601-2f7f-57cc-8285-d1ea3833f991",
+    "numina:cc52901e-c0ca-578a-8c01-8ed391b4bae6",
+    "numina:f8ca8b1c-c2ec-5e51-8d1f-c17ad4955fbb"
+  ],
+  "proof_keys": [
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006850.lean\",\"9264371b328d3ee29398e5e61463280de1fdbafdb84be5161bbb87e9abb96053\",0,\"number_theory_245717\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006851.lean\",\"90d0b5ed70e2922b1f1b6981246d3345761fdeb0b6eae497df71a7577a2c3349\",0,\"algebra_265535\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006852.lean\",\"367ddaa97753787c658d17b6a4468b2982f5ee80a864f130f0ceaf3edde098c9\",0,\"algebra_607354\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006853.lean\",\"5b5beb3fa9a9d20ca9510916f5d41e0597edb6f2b47cb2cd99579ebf0aa61196\",0,\"number_theory_23490\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006854.lean\",\"8ab3ae455a06ea4e3d255a625156ebbcaa6fd617d5d18368c6ff0866ed808ae9\",0,\"calculus_13255\"]"
+  ]
+}

manifests/batches/numina/001371.json

@@ -0,0 +1,51 @@
+{
+  "format": "leangpt-parquet-v2",
+  "batch": "numina/001371",
+  "batch_fingerprint": "ef78f9c592ab431470d0b3f9a0dfa6fc33f30827380179b72000998518bb622d",
+  "evidence": {
+    "batch_fingerprint": "ef78f9c592ab431470d0b3f9a0dfa6fc33f30827380179b72000998518bb622d",
+    "contamination_matches": [],
+    "failures": [],
+    "input_proofs": 5,
+    "input_units": 5,
+    "proofs": 5,
+    "published_proofs": 5,
+    "published_transitions": 65,
+    "replay_failures": [],
+    "trace_mode": "bundle",
+    "transitions": 65,
+    "validation_failures": [],
+    "validation_rejected_proofs": 0,
+    "zero_transition_proofs": 0
+  },
+  "shards": [
+    {
+      "path": "data/train/numina-001371-0000-edcfdd4abf6d987a.parquet",
+      "sha256": "edcfdd4abf6d987a7eaff8c0b89fe9c1add2979c7a8abee9a2ec78056532afc0",
+      "bytes": 291196,
+      "rows": 36,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    },
+    {
+      "path": "data/internal_test/numina-001371-0000-ce978a261164536e.parquet",
+      "sha256": "ce978a261164536e05a3b5e6c398559556fd85a4dbe3f9f8e868893c1f080ae8",
+      "bytes": 365641,
+      "rows": 29,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    }
+  ],
+  "proof_ids": [
+    "numina:17725d76-f0a4-5dc1-86a6-1fdd0cf94ef9",
+    "numina:26580727-d8da-5c7e-9e04-dbee9b0f9055",
+    "numina:66b87803-405e-5c53-9294-e611ceab4ea4",
+    "numina:99b89cb7-b3e7-5e6b-96d1-f066cb31c5c0",
+    "numina:cc42ba16-b533-5044-8dd4-178e6ec029c1"
+  ],
+  "proof_keys": [
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006855.lean\",\"9ffc7b69717c2d4cce25dcdcfacd5462ef70433d4946e2cca78cdc99147be1f6\",0,\"algebra_21305\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006856.lean\",\"4adfd3b632a76c645faf2d7b07ed6f0b3ccf66a6d2eab537a8c67e50abfc6f98\",0,\"algebra_96068\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006857.lean\",\"51db5d47366f5bc860ad17f2e3703d9c289c30c385c178c81a33c339d777bd55\",0,\"calculus_185863\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006858.lean\",\"7a8008b041fbd6cd40e460d22e93b7fd879318ff695b5cc65423202a7afd7192\",0,\"inequalities_245776\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006859.lean\",\"11e9f3769648a045e2f7acd0efeb18c702a7c0c4b0f84d02b805d73ed87c561c\",0,\"algebra_525610\"]"
+  ]
+}

manifests/batches/numina/001372.json

@@ -0,0 +1,51 @@
+{
+  "format": "leangpt-parquet-v2",
+  "batch": "numina/001372",
+  "batch_fingerprint": "0e76f928a9b309de85b9035bf94f528f7942ed04bc157c45ac4fb9aac2293c46",
+  "evidence": {
+    "batch_fingerprint": "0e76f928a9b309de85b9035bf94f528f7942ed04bc157c45ac4fb9aac2293c46",
+    "contamination_matches": [],
+    "failures": [],
+    "input_proofs": 5,
+    "input_units": 5,
+    "proofs": 5,
+    "published_proofs": 5,
+    "published_transitions": 46,
+    "replay_failures": [],
+    "trace_mode": "bundle",
+    "transitions": 46,
+    "validation_failures": [],
+    "validation_rejected_proofs": 0,
+    "zero_transition_proofs": 0
+  },
+  "shards": [
+    {
+      "path": "data/train/numina-001372-0000-383b8c79263d2347.parquet",
+      "sha256": "383b8c79263d234761b072c380a87636ba6559ee999e3fd146f9860df616ad7e",
+      "bytes": 277672,
+      "rows": 43,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    },
+    {
+      "path": "data/internal_test/numina-001372-0000-446d6a8e283a532a.parquet",
+      "sha256": "446d6a8e283a532a46d72a2dd53f89f3c943585d01ecd7a6a59fd7b6d8adc602",
+      "bytes": 136960,
+      "rows": 3,
+      "revision": "b0411c346a74577f6055387bcdecdbe84cd12bd1"
+    }
+  ],
+  "proof_ids": [
+    "numina:4b52f8b1-09ef-58ab-991e-e26c398d1736",
+    "numina:8ac1dd26-94ba-5634-97b7-ed2963dacac4",
+    "numina:8b4ae315-dd86-5511-b0cc-bd6a3e690b54",
+    "numina:f6f6a22a-d51c-59a5-a298-416488229f83",
+    "numina:fbf8be88-827c-556f-aa89-7b577e37e799"
+  ],
+  "proof_keys": [
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006860.lean\",\"6fa78e3e2be9b877c81239f2d93826fe5fe376314f68eb488437451b70467259\",0,\"inequalities_277302\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006861.lean\",\"0d8fe30a411e51e7948b1d913842facd688a9dc8290eb3e42a04f50c86601c22\",0,\"number_theory_23494\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006862.lean\",\"03f735ada39d21e597143a5f63c823585d162efb4bfd327ef2ff76d4728ba4bf\",0,\"algebra_96075\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006863.lean\",\"3142a737da1aa9a99e5289535edb3859d39f2e038d251e2aa987e8d61b302478\",0,\"algebra_21312\"]",
+    "[\"numina\",\"51fa67f1f647ae1ecd81eef9f19306aa8a7b3a94\",\"Full/Proof_006864.lean\",\"fbe7703c72a0232cc219d2225674db49b2ce338ae9ef7d0128085c1f3458680b\",0,\"algebra_122581\"]"
+  ]
+}