Checker "kiota" on test "cslib"
Checker: kiota · Version: 0.1.0 · 📄 Declaration · 🔗 Source
Test: cslib · Expected: 👍 accept · Size: 2.3 GB · Lines: 44.1 M · lean4export: 3.1.0 · Lean: 4.36.0 · Timeout: 26.7 min · 📄 Declaration · 🔗 Source
Result: 👍 accepted · exit code 0 · wall time: 11.9 min · instructions: 3.5 T · max rss memory: 3.4 GB · run 2026-11-22 02:28:12 UTC
stderr:
[decl #100] theorem _private.Init.Data.List.Perm.0.List.Perm.mem_iff._simp_1_2 [decl #200] def Multiset.instMembership [decl #300] theorem not_false_eq_true [decl #400] def instLTNat [decl #500] def Nat.div.go [decl #600] def Int.negOfNat [decl #700] theorem Or.resolve_right [decl #800] def Prod.fst [decl #900] def Nat.sub_self._f [decl #1000] theorem Lean.Omega.IntList.gcd_eq_zero [decl #1100] theorem Int.add_le_add_left [decl #1200] def Lean.Omega.positivizeConstraint [decl #1300] def GetElem?.getElem? [decl #1400] def Lean.Name.mkStr4 [decl #1500] theorem Exists.imp [decl #1600] theorem Multiset.filter._proof_1 [decl #1700] theorem exists_eq_left'._simp_1 [decl #1800] theorem Lean.Grind.not_and [decl #1900] def _private.Init.Data.AC.0.Lean.Data.AC.evalList.match_1.splitter._sparseCasesOn_3 [decl #2000] def Int.Internal.Linear.Expr.toPoly'.go.match_1 [decl #2100] theorem Lean.Grind.CommRing.mul_comm [decl #2200] def List.reverseAux [decl #2300] def Nat.properDivisors [decl #2400] theorem not_exists [decl #2500] def AddCommMonoid.toAddCommSemigroup [decl #2600] theorem List.mem_range'_1._simp_1 [decl #2700] theorem zero_smul [decl #2800] theorem zero_nsmul [decl #2900] def OneHom.casesOn [decl #3000] theorem RingHomInvPair.comp_apply_eq₂ [decl #3100] theorem Submodule.map_span [decl #3200] def Set.instBooleanAlgebra [decl #3300] theorem Submodule.isGLB_sInf [decl #3400] def WithBot.instLE [decl #3500] theorem instDistribLatticeOfLinearOrder._proof_3 [decl #3600] def Equiv.left_inv._autoParam [decl #3700] def Function.Injective.addMonoid [decl #3800] theorem Equiv.subtypeEquiv._proof_2 [decl #3900] theorem AddCon.addMonoid._proof_4 [decl #4000] def NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring [decl #4100] def _private.Mathlib.Data.Int.Cast.Basic.0.Int.cast_neg.match_1_1 [decl #4200] theorem Function.Surjective.rightDistribClass [decl #4300] def RingCon.instSubQuotient [decl #4400] theorem AddCon.ker._proof_1 [decl #4500] theorem AddMonoidAlgebra.coeffEquiv._proof_2 [decl #4600] theorem Decidable.eq_or_ne [decl #4700] theorem List.Perm.subperm_left [decl #4800] theorem Multiset.add_le_add_iff_left [decl #4900] def _private.Init.Data.List.Sublist.0.List.sublist_append_right.match_1_1 [decl #5000] theorem List.suffix_union_right [decl #5100] theorem Multiset.filter_le_filter [decl #5200] theorem Multiset.count_pos [decl #5300] theorem Finsupp.support_onFinset_subset [decl #5400] theorem completeLatticeOfInf._proof_4 [decl #5500] theorem ite_eq_ite [decl #5600] theorem Finsupp.distribSMul._proof_2 [decl #5700] def Nat.instAddSemigroup [decl #5800] theorem _private.Mathlib.Data.Finset.Lattice.Fold.0.Finset.sup_lt_iff._simp_1_2 [decl #5900] theorem trans [decl #6000] theorem Units.commute_coe_inv [decl #6100] def MeasurableSpace.instPartialOrder [decl #6200] def Lean.instHashableName [decl #6300] theorem _private.Std.Data.DTreeMap.Internal.Operations.0.Std.DTreeMap.Internal.Impl.insert._proof_12 [decl #6400] def Std.IsPreorder.of_le._auto_3 [decl #6500] theorem _private.Std.Data.DTreeMap.Internal.Balancing.0.Std.DTreeMap.Internal.Impl.balanced_doubleL._proof_1_1 [decl #6600] theorem Std.DTreeMap.Internal.Impl.insert._proof_29 [decl #6700] theorem _private.Std.Data.DTreeMap.Internal.Operations.0.Std.DTreeMap.Internal.Impl.maxView._proof_3 [decl #6800] theorem Std.DTreeMap.Internal.Impl.alter._proof_33 [decl #6900] def Nat.Internal.Linear.Poly.isNum?._sparseCasesOn_1 [decl #7000] def Std.DTreeMap.Internal.Impl.link.match_1 [decl #7100] def Lean.LocalInstances [decl #7200] def _private.Init.Data.Nat.Lemmas.0.Nat.zero_shiftRight.match_1_1 [decl #7300] theorem USize.toNat_ofNat_of_lt' [decl #7400] theorem _private.Init.Data.Nat.Power2.Lemmas.0.Nat.nextPowerOfTwo.go.eq_def [decl #7500] def Std.DHashMap.Internal.AssocList.length [decl #7600] def Nat.lor [decl #7700] def Std.Packages.LinearOrderOfLEArgs.min_eq._autoParam [decl #7800] theorem instLinearOrderPackageUSize._proof_2 [decl #7900] theorem Nat.shiftLeft_eq [decl #8000] def List.any.match_1 [decl #8100] theorem instLinearOrderPackageUInt16._proof_2 [decl #8200] def DivInvOneMonoid.toInvOneClass [decl #8300] def MulDistribMulAction.toMonoidHom [decl #8400] theorem Option.map₂_some_some [decl #8500] def Field.toNNRatCast [decl #8600] def Covariant [decl #8700] theorem lt_imp_lt_of_le_of_le [decl #8800] theorem AbsoluteValue.pos [decl #8900] theorem List.tfae_cons_of_mem [decl #9000] theorem nonpos_iff_eq_zero [decl #9100] theorem Pi.addGroupWithOne._proof_9 [decl #9200] theorem Pi.semiring._proof_7 [decl #9300] def _private.Mathlib.Algebra.Order.CauSeq.Basic.0.CauSeq.mul_limZero_right.match_1_1 [decl #9400] theorem Int.ediv.eq_4 [decl #9500] theorem Nat.gcd_ne_zero_right [decl #9600] theorem Int.mul_right_comm [decl #9700] theorem Rat.divInt_one_one [decl #9800] theorem instDecidableForall._proof_1 [decl #9900] def Rat.instLattice [decl #10000] theorem abs.eq_1 [… 3808 lines (228.4 KB) omitted …] [decl #387800] theorem _private.Init.Data.UInt.Bitwise.0.UInt16.xor_left_inj._simp_1_1 [decl #387900] theorem instDecidableEqSigma._proof_2 [decl #388000] theorem _private.Init.Data.List.Lemmas.0.List.flatten_filter_ne_nil._simp_1_1 [decl #388100] theorem Filter.bot_ne_hyperfilter [decl #388200] def Lean.PrettyPrinter.Delaborator.ParamKind._sizeOf_1 [decl #388300] theorem Std.TreeSet.max!_erase_le_max! [decl #388400] theorem _private.Mathlib.LinearAlgebra.Basis.VectorSpace.0.exists_basis_of_pairing_ne_zero._simp_1_3 [decl #388500] theorem NNReal.coe_nnqsmul [decl #388600] theorem Finset.HasAntidiagonal.nonempty_antidiagonal [decl #388700] theorem AddEquiv.toNatLinearEquiv_toAddEquiv [decl #388800] theorem Nat.choose_middle_le_pow [decl #388900] theorem exists_nsmul_eq_self_of_coprime [decl #389000] theorem NonUnitalAlgebra.coe_inf [decl #389100] theorem Nat.isNone_getElem?_toArray_rcc_eq [decl #389200] theorem AEMeasurable.add_measure [decl #389300] theorem Int8.or_eq_zero_iff [decl #389400] theorem Set.monotoneOn_or_antitoneOn_iff_uIcc [decl #389500] theorem _private.Mathlib.LinearAlgebra.SesquilinearForm.Basic.0.LinearMap.isOrthogonal_of_forall_apply_same._simp_1_4 [decl #389600] theorem _private.Init.Data.Vector.Lemmas.0.Vector.rightpad_mk._proof_1 [decl #389700] theorem Real.toNNReal_lt_one [decl #389800] theorem _private.Init.Data.UInt.Bitwise.0.UInt32.shiftRight_and._simp_1_1 [decl #389900] theorem Batteries.BinomialHeap.Imp.HeapNode.node.injEq [decl #390000] theorem Subgroup.coe_toAddSubgroup_apply [decl #390100] def Lean.Lsp.ParameterInformationLabel.range.elim [decl #390200] theorem Finset.card_le_six [decl #390300] theorem UpperSet.coe_mk [decl #390400] theorem Std.TreeMap.getKey?_insert_self [decl #390500] theorem Language.Hom.ext_iff [decl #390600] theorem Submonoid.mulSupport_map [decl #390700] theorem _private.Mathlib.Analysis.InnerProductSpace.Rayleigh.0.LinearMap.IsSymmetric.hasEigenvalue_iInf_of_finiteDimensional._simp_1_1 [decl #390800] def Lean.Meta.InfoCacheKey.ctorIdx [decl #390900] def instReprIterator [decl #391000] def Lean.Server.FileWorker.NamespaceEntry._sizeOf_inst [decl #391100] theorem eq_true_eq_id [decl #391200] theorem topologicalGroup_induced [decl #391300] def UInt64.reduceToNat [decl #391400] theorem ENNReal.ofReal_nsmul [decl #391500] def UInt64.reduceOfNat [decl #391600] theorem Function.Semiconj.injOn_preimage [decl #391700] def Lean.Meta.Sym.Arith.ClassifyResult.recOn [decl #391800] theorem Equiv.optionCongr_one [decl #391900] theorem RCLike.nnnorm_nsmul [decl #392000] theorem Std.DTreeMap.Internal.Impl.getKeyLT!_eq_get!_getKeyLT? [decl #392100] def omegaToLiaRegressions [decl #392200] theorem DFinsupp.prod_eq_zero_iff [decl #392300] theorem WithBot.eq_of_forall_le_coe_iff [decl #392400] theorem Array.not_lt_iff_ge [decl #392500] theorem _private.Mathlib.Algebra.Order.BigOperators.Group.List.0.List.sum_pos._proof_1_5 [decl #392600] def _private.Init.Data.List.Impl.0.List.intercalate_eq_intercalateTR.go._f [decl #392700] def _private.Mathlib.Algebra.Order.AbsoluteValue.Basic.0.IsAbsoluteValue.Mathlib.Meta.Positivity.evalAbv.match_4 [decl #392800] theorem instHasUniqueDivAdditiveOfHasUniqueRoots [decl #392900] def ImportGraph.Shake.HTransClosure.recOn [decl #393000] theorem Complex.norm_natCast_cpow_pos_of_pos [decl #393100] theorem Lean.Sym.UInt64.le_eq_true [decl #393200] theorem LinearIsometryEquiv.inv_def [decl #393300] def CStarAlgebra.recOn [decl #393400] theorem Vector.extract_append_right [decl #393500] theorem Aesop.EqualUpToIds.MVarValue.delayedAssignment.injEq [decl #393600] theorem Filter.Tendsto.iterate [decl #393700] theorem AlgEquiv.toRingEquiv_toRingHom [decl #393800] theorem MonotoneOn.countable_setOf_two_preimages [decl #393900] theorem Lean.StructureFieldInfo.mk.injEq [decl #394000] theorem Int.neg_nat_succ [decl #394100] theorem ciSup_eq_top_of_top_mem [decl #394200] theorem MeasureTheory.SimpleFunc.ext_iff INTERN_CALLS 3200000000 nodes=2755361 [decl #394300] theorem UInt64.toBitVec_zero [decl #394400] def ShareCommon.StateFactoryBuilder._sizeOf_1 [decl #394500] theorem MonoidAlgebra.of.eq_1 [decl #394600] theorem Order.succ_eq_zero [decl #394700] theorem BitVec.instLawfulCommIdentityHOrOfNatOfNatNat [decl #394800] theorem Homeomorph.empty._proof_1 [decl #394900] def Lean.JsonRpc.instBEqNotification [decl #395000] theorem affineIndependent_def [decl #395100] theorem toLex_sub [decl #395200] theorem Std.ExtTreeSet.isEmpty_toList [decl #395300] theorem Std.TreeSet.getD_eq_of_mem [decl #395400] theorem _private.Std.Data.ExtDTreeMap.Lemmas.0.Std.ExtDTreeMap.toList_eq_nil_iff._simp_1_1 [decl #395500] theorem Finset.sum_range_succ_sub_top [decl #395600] def Lean.Meta.modifyPostponed [decl #395700] theorem UniformEquiv.comp_uniformContinuous_iff' [decl #395800] def _private.Init.Data.Nat.Internal.Linear.0.Nat.Internal.Linear.Poly.denote_cons.match_1_1 [decl #395900] theorem _private.Init.Data.List.Nat.Erase.0.List.getElem?_eraseIdx_of_ge._simp_1_1 [decl #396000] theorem Cslib.Logic.PL.NaturalDeduction.Derivation.efq.injEq [decl #396100] theorem List.Subperm.idxInj_injective [decl #396200] def Lean.Parser.Attr.specialize.formatter [decl #396300] theorem Lean.Elab.CommandInfo.mk.sizeOf_spec [decl #396400] theorem Submodule.orderIsoMapComapOfBijective_symm_apply [decl #396500] def Std.Time.Nanosecond.Offset.ofSeconds [decl #396600] theorem Con.ker_eq_lift_of_injective [decl #396700] theorem Matrix.transposeᵣ.eq_2 [decl #396800] theorem AddSubsemigroup.coe_topologicalClosure [decl #396900] theorem Lean.Lsp.SemanticTokenModifier.documentation.sizeOf_spec [decl #397000] theorem Set.singletonMonoidHom.eq_1 [decl #397100] def CFC.nnrpow_eq_nnrpow_prod._auto_1 [decl #397200] theorem _private.Mathlib.LinearAlgebra.Matrix.SchurComplement.0.Matrix.inv_fromBlocks_zero₂₁_of_isUnit_iff._simp_1_1 [decl #397300] theorem Function.Embedding.image_apply [decl #397400] theorem String.Slice.dropEndWhile_char_eq_dropEndWhile_beq [decl #397500] theorem Lean.Meta.Grind.AC.EqCnstrProof.simp_middle.injEq [decl #397600] def _private.Init.Data.Nat.ToString.0.Nat.digitChar_ne.match_1_1