Checker "kiota" on test "std"
Checker: kiota · Version: 0.1.0 · 📄 Declaration · 🔗 Source
Test: std · Expected: 👍 accept · Size: 557.2 MB · Lines: 10.6 M · lean4export: 3.1.0 · Lean: 4.36.0 · Timeout: 10.0 min · 📄 Declaration · 🔗 Source
Result: 👍 accepted · exit code 0 · wall time: 2.12 min · instructions: 723.1 G · max rss memory: 2.5 GB · run 2026-11-22 02:28:12 UTC
stderr:
[decl #100] def Bool.beq [decl #200] def Nat.mod [decl #300] theorem Nat.add_succ [decl #400] def _private.Init.Prelude.0.Nat.modCore_lt.match_1_1 [decl #500] theorem _private.Init.Data.Order.Lemmas.0.Std.instSymmEqBoolBeqTrueOfLawfulOrderBEq._simp_1 [decl #600] def _private.Init.SimpLemmas.0.or_self.match_1_1 [decl #700] theorem Nat.mod_eq_sub_mod [decl #800] theorem _private.Init.Data.Nat.Internal.Linear.0.Nat.Internal.Linear.Poly.isZero.match_1.eq_2 [decl #900] theorem Nat.div_lt_iff_lt_mul [decl #1000] def Lean.Omega.UpperBound.sat [decl #1100] def _private.Init.Data.Int.Order.0.Int.lt_iff_le_and_ne.match_1_1 [decl #1200] def _private.Init.Data.Int.Order.0.Int.ofNat_le.match_1_3 [decl #1300] theorem Int.one_mul [decl #1400] theorem Lean.Omega.Constraint.scale_sat [decl #1500] theorem Nat.dvd_mul_right [decl #1600] theorem Int.negSucc_lt_zero [decl #1700] def Lean.Omega.LinearCombo.smul [decl #1800] theorem Decidable.of_not_imp [decl #1900] def _private.Init.Data.List.Lemmas.0.List.set_set.match_1_1 [decl #2000] theorem List.drop_of_length_le [decl #2100] def Std.HashMap.Raw.get? [decl #2200] def _private.Init.Data.List.Lemmas.0.List.getElem_set_ne.match_1_1 [decl #2300] theorem Std.Internal.List.getEntry?_cons_of_true [decl #2400] def List.Pairwise.casesOn [decl #2500] theorem Std.DHashMap.Internal.Raw₀.toListModel_buckets_emptyWithCapacity [decl #2600] theorem Std.Internal.List.getEntry?_of_perm [decl #2700] theorem List.Sublist.refl [decl #2800] theorem Std.DHashMap.Internal.Raw₀.getThenInsertIfNew?_eq_insertIfNewₘ [decl #2900] def Std.Internal.List.alterKey [decl #3000] theorem Std.DHashMap.Internal.AssocList.Const.modify_eq_alter [decl #3100] def Std.DHashMap.Internal.Raw₀.getKeyₘ [decl #3200] theorem _private.Std.Data.DTreeMap.Internal.Operations.0.Std.DTreeMap.Internal.Impl.minView._proof_14 [decl #3300] def Std.DTreeMap.Internal.Impl.doubleR [decl #3400] def Lean.Data.AC.ContextInformation.isIdem [decl #3500] theorem _private.Std.Data.DTreeMap.Internal.Balancing.0.Std.DTreeMap.Internal.Impl.balanced_rotateL._proof_1_2 [decl #3600] theorem _private.Std.Data.DTreeMap.Internal.Operations.0.Std.DTreeMap.Internal.Impl.insert._proof_27 [decl #3700] theorem Std.DTreeMap.Internal.Impl.glue._proof_12 [decl #3800] theorem _private.Std.Data.DTreeMap.Internal.Operations.0.Std.DTreeMap.Internal.Impl.alter._proof_31 [decl #3900] theorem Nat.add_lt_add_iff_left._simp_1 [decl #4000] theorem _private.Std.Data.DTreeMap.Internal.Operations.0.Std.DTreeMap.Internal.Impl.link._proof_27 [decl #4100] theorem Std.DTreeMap.Internal.Impl.link2.eq_def [decl #4200] theorem Std.DHashMap.Internal.Raw₀.getKey?_eq_getKey?ₘ [decl #4300] theorem forall_self_imp [decl #4400] def Std.Sat.AIG.instDecidableEqDecl.decEq [decl #4500] def Std.Tactic.BVDecide.BVExpr.noConfusionType [decl #4600] theorem Std.Tactic.BVDecide.BVExpr.append.inj [decl #4700] def Std.DTreeMap.Internal.Impl.getKey.match_1 [decl #4800] theorem _private.Init.PropLemmas.0.exists_and_right._simp_1_1 [decl #4900] theorem Classical.not_not._simp_1 [decl #5000] theorem Std.DTreeMap.Internal.Impl.updateCell._proof_42 [decl #5100] theorem Std.DTreeMap.Internal.Impl.containsThenInsert.eq_1 [decl #5200] theorem Bool.not_not [decl #5300] theorem List.attach_map_val [decl #5400] def Std.Packages.LinearPreorderOfLEArgs.isLE_compare._autoParam [decl #5500] theorem _private.Init.Data.Ord.Basic.0.lt_iff_not_gt_and_ne_of_antisymm_of_total_of_not_le._simp_1_1 [decl #5600] def ULift.casesOn [decl #5700] theorem Quot.inductionOn [decl #5800] def Std.ExtTreeMap.getKey! [decl #5900] def Lean.Grind.CommRing.instBEqMon.beq.match_1 [decl #6000] def _private.Init.Data.Array.Lemmas.0.Array.any_toList.match_1_4 [decl #6100] theorem _private.Init.Data.Nat.Bitwise.Lemmas.0.Nat.exists_testBit_ne_of_ne._simp_1_3 [decl #6200] def BitVec.zero [decl #6300] theorem Array.toList_append [decl #6400] theorem BitVec.getElem_append._proof_2 [decl #6500] theorem UInt8.toNat_toBitVec [decl #6600] def UInt8.toFin [decl #6700] theorem Char.utf8Size_le_four [decl #6800] theorem _private.Init.Data.BitVec.Lemmas.0.BitVec.extractLsb'_append_eq_ite._proof_1_7 [decl #6900] theorem BitVec.ushiftRight_zero [decl #7000] theorem BitVec.getElem_cons._proof_2 [decl #7100] theorem ByteArray.extract_add_four [decl #7200] theorem List.utf8Encode_singleton [decl #7300] theorem _private.Init.Data.ByteArray.Lemmas.0.ByteArray.append_right_inj._simp_1_1 [decl #7400] theorem _private.Init.Data.String.Decode.0.UInt8.isUTF8FirstByte_getElem_utf8EncodeChar._simp_1_4 [decl #7500] theorem Std.DHashMap.Const.get?_eq_some_get [decl #7600] def Array.foldrM.fold [decl #7700] def _private.Init.Data.Int.DivMod.Lemmas.0.Int.tdiv_eq_ediv_of_nonneg.match_1_1 [decl #7800] theorem Nat.gcd_comm [decl #7900] theorem Lean.Grind.AddCommGroup.neg_neg [decl #8000] def ForInStep.casesOn [decl #8100] theorem _private.Std.Data.Internal.List.Associative.0.Std.Internal.List.insertList.eq_2 [decl #8200] theorem _private.Init.Data.Array.MapIdx.0.Array.mapFinIdx_induction._proof_1_7 [decl #8300] def Std.Sat.AIG.BinaryRefVec.rhs [decl #8400] def Std.Tactic.BVDecide.BoolExpr.casesOn [decl #8500] theorem Nat.max_eq_left [decl #8600] theorem Std.Rxc.LawfulHasSize.size_eq_succ_of_succ?_eq_some [decl #8700] def Std.IterM.toArray_eq_match_step.match_1 [decl #8800] theorem Std.Rxo.Iterator.isPlausibleSuccessorOf_iff [decl #8900] def Int8.toInt [decl #9000] theorem _private.Init.Data.Range.Polymorphic.Internal.SignedBitVec.0.BitVec.Signed.sle_iff_rotate_le_rotate._proof_1_14 [decl #9100] theorem _private.Init.Data.Range.Polymorphic.SInt.0.Int8.instUpwardEnumerable_eq._simp_1_1 [decl #9200] theorem _private.Init.Data.Int.DivMod.Lemmas.0.Int.emod_eq_iff._proof_1_2 [decl #9300] theorem _private.Init.Data.Range.Polymorphic.Internal.SignedBitVec.0.BitVec.Signed.instRxcLawfulHasSize._simp_9 [decl #9400] def Inter.inter [decl #9500] def String.Slice.Pattern.StrictBackwardPattern.casesOn [decl #9600] theorem Std.DTreeMap.isEmpty_insertIfNew [decl #9700] theorem _private.Init.Data.List.ToArray.0.List.forIn'_loop_toArray._proof_1_8 [decl #9800] theorem instLinearOrderPackageUInt8._proof_4 [decl #9900] theorem Array.findIdx_eq_size_of_false [decl #10000] theorem Ordering.then_self [… 806 lines (50.6 KB) omitted …] [decl #90200] theorem Std.ExtTreeMap.nodup_keys [decl #90300] theorem Int.toList_roc_eq_cons [decl #90400] theorem List.minIdxOn?_cons [decl #90500] def Std.Rco.HasRcoIntersection.mk.noConfusion [decl #90600] theorem Std.Time.Internal.UnitVal.ofInt.injEq [decl #90700] theorem Std.ExtHashMap.mem_ofList [decl #90800] theorem Bool.not_not_eq [decl #90900] theorem USize.ofNatClamp_uInt16ToNat [decl #91000] theorem List.head_insert [decl #91100] theorem Array.mapIdx_eq_replicate_iff [decl #91200] def Lean.Parser.timeCmd [decl #91300] theorem Lean.Omega.IntList.set_nil_succ [decl #91400] def _private.Init.Data.FloatArray.Basic.0.List.toFloatArray.match_1 [decl #91500] theorem Std.ExtHashSet.get?_inter_of_not_mem_left [decl #91600] def _private.Init.Data.Array.InsertionSort.0.Array.insertionSort.swapLoop.match_1 [decl #91700] theorem Std.Sat.CNF.append_assoc [decl #91800] def Lean.SourceInfo.original.noConfusion [decl #91900] def Std.Http.Internal.ChunkedBuffer.ofByteArray [decl #92000] theorem Std.Http.URI.Builder.mk.inj [decl #92100] theorem USize.toFin_ofNatTruncate_of_lt [decl #92200] theorem UInt8.intCast_neg [decl #92300] theorem Vector.or_all_distrib_right [decl #92400] def Std.MinEqOr.casesOn [decl #92500] theorem Std.Http.Protocol.H1.PulledChunk.mk.sizeOf_spec [decl #92600] theorem Lean.Grind.CommRing.Expr.natCast.sizeOf_spec [decl #92700] def Std.Slice.Internal.ByteSliceData._sizeOf_inst [decl #92800] theorem _private.Init.Data.String.Lemmas.Lossy.0.String.fromUTF8Lossy_surrogate_append._proof_1_7 [decl #92900] theorem ReaderT.run_seq [decl #93000] theorem Fin.mul_zero [decl #93100] def Lean.Grind.Config.ctorIdx [decl #93200] theorem Vector.hmul_zero [decl #93300] def Std.ExtTreeMap.unitOfArray._auto_1 [decl #93400] theorem Int8.add_eq_right [decl #93500] theorem Vector.getElem_unattach [decl #93600] theorem _private.Init.Data.Fin.Lemmas.0.Fin.castLE_zero._simp_1_1 [decl #93700] theorem Int32.toInt8_toInt64 [decl #93800] def Std.Tactic.BVDecide.BVExpr.instToString [decl #93900] theorem Std.TreeSet.getD_diff [decl #94000] theorem _private.Std.Data.ExtDHashMap.Lemmas.0.Std.ExtDHashMap.ofList_eq_empty_iff._simp_1_2 [decl #94100] theorem Std.Http.Body.Empty.mk.sizeOf_spec [decl #94200] theorem Std.Tactic.BVDecide.Reflect.Bool.and_congr [decl #94300] def OrElse.recOn [decl #94400] theorem Int16.toInt8_ofIntTruncate [decl #94500] def Std.Time.PlainDate.fromAmericanDateString [decl #94600] def Std.Time.instInhabitedDayPeriod.default [decl #94700] theorem ISize.toUSize_ofBitVec [decl #94800] theorem Lean.Grind.CommRing.Mon.denoteAsIntModule.eq_1 [decl #94900] theorem Int8.ofBitVec_sub [decl #95000] theorem Std.ExtDHashMap.Const.getKey?_ofList_of_mem [decl #95100] def Lean.Parser.Tactic.Grind.showTerm [decl #95200] theorem Array.foldl_push_eq_append [decl #95300] theorem _private.Init.Data.String.Lemmas.Slice.0.String.Pos.get?_eq_dite._simp_1_1 [decl #95400] def Std.Http.Request.Builder.extension [decl #95500] theorem Std.PRange.UpwardEnumerable.succMany?_succ?_eq_succ?_bind_succMany? [decl #95600] theorem Vector.contains_push [decl #95700] def Lean.Syntax.getTrailing? [decl #95800] def term_==_ [decl #95900] theorem Function.comp_const [decl #96000] def Nat.toInt64 [decl #96100] theorem Array.getElem?_size [decl #96200] theorem Vector.append_le_append_iff [decl #96300] def Std.Rii.recOn [decl #96400] theorem Int16.toInt8_and [decl #96500] def IO.CancelToken.set [decl #96600] theorem UInt64.toUInt16_add [decl #96700] theorem Int32.toBitVec_abs [decl #96800] theorem Option.all_attach [decl #96900] theorem _private.Init.Data.Int.DivMod.Lemmas.0.Int.fmod_sub_cancel_left._simp_1_1 [decl #97000] def Std.Time.Week.instDecidableLeOffset._aux_1 [decl #97100] theorem Nat.toArray_ric_succ_eq_push [decl #97200] theorem _private.Init.Data.UInt.Lemmas.0.UInt64.toUInt16_le._simp_1_1 [decl #97300] theorem Std.Time.DayPeriod.midnight.sizeOf_spec [decl #97400] theorem _private.Init.Data.SInt.Bitwise.0.Int32.shiftLeft_zero._simp_1_1 [decl #97500] def Std.Http.Body.Any.recOn [decl #97600] theorem Function.LeftInverse.eq_1 [decl #97700] opaque Float.cbrt [decl #97800] theorem Lean.Sym.not_false_eq [decl #97900] def String.Slice.RevByteIterator.ctorIdx [decl #98000] theorem Std.TreeMap.Raw.inter_equiv_empty_comm [decl #98100] def Std.Iterators.ProductivenessRelation._sizeOf_1 [decl #98200] theorem Float.Model.UnpackedFloat.packedInfinity.eq_1 [decl #98300] theorem Std.TreeSet.Equiv.forM_eq [decl #98400] theorem _private.Std.Http.Data.Status.0.Std.Http.CustomStatus.ofCodeAndPhrase?._proof_2 [decl #98500] theorem Std.Tactic.BVDecide.Normalize.Bool.not_one_beq [decl #98600] def Std.Tactic.BVDecide.BVBinPred.instToString [decl #98700] theorem _private.Std.Do.Triple.SpecLemmas.0.Std.Do.Spec.restoreM_OptionT._simp_1_1 [decl #98800] theorem Sum.eq_left_getLeft_of_isLeft [decl #98900] theorem Std.DHashMap.Internal.Raw₀.Const.mem_toArray_iff_getKey?_eq_some_and_get?_eq_some [decl #99000] theorem recSubsingleton INTERN_CALLS 600000000 nodes=2824405 [decl #99100] theorem Fin.exists_fin_two [decl #99200] theorem Nat.zero_lt_getElem!_toArray_rcc_iff [decl #99300] theorem Int.instLinearOrderPackage._proof_1 [decl #99400] theorem Fin.exists_castSucc_eq [decl #99500] theorem Vector.take_mk._proof_1 [decl #99600] def Std.Iterator.mk.noConfusion [decl #99700] theorem UInt32.toUInt32_toUInt16 [decl #99800] def IO.instToStringTaskState [decl #99900] theorem Lean.Meta.TransparencyMode.none.sizeOf_spec [decl #100000] theorem Std.TreeMap.Raw.nodup_keys