Checker "kiota" on test "init"
Checker: kiota · Version: 0.1.0 · 📄 Declaration · 🔗 Source
Test: init · Expected: 👍 accept · Size: 331.7 MB · Lines: 6.5 M · lean4export: 3.1.0 · Lean: 4.36.0 · Timeout: 6.17 min · 📄 Declaration · 🔗 Source
Result: 👍 accepted · exit code 0 · wall time: 55.4 s · instructions: 375.8 G · max rss memory: 2.4 GB · run 2026-11-22 02:28:12 UTC
stderr:
[decl #100] theorem congrArg [decl #200] def _private.Init.Prelude.0.Nat.lt_or_ge.match_1_3 [decl #300] def decidable_of_decidable_of_iff [decl #400] def Std.Roc.toArray [decl #500] theorem Nat.lt_of_succ_lt_succ [decl #600] def _private.Init.Data.Int.Order.0.Int.lt.dest.match_1_1 [decl #700] theorem Int.le.intro [decl #800] def Membership.mem [decl #900] def _private.Init.Data.Nat.Dvd.0.Nat.dvd_trans.match_1_1 [decl #1000] theorem Nat.add_le_add_right [decl #1100] theorem Int.natCast_ediv [decl #1200] theorem Decidable.of_not_not [decl #1300] def String.rawEndPos [decl #1400] theorem Int.max_def [decl #1500] theorem Std.Rxc.IsAlwaysFinite.finite [decl #1600] def List.length_drop._f [decl #1700] theorem Std.Rxo.instIteratorIteratorIdOfUpwardEnumerableOfDecidableLT._proof_1 [decl #1800] def Option.get [decl #1900] theorem _private.Init.Data.Range.Polymorphic.Lemmas.0.Std.Internal.iter_roo_eq_iter_rco_of_isSome_succ? [decl #2000] theorem Std.le_refl._simp_1 [decl #2100] theorem String.Pos.Raw.isValidForSlice_rawEndPos [decl #2200] def Std.Packages.LinearOrderOfLEArgs.toLinearPreorderOfLEArgs [decl #2300] theorem _private.Init.Data.String.Lemmas.Order.0.String.Slice.Pos.offset_lt_rawEndPos_iff._simp_1_2 [decl #2400] theorem decide_false [decl #2500] def Nat.Internal.Linear.Poly.denote_append._f [decl #2600] theorem _private.Init.Data.Nat.Bitwise.Lemmas.0.Nat.testBit_two_pow_mul_add._simp_1_4 [decl #2700] theorem Lean.Grind.CommRing.Mon.revlexWF._unary._proof_3 [decl #2800] def List.getElem_mem._f [decl #2900] def Ordering.swap [decl #3000] def String.Slice.Pos.ofStr [decl #3100] theorem _private.Init.Data.String.Defs.0.String.exists_eq_ofList._simp_1_1 [decl #3200] theorem ByteArray.extract_same [decl #3300] theorem UInt8.toBitVec_and [decl #3400] def UInt32.lor [decl #3500] theorem ByteArray.utf8DecodeChar?._proof_8 [decl #3600] theorem BitVec.shiftLeft_or_distrib [decl #3700] theorem Bool.or_comm [decl #3800] theorem Array.getElem_append._proof_2 [decl #3900] theorem BitVec.toNat_twoPow [decl #4000] theorem Nat.testBit_mul_two_pow [decl #4100] theorem _private.Init.Data.String.Decode.0.ByteArray.utf8DecodeChar?.isUTF8ContinuationByte_getElem_utf8EncodeChar_one_of_utf8Size_eq_four [decl #4200] theorem Array.extract_extract [decl #4300] theorem ByteArray.isValidUTF8_utf8Encode_singleton_append_iff [decl #4400] def _private.Init.Data.String.Decode.0.UInt8.isUTF8FirstByte_getElem_utf8EncodeChar.match_1_5 [decl #4500] theorem Int.neg_eq_comm [decl #4600] theorem Int.natCast_pos [decl #4700] theorem Lean.Grind.Ring.intCast_sub [decl #4800] theorem List.mapFinIdx._proof_4 [decl #4900] theorem Vector.eq_mk [decl #5000] theorem String.Pos.Raw.offsetBy_zero_left [decl #5100] theorem Array.toArray_eq_append_iff [decl #5200] theorem _private.Init.Data.Range.Polymorphic.Lemmas.0.Std.Rco.toList_succ_succ_eq_map._simp_1_1 [decl #5300] theorem BitVec.add_zero [decl #5400] def _private.Init.Data.Range.Polymorphic.SInt.0.Int8.instHasModelBitVecOfNatNat [decl #5500] theorem Int.emod_sub_emod [decl #5600] theorem _private.Init.Data.Range.Polymorphic.Internal.SignedBitVec.0.BitVec.Signed.rotate_intMaxSealed [decl #5700] theorem Lean.Grind.CommRing.Mon.mul_nc.eq_def [decl #5800] theorem _private.Init.Data.BitVec.Lemmas.0.BitVec.toNat_signExtend_of_le._proof_1_5 [decl #5900] theorem Rat.add._proof_2 [decl #6000] theorem Rat.zero_divInt [decl #6100] theorem _private.Init.Data.String.Termination.0.String.Slice.Pos.lt_iff_remainingBytes_lt._simp_1_2 [decl #6200] theorem String.Slice.Pos.byte._proof_4 [decl #6300] theorem List.getElem_eq_getElem_toByteArray [decl #6400] theorem String.Slice.Pos.Splits.toByteArray_eq_right [decl #6500] theorem _private.Init.Data.String.Lemmas.Pattern.Pred.0.String.Slice.Pattern.Model.CharPred.isMatch_iff._simp_1_1 [decl #6600] theorem String.Slice.Pos.le_next._simp_1 [decl #6700] theorem USize.lt_iff_toNat_lt [decl #6800] def _private.Init.Data.Nat.Lemmas.0.Nat.zero_pow.match_1_1 [decl #6900] theorem String.Slice.Pattern.Model.LawfulForwardPatternModel.skipPrefix?_sliceFrom_eq_none_iff [decl #7000] theorem _private.Init.Data.String.Lemmas.Splits.0.String.Pos.splits._simp_1_1 [decl #7100] def Array.findIdx?.loop [decl #7200] def Lean.Grind.Linarith.Expr.casesOn [decl #7300] theorem Int.Internal.Linear.Poly.isUnsatDvd.eq_1 [decl #7400] def _private.Init.Data.Nat.Dvd.0.Nat.dvd_of_mul_dvd_mul_left.match_1_1 [decl #7500] def Vector.flatten [decl #7600] def ISize.complement [decl #7700] theorem Array.foldl_congr [decl #7800] def UInt64.toUInt32 [decl #7900] def Std.Iterators.PostconditionT.pure [decl #8000] theorem String.Pos.posLT_offset [decl #8100] theorem _private.Init.Data.String.Lemmas.FindPos.0.String.Pos.prev_eq_iff._simp_1_1 [decl #8200] def Lean.Grind.CommRing.Power.noConfusionType [decl #8300] theorem Lean.Grind.CommRing.Poly.denote_ofVar [decl #8400] theorem Lean.Grind.CommRing.Poly.denote_mulMonC [decl #8500] theorem _private.Init.Data.BitVec.Lemmas.0.BitVec.toInt_neg_of_ne_intMin._proof_1_5 [decl #8600] def Nat.decidableBallLT._f [decl #8700] def Int.ctorElimType [decl #8800] def List.findSome?._f [decl #8900] theorem _private.Init.Data.Nat.Power2.Basic.0.Nat.nextPowerOfTwo.go._unary.eq_def [decl #9000] def Vector.extract [decl #9100] theorem Lean.Data.AC.evalList._sparseCasesOn_1.else_eq [decl #9200] def Std.Iter.toTake [decl #9300] theorem List.toList_mkSlice_rco [decl #9400] theorem Int.neg_nonneg [decl #9500] theorem _private.Init.Data.Int.DivMod.Lemmas.0.Int.bmod_eq_neg._proof_1_2 [decl #9600] theorem _private.Init.Data.BitVec.Bitblast.0.BitVec.toInt_sdiv_of_ne_or_ne._simp_1_12 [decl #9700] def String.Pos.sliceFrom [decl #9800] def Option.attach_bind.match_1 [decl #9900] theorem List.flatMap_toArray [decl #10000] def String.Slice.Pattern.ToBackwardSearcher.DefaultBackwardSearcher.iter [… 382 lines (22.3 KB) omitted …] [decl #48100] def IO.FS.instLTSystemTime [decl #48200] theorem BitVec.compare_toNat [decl #48300] theorem String.Slice.toByteArray_copy_eq_empty_iff [decl #48400] def instSubFloat32 [decl #48500] def BitVec.DivModState.Lawful.recOn [decl #48600] theorem Std.Roc.toArray_eq_match_rcc [decl #48700] theorem _private.Init.Data.String.Extra.0.String.crlfToLf.go._unary._proof_3 [decl #48800] def term_=<<_ [decl #48900] theorem UInt16.toFin_sub [decl #49000] theorem Array.foldl_append [decl #49100] theorem List.unattach_cons [decl #49200] theorem Int16.xor_right_inj [decl #49300] theorem Vector.idRun_forIn_yield_eq_foldl [decl #49400] theorem Fin.castLE_zero [decl #49500] theorem IO.Error.noFileOrDirectory.sizeOf_spec [decl #49600] theorem String.Pos.byte_toSlice [decl #49700] theorem BitVec.ofNatLT_uSizeToNat [decl #49800] theorem _private.Init.Data.String.Lemmas.Pattern.TakeDrop.Basic.0.String.Pos.revSkipWhile_le._simp_1_1 [decl #49900] def Lean.Parser.Sym.Simp.self [decl #50000] theorem List.minIdxOn_nil_eq_iff_false [decl #50100] theorem List.Perm.foldl_eq' [decl #50200] theorem Int.getD_toArray_roc_eq_add [decl #50300] theorem UInt16.toUInt32_shiftLeft [decl #50400] theorem Std.Rxc.Iterator.instIteratorAccess._proof_7 [decl #50500] theorem Lean.Grind.Nat.lo_ro_2 [decl #50600] def Lean.versionString [decl #50700] theorem List.idxOf_lt_length_iff [decl #50800] theorem _private.Init.Data.String.Lemmas.Search.0.String.Pos.le_find._simp_1_2 [decl #50900] theorem UInt16.ofBitVec_xor [decl #51000] theorem Int.toList_roc_eq_singleton [decl #51100] theorem Array.set_eraseIdx_le [decl #51200] theorem Fin.getElem!_fin [decl #51300] theorem String.Slice.Model.mem_positionsFrom_startPos [decl #51400] theorem Std.PRange.LawfulUpwardEnumerableLT.ofMap [decl #51500] theorem Lean.Order.PProd.monotone_fst [decl #51600] theorem Array.flatten.eq_1 [decl #51700] theorem instIdempotentOpUInt8HOr [decl #51800] def Std.TransCmp.casesOn [decl #51900] def ShareCommon.StateFactoryBuilder.mkSet [decl #52000] theorem _private.Init.Data.PLift.0.instDecidableEqPLift.decEq._proof_1 [decl #52100] def Lean.Meta.instBEqOccurrences [decl #52200] theorem _private.Init.Data.Vector.Extract.0.Vector.extract_append_right._simp_1_1 [decl #52300] theorem Fin.val_le_of_le [decl #52400] theorem Vector.getElem?_eraseIdx_of_lt [decl #52500] theorem _private.Init.Grind.Offset.0.Lean.Grind.Nat.le_lo._proof_1_1 [decl #52600] theorem Int16.sub_zero [decl #52700] theorem Nat.div_le_iff_le_mul_add_pred [decl #52800] theorem _private.Init.Data.Range.Polymorphic.NatLemmas.0.Nat.toArray_rcc_add_succ_right_eq_push._simp_1_1 [decl #52900] def _private.Init.Control.Lawful.Instances.0.OptionT.run_seqRight.match_1_1 [decl #53000] theorem Vector.findFinIdx?_empty [decl #53100] def Lean.Syntax.isFieldIdx? [decl #53200] def Lean.Meta.LiftLetsConfig.ctorIdx [decl #53300] theorem _private.Init.Data.SInt.Lemmas.0.Int16.lt_or_lt_of_ne._proof_1_3 [decl #53400] theorem Int8.ofInt_eq_ofIntLE_div [decl #53500] theorem Int64.toInt32_ofBitVec [decl #53600] def Lean.Syntax.isCharLit? [decl #53700] theorem Nat.isNone_getElem?_toList_rco_eq [decl #53800] theorem List.one_le_countP_iff [decl #53900] theorem Lean.Omega.IntList.neg_cons [decl #54000] def Min.mk.noConfusion [decl #54100] theorem UInt64.not_or_self [decl #54200] def Lean.Parser.Command.registerSymSimp [decl #54300] theorem String.map_id [decl #54400] def Zero.mk.noConfusion [decl #54500] def Sep.sep [decl #54600] def _private.Init.Data.String.Slice.0.String.Slice.RevSplitIterator.finitenessRelation.match_6 [decl #54700] theorem List.head_ofFn [decl #54800] theorem Vector.mapFinIdx_push [decl #54900] theorem Option.none_or [decl #55000] theorem Std.Iter.forIn_filterMapM [decl #55100] theorem Vector.mapIdx_eq_push_iff [decl #55200] theorem Array.forIn_map [decl #55300] theorem UInt16.toUInt8_and [decl #55400] theorem _private.Init.Data.Slice.List.Lemmas.0.ListSlice.size_mkSlice_roo._simp_1_1 [decl #55500] def instReprPUnit [decl #55600] theorem UInt32.toNat_neg [decl #55700] theorem Int16.toInt64_lt INTERN_CALLS 300000000 nodes=2914436 [decl #55800] theorem Vector.pmap_attach [decl #55900] theorem _private.Init.Data.SInt.Lemmas.0.Int64.sub_le._simp_1_1 [decl #56000] theorem List.mem_flatten_of_mem [decl #56100] def Lean.binderPred⊂_ [decl #56200] theorem UInt16.not_and_self [decl #56300] def Int.toFloat32 [decl #56400] theorem Array.map_le_map_iff [decl #56500] theorem Nat.or_and_distrib_left [decl #56600] theorem Option.getDM_some [decl #56700] theorem String.Pos.sliceTo_cast._proof_1 [decl #56800] theorem ite_then_decide_self [decl #56900] theorem Int8.sub_add_cancel [decl #57000] theorem Int32.succ_mul [decl #57100] def instSubFloat [decl #57200] theorem List.le_maxIdxOn_of_apply_getElem_lt_apply_getElem [decl #57300] theorem _private.Init.Data.BitVec.Bitblast.0.BitVec.addRecAux_zero [decl #57400] theorem Int.sub_bmod_left [decl #57500] def Lean.Grind.Config.trace [decl #57600] theorem Int.Internal.Linear.dvd_norm [decl #57700] theorem Rat.divInt_nonneg [decl #57800] theorem DoResultPR.return.sizeOf_spec [decl #57900] theorem Vector.allM_eq_not_anyM_not