Checker "kiota" on test "mathlib"
Checker: kiota · Version: 0.1.0 · 📄 Declaration · 🔗 Source
Test: mathlib · Expected: 👍 accept · Size: 5.9 GB · Lines: 112.1 M · lean4export: 3.1.0 · Lean: 4.36.0 · Timeout: 68.7 min · 📄 Declaration · 🔗 Source
Result: 💥 error · exit code 137 · wall time: 18.3 min · instructions: 6.2 T · max rss memory: 14.6 GB · run 2026-11-22 02:28:12 UTC
stderr:
[decl #100] def cast [decl #200] theorem Nat.modCoreGo_lt [decl #300] def Monoid.toOne [decl #400] def List.length [decl #500] theorem _private.Init.Data.List.Pairwise.0.List.pairwise_append._simp_1_1 [decl #600] theorem instDecidableEqOfIff._proof_1 [decl #700] theorem Nat.ne_of_beq_eq_false [decl #800] def Int.subNatNat [decl #900] theorem Nat.not_le [decl #1000] def List.find? [decl #1100] theorem Int.negSucc_mul_subNatNat [decl #1200] theorem Int.negOfNat_mul_negSucc [decl #1300] theorem Int.lt_iff_add_one_le [decl #1400] def Option.bind [decl #1500] def Nat.digitChar [decl #1600] theorem _private.Init.Data.List.Lemmas.0.List.mem_filter._simp_1_2 [decl #1700] theorem _private.Init.Data.List.Pairwise.0.List.nodup_iff_count_eq_ite._simp_1_1 [decl #1800] def _private.Init.SimpLemmas.0.or_self.match_1_1 [decl #1900] theorem Function.Injective.addMonoid._proof_2 [decl #2000] theorem Lean.Grind.em [decl #2100] def List.Sublist.refl._f [decl #2200] theorem Multiset.sub_zero [decl #2300] theorem Finset.instSDiff._proof_1 [decl #2400] def Multiset.ndinsert [decl #2500] def _private.Mathlib.Data.List.Lattice.0.List.sublist_suffix_of_union.match_1_3 [decl #2600] def _private.Init.Data.List.Basic.0.List.instLawfulBEq.match_1 [decl #2700] theorem Int.Internal.Linear.Poly.denote_append [decl #2800] def Int.ble' [decl #2900] theorem List.bagInter.match_1.congr_eq_3 [decl #3000] theorem Classical.not_imp [decl #3100] def List.mem_map._f [decl #3200] def AddMonoidAlgebra.zero [decl #3300] theorem AddSubmonoid.add_mem [decl #3400] theorem Set.mem_image._simp_1 [decl #3500] theorem exists_exists_eq_and._simp_1 [decl #3600] theorem Lean.Grind.false_of_not_eq_self [decl #3700] theorem Finset.fold_cons [decl #3800] theorem AddMonoidAlgebra.singleAddHom_apply [decl #3900] theorem Finsupp.distribSMul._proof_1 [decl #4000] def AddEquiv.module [decl #4100] theorem Multiset.decidableDforallMultiset._proof_2 [decl #4200] theorem Bool.true_eq_false [decl #4300] def List.sigma [decl #4400] theorem List.Disjoint.symm [decl #4500] theorem Submodule.smul_mem' [decl #4600] theorem Finsupp.coe_neg [decl #4700] theorem AddGroupWithOne.intCast_ofNat [decl #4800] def BiheytingAlgebra.toCoheytingAlgebra [decl #4900] theorem inf_bot_eq [decl #5000] def SubMulAction.carrier [decl #5100] def Submodule.copy [decl #5200] theorem _private.Mathlib.Order.WithBot.0.WithBot.lt_def._proof_1_1 [decl #5300] theorem AddAction.orbitRel._proof_3 [decl #5400] def _private.Mathlib.Logic.Equiv.Defs.0.Equiv.exists_congr_right.match_1_1 [decl #5500] def _private.Mathlib.Algebra.Group.Monoid.0.add_nsmul.match_1_1 [decl #5600] def Con.instFunLikeForallProp [decl #5700] def Nat.Internal.elimOffset [decl #5800] theorem Function.Surjective.monoid._proof_1 [decl #5900] theorem AddCommGroup.toIntModule._proof_1 [decl #6000] theorem Equivalence.comap [decl #6100] theorem LinearMap.map_zero [decl #6200] theorem WithBot.decidableLT._proof_3 [decl #6300] theorem Mathlib.Tactic.Push.not_exists [decl #6400] def Commute [decl #6500] def IdemSemiring.toSemilatticeSup [decl #6600] def CategoryTheory.Limits.mapPair.match_3 [decl #6700] theorem LinearMap.toSpanSingleton._proof_1 [decl #6800] theorem _private.Mathlib.RingTheory.Ideal.Pointwise.0.Ideal.stabilizerEquiv._simp_1 [decl #6900] def Rat.instNatCast [decl #7000] theorem mul_lt_mul_of_pos_left [decl #7100] theorem IsOrderedAddMonoid.add_le_add_right [decl #7200] theorem IsAbsoluteValue.abv_sub_le [decl #7300] theorem _private.Mathlib.Algebra.Ring.Basic.0.noZeroDivisors_tfae._simp_1_4 [decl #7400] theorem isCauSeq_neg [decl #7500] def IsSMulApply.smul_apply._autoParam [decl #7600] def CauSeq.addGroupWithOne [decl #7700] def Pi.instPow [decl #7800] theorem Nat.gcd_mul_right [decl #7900] theorem _private.Init.Data.Nat.Lemmas.0.Nat.le_iff_lt_add_one._proof_1_1 [decl #8000] theorem Rat.mk_eq_normalize [decl #8100] def _private.Init.Data.Int.DivMod.Lemmas.0.Int.tdiv_neg.match_1_1 [decl #8200] theorem Decidable.not_and_iff_or_not [decl #8300] theorem CommGroupWithZero.inv_zero [decl #8400] theorem _private.Init.Data.Rat.Lemmas.0.Rat.nonneg_total._simp_1_1 [decl #8500] theorem AddUnits.add_neg [decl #8600] def NeZero.casesOn [decl #8700] theorem Lean.Grind.Semiring.toNatModule._proof_2 [decl #8800] theorem Lean.Grind.CommRing.Mon.beq'_eq [decl #8900] def Prod.lex [decl #9000] def Nat.Internal.Linear.Poly.denote_norm_go._f [decl #9100] theorem Lean.Grind.CommRing.instBEqMon.beq_spec_3 [decl #9200] def _private.Init.Grind.Module.Basic.0.Lean.Grind.IntModule.mul_zsmul.match_1_1 [decl #9300] theorem Lean.Grind.CommRing.Poly.pow.match_1.congr_eq_3 [decl #9400] def Lean.Grind.Linarith.Poly.combine._unary [decl #9500] def Lean.Grind.Linarith.le_lt_combine_cert [decl #9600] theorem CauSeq.lt_irrefl [decl #9700] theorem Real.mk_inf [decl #9800] theorem Disjoint.le_compl_right [decl #9900] theorem _private.Mathlib.Data.List.Nodup.0.List.Nodup.pmap._proof_1_1 [decl #10000] theorem List.nodup_finRange [… 2712 lines (172.4 KB) omitted …] [decl #276000] theorem pow_eq_pow_iff_of_ne_zero [decl #276100] def instUniformSpaceMulOpposite [decl #276200] theorem Matroid.restrict_contract_eq_contract_restrict [decl #276300] def _private.Mathlib.Order.GameAdd.0.Prod.gameAdd_swap_swap.match_1_1 [decl #276400] theorem Real.lt_rpow_inv_iff_of_pos [decl #276500] def USize.div [decl #276600] theorem _private.Mathlib.Data.Finset.PiInduction.0.Finset.induction_on_pi_of_choice._simp_1_1 [decl #276700] theorem SSet.spine_vertex [decl #276800] def WithOne.instInvolutiveInv [decl #276900] theorem QuotientGroup.norm_eq_groupSeminorm [decl #277000] theorem _private.Init.Data.Vector.OfFn.0.Vector.ofFnM_go_succ._proof_1_6 [decl #277100] theorem _private.Init.Data.Nat.Internal.SOM.0.Nat.Internal.SOM.Poly.mulMon_denote.go [decl #277200] theorem cfc_isStrictlyPositive_iff [decl #277300] def Lean.Elab.Do.instInhabitedMutVar [decl #277400] theorem ContRepresentation.invariants._proof_2 [decl #277500] def Lean.Parser.Term.doDbgTrace [decl #277600] theorem CauchyFilter.isSymm_gen [decl #277700] def Std.DTreeMap.Raw.get? [decl #277800] theorem _private.Mathlib.Analysis.SpecialFunctions.ContinuousFunctionalCalculus.Rpow.Basic.0.CStarAlgebra.nonneg_iff_eq_star_mul_self._proof_1_1 [decl #277900] theorem _private.Mathlib.Combinatorics.SimpleGraph.Subgraph.0.SimpleGraph.Subgraph.map_sup._simp_1_1 [decl #278000] theorem Quaternion.instNormedDivisionRingReal._proof_2 [decl #278100] def Profinite.NobelingProof.spanFunctor [decl #278200] theorem CategoryTheory.CechNerveTerminalFrom.wideCospan.limitCone._proof_4 [decl #278300] theorem Nat.mem_finMulAntidiag [decl #278400] theorem Aesop.Frontend.RuleSets.mk.inj [decl #278500] theorem CategoryTheory.Functor.IsDense.iff_of_iso [decl #278600] theorem _private.Mathlib.Data.Finset.Insert.0.Finset.pairwise_cons'._simp_1_2 [decl #278700] theorem ConvexOn.real_sSup_of_countable_affine_eq [decl #278800] def Lean.Language.SnapshotTree._sizeOf_inst [decl #278900] def AddConstEquiv.noConfusion [decl #279000] def _private.Mathlib.AlgebraicTopology.SimplicialSet.StrictSegal.0._auto_39 [decl #279100] theorem AddLocalization.liftOn_mk [decl #279200] theorem _private.Mathlib.Combinatorics.SimpleGraph.Paths.0.SimpleGraph.Walk.isPath_transfer._simp_1_1 [decl #279300] theorem _private.Mathlib.Algebra.MvPolynomial.Basic.0.MvPolynomial.coeffs_mul_X._simp_1_1 [decl #279400] theorem MvPolynomial.algebraTensorAlgEquiv_symm_comp_aeval [decl #279500] def Lean.Meta.Grind.instInhabitedActionResult.default [decl #279600] theorem _private.Mathlib.CategoryTheory.Galois.Decomposition.0.CategoryTheory.PreGaloisCategory.has_decomp_connected_components_aux._simp_1_3 [decl #279700] theorem CategoryTheory.PreGaloisCategory.endEquivSectionsFibers._proof_4 [decl #279800] theorem StandardEtalePair.homEquiv._proof_6 [decl #279900] theorem _private.Mathlib.Dynamics.TopologicalEntropy.CoverEntropy.0.Dynamics.IsDynCoverOf.iterate_le_pow._simp_1_3 [decl #280000] theorem CyclotomicField.instField._proof_27 [decl #280100] theorem CategoryTheory.PreZeroHypercover.sectionsSaturateEquiv._proof_3 [decl #280200] def AlgebraicGeometry.Scheme.pointSmallEtale [decl #280300] theorem CategoryTheory.Abelian.SpectralObject.p_opcyclesIso_inv_assoc [decl #280400] theorem SimpleGraph.turanGraph.eq_1 [decl #280500] theorem Std.Sat.AIG.denote.go_eq_of_isPrefix._unary [decl #280600] theorem Std.Sat.AIG.RefVec.map.go_le_size._unary INTERN_CALLS 5400000000 nodes=891112 [decl #280700] theorem Std.Tactic.BVDecide.BVExpr.bitblast.instLawfulVecOperatorShiftTargetBlastRotateRight [decl #280800] def Std.Tactic.BVDecide.BVExpr.bitblast.blastReplicate [decl #280900] def Std.Tactic.BVDecide.BVExpr.bitblast.blastArithShiftRight.go [decl #281000] def Lean.DeclarationRange.ofStringPositions [decl #281100] def PosNum.distrib [decl #281200] theorem _private.Mathlib.Geometry.Euclidean.Angle.Unoriented.TriangleInequality.0.InnerProductGeometry.inner_ortho_nonneg [decl #281300] def RootPairing.Hom.id [decl #281400] theorem CategoryTheory.Functor.FullyFaithful.mapAction._proof_4 [decl #281500] def Std.DTreeMap.Raw.getEntryLTD [decl #281600] theorem PresheafOfModulesOfCommRing.Derivation.Universal.mk.injEq [decl #281700] def AddGrpCat.instZeroHom [decl #281800] theorem CompareReals.uniformSpace._proof_2 [decl #281900] def CategoryTheory.Limits.FormalCoproduct.toFun [decl #282000] theorem SemidirectProduct.ext [decl #282100] def DividedPowers.SubDPIdeal.toIdeal [decl #282200] def CategoryTheory.Limits.zeroProdIso [decl #282300] def CategoryTheory.Triangulated.TStructure.triangleω₁δ [decl #282400] theorem _private.Mathlib.Analysis.Normed.Algebra.Exponential.0.SemiconjBy.exp_neg_mul_mul_exp_eq_self._simp_1_2 [decl #282500] theorem Quiver.SchreierGraph.map_smul_of_comp_labelling_eq [decl #282600] def Ordnode.size_eq_realSize._f [decl #282700] theorem _private.Mathlib.RingTheory.IntegralClosure.IsIntegralClosure.Basic.0.Polynomial.Monic.quotient_isIntegral._simp_1_1 [decl #282800] theorem isSelfNeg_neg [decl #282900] theorem CategoryTheory.Subfunctor.equalizer._proof_1 [decl #283000] def Lean.Kernel.Exception.declHasFVars.elim [decl #283100] theorem ZMod.sum_mul_div_add_sum_mul_div_eq_mul [decl #283200] theorem PartialEquiv.toEquiv._proof_4 [decl #283300] theorem MeasureTheory.Measure.withDensityᵥ._proof_1 [decl #283400] theorem Topology.IsQuotientMap.trivializationOfVAddDisjoint._proof_9 [decl #283500] theorem _private.Mathlib.RingTheory.Polynomial.Cyclotomic.Eval.0.Polynomial.eval_one_cyclotomic_not_prime_pow._simp_1_4 [decl #283600] theorem _private.Mathlib.Basic.Real.Embedding.0.Archimedean.ratLt_add._abel_1_1 [decl #283700] theorem _private.Mathlib.Algebra.MvPolynomial.Variables.0.MvPolynomial.aeval_ite_mem_eq_self._proof_1_1 [decl #283800] theorem Vector.getElem_mk [decl #283900] def Mathlib.Tactic.Ring.RingCompute.pow [decl #284000] theorem HNNExtension.t_mul_of [decl #284100] theorem CategoryTheory.Functor.mapDerivedCategoryFactorsh._proof_1 [decl #284200] def Aesop.Substitution.instOrd._private_1 [decl #284300] theorem ContinuousMultilinearMap.flipLinear._proof_2 [decl #284400] theorem Algebra.Presentation.differentials.comm₂₃' [decl #284500] theorem SimpleGraph.dist_le_diam [decl #284600] theorem SkewMonoidAlgebra.coeff_single_mul INTERN_CALLS 5500000000 nodes=6076379 INTERN_CALLS 5600000000 nodes=12530890 INTERN_CALLS 5700000000 nodes=19097362 INTERN_CALLS 5800000000 nodes=25679412 INTERN_CALLS 5900000000 nodes=32143974 INTERN_CALLS 6000000000 nodes=38630598 INTERN_CALLS 6100000000 nodes=45138320 INTERN_CALLS 6200000000 nodes=51533052 INTERN_CALLS 6300000000 nodes=58097923 INTERN_CALLS 6400000000 nodes=64691970 INTERN_CALLS 6500000000 nodes=71123127 INTERN_CALLS 6600000000 nodes=77671209