Checker "kiota" on test "cedar"
Checker: kiota · Version: 0.1.0 · 📄 Declaration · 🔗 Source
Test: cedar · Expected: 👍 accept · Size: 862.8 MB · Lines: 15.9 M · lean4export: 3.1.0 · Lean: 4.36.0 · Timeout: 10.7 min · 📄 Declaration · 🔗 Source
Result: 👍 accepted · exit code 0 · wall time: 3.60 min · instructions: 1.0 T · max rss memory: 2.7 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] def Std.Packages.PreorderOfLEArgs.lt_iff._autoParam [decl #4300] def List.lex._f [decl #4400] theorem String.decEq._proof_2 [decl #4500] theorem compareOfLessAndEq_eq_eq [decl #4600] def List.isEqv [decl #4700] def List.compareLex._sparseCasesOn_1 [decl #4800] theorem List.le_total [decl #4900] def Lean.instBEqLiteral [decl #5000] def UInt8._sizeOf_inst [decl #5100] def _private.Cedar.Spec.Ext.0.Cedar.Spec.Ext.lt._sparseCasesOn_4 [decl #5200] theorem _private.Cedar.Spec.Value.0.Cedar.Spec.instDecidableEqPrim.decEq._proof_20 [decl #5300] theorem _private.Cedar.Spec.Ext.0.Cedar.Spec.instDecidableEqExt.decEq._proof_16 [decl #5400] def Cedar.SymCC.TermType.bool [decl #5500] def _private.Cedar.SymCC.Term.0.Cedar.SymCC.TermPrim.lt.match_1 [decl #5600] theorem _private.Cedar.SymCC.TermType.0.Cedar.SymCC.instDecidableEqTermPrimType.decEq._proof_26 [decl #5700] def Cedar.SymCC.Op.ctorElim [decl #5800] theorem _private.Cedar.SymCC.Term.0.Cedar.SymCC.instDecidableEqTermPrim.decEq._proof_4 [decl #5900] theorem Cedar.SymCC.Term.isLiteral._proof_1 [decl #6000] def Cedar.SymCC.compileInₑ._sparseCasesOn_1 [decl #6100] def BitVec.shiftLeft [decl #6200] theorem _private.Cedar.Spec.Wildcard.0.Cedar.Spec.wildcardMatchIdx._unary._proof_8 [decl #6300] theorem _private.Init.Data.Nat.Bitwise.Lemmas.0.Nat.testBit_two_pow_mul_add._simp_1_4 [decl #6400] theorem UInt8.toNat_toBitVec [decl #6500] def Array.instAppend [decl #6600] theorem _private.Init.Data.String.Decode.0.ByteArray.utf8DecodeChar?.le_val_assemble₃ [decl #6700] theorem Array.getElem_extract_aux [decl #6800] def instModUInt32 [decl #6900] theorem _private.Init.Data.String.Decode.0.String.toBitVec_getElem_utf8EncodeChar_one_of_utf8Size_eq_two [decl #7000] def _private.Init.Data.BitVec.Bootstrap.0.BitVec.toNat_cons.match_1_1 [decl #7100] theorem List.eq_getElem_of_length_eq_four [decl #7200] theorem Array.size_eq_zero_iff [decl #7300] def _private.Cedar.SymCC.Interpretation.0.Cedar.SymCC.Factory.ext.ipaddr.addrV4'._sparseCasesOn_1 [decl #7400] theorem List.slt_asymm [decl #7500] theorem Std.Trichotomous.rel_or_eq_or_rel_swap [decl #7600] theorem false_eq_decide_iff [decl #7700] theorem _private.Init.Data.String.Decode.0.String.map_toBitVec_utf8EncodeChar_of_utf8Size_eq_four [decl #7800] theorem Cedar.Thm.interpret_uf_wf [decl #7900] theorem List.attach_cons [decl #8000] theorem _private.Cedar.Thm.Data.LT.0.Cedar.Thm.EntityUID.lt_asymm._simp_1_4 [decl #8100] def _private.Cedar.Thm.SymCC.Data.LT.0.Cedar.Thm.TermType.lt_trans._f [decl #8200] theorem _private.Cedar.Thm.SymCC.Data.LT.0.Cedar.Thm.TermPrim.lt_conn._simp_1_18 [decl #8300] theorem _private.Cedar.Data.SizeOf.0.Cedar.Data.Map.sizeOf_lt_of_value._proof_1_1 [decl #8400] theorem _private.Cedar.Thm.SymCC.Term.WF.0.Cedar.Thm.wf_term_app_eq._simp_1_3 [decl #8500] theorem _private.Cedar.Thm.SymCC.Term.Interpret.WF.0.Cedar.Thm.interpret_term_app_wf_bvneg._simp_1_7 [decl #8600] theorem Cedar.Thm.wf_term_app_bvshl [decl #8700] theorem _private.Cedar.Thm.SymCC.Term.WF.0.Cedar.Thm.wf_term_app_set_member._simp_1_1 [decl #8800] def _private.Cedar.Thm.SymCC.Term.WF.0.Cedar.SymCC.Factory.zero_extend.match_1.splitter [decl #8900] theorem _private.Cedar.Thm.SymCC.Term.WF.0.Cedar.Thm.wf_term_app_ext_ipaddr_isV4._simp_1_2 [decl #9000] theorem _private.Cedar.Thm.SymCC.Term.Interpret.WF.0.Cedar.Thm.interpret_term_app_wf_ext_ipaddr_prefixV6 [decl #9100] theorem Cedar.Thm.wf_datetime [decl #9200] def Cedar.TPE.PartialEntities [decl #9300] theorem _private.Cedar.Validation.Types.0.Cedar.Validation.decCedarType._mutual._proof_18 [decl #9400] def _private.Cedar.Validation.Types.0.Cedar.Validation.decProdAttrQualifiedCedarTypeList.match_5 [decl #9500] def Cedar.SymCC.SymEnv.request [decl #9600] def Cedar.SymCC.compileSet.match_1 [decl #9700] def Std.IteratorLoop.finiteForIn' [decl #9800] theorem _private.Init.Data.String.Lemmas.IsEmpty.0.String.Slice.startPos_eq_endPos_iff._simp_1_3 [decl #9900] theorem _private.Init.Data.String.Basic.0.String.Pos.Raw.isValid_iff_exists_append._simp_1_2 [decl #10000] theorem String.Slice.Pos.isUTF8FirstByte_byte [… 1247 lines (79.6 KB) omitted …] [decl #134100] theorem List.insertP_cons_neg [decl #134200] theorem Std.ExtDTreeMap.getD_insert_self [decl #134300] theorem Array.getInternal.congr_simp [decl #134400] def LawfulSingleton.recOn [decl #134500] theorem Std.DTreeMap.Raw.containsThenInsertIfNew_snd [decl #134600] theorem IO.Error.invalidArgument.injEq [decl #134700] theorem Std.ExtTreeMap.foldr_eq_foldr_toList [decl #134800] theorem Std.Rci.forIn'_eq_forIn'_toArray [decl #134900] theorem List.countP.eq_1 [decl #135000] def System.Uri.escapeUri [decl #135100] theorem _private.Init.Data.Int.Compare.0.Int.compare_eq_eq._simp_1_1 [decl #135200] def ReprTuple.mk.noConfusion [decl #135300] theorem Std.ExtDTreeMap.Const.getD_unitOfList [decl #135400] def Lean.Meta.SparseCasesOnInfo.insterestingCtors [decl #135500] theorem Lean.Grind.of_decide_eq_true [decl #135600] theorem Array.eraseP_filterMap [decl #135700] def _private.Lean.Compiler.LCNF.Basic.0.Lean.Compiler.LCNF.FunDecl.updateBinderName.match_1 [decl #135800] theorem Std.DTreeMap.Internal.Impl.beq_iff_equiv [decl #135900] theorem Option.isSome_left_of_isSome_min [decl #136000] theorem Std.DTreeMap.Raw.Equiv.minKey?_eq [decl #136100] theorem Lean.NamingContext.mk.sizeOf_spec [decl #136200] theorem Int.Internal.Linear.Poly.isUnsatLe.eq_2 [decl #136300] theorem Nat.toList_rcc_eq_nil_iff._simp_1 [decl #136400] theorem List.min!_eq_min_of_ne_nil [decl #136500] theorem PProd.mk.sizeOf_spec [decl #136600] theorem Std.HashMap.Raw.size_insert_le [decl #136700] def Lean.JsonNumber.recOn [decl #136800] theorem UInt8.sub_right_inj [decl #136900] theorem Std.HashMap.getD_filter' [decl #137000] theorem _private.Init.Data.UInt.Lemmas.0.UInt64.toUSize_le._simp_1_1 [decl #137100] theorem Std.HashMap.Raw.getElem_insertIfNew [decl #137200] theorem UInt64.or_eq_zero_iff [decl #137300] theorem _private.Init.Grind.Ordered.Field.0.Lean.Grind.Field.IsOrdered.lt_mul_inv_of_lt_mul [decl #137400] def Bool.true.elim [decl #137500] theorem _private.Init.Data.Array.Lemmas.0.Array.size_rightpad._proof_1_1 [decl #137600] theorem Int.toNat_add_toNat_neg_eq_natAbs [decl #137700] def Lean.Parser.Tactic.tacticInfer_instance [decl #137800] theorem UInt64.toUSize_mod_of_toNat_lt [decl #137900] theorem Std.TreeMap.contains_of_contains_map [decl #138000] theorem Lean.Compiler.LCNF.Code.sset.injEq [decl #138100] def Lean.Doc.Parser.versoLinkRefUrl [decl #138200] theorem Std.ExtTreeMap.get?.congr_simp [decl #138300] theorem Cedar.SymCC.Op.ite.sizeOf_spec [decl #138400] theorem Int8.toISize_toInt32 [decl #138500] theorem USize.neg_one_shiftLeft_and_shiftLeft [decl #138600] def Lean.Lsp.InitializationOptions.ctorIdx [decl #138700] def Cedar.Validation.ActionSchemaEntry.mk.noConfusion [decl #138800] def _private.Batteries.Data.List.Basic.0.List.zipWithLeft'_eq_zipWithLeft'TR.match_1_2 [decl #138900] def Lean.MonadResolveName.mk.noConfusion [decl #139000] theorem Lean.Lsp.ResolvableCompletionList.mk.sizeOf_spec [decl #139100] def List.term_<:+_ [decl #139200] theorem Std.DHashMap.insertMany_append [decl #139300] def Lean.Widget.instFromJsonUserWidgetDefinition [decl #139400] theorem UInt64.toUInt16_add [decl #139500] theorem Std.HashMap.getElem?_map' [decl #139600] theorem Std.HashMap.insertMany_list_singleton [decl #139700] theorem Lean.Grind.CommRing.Expr.denoteS.eq_9 [decl #139800] def Std.Iterators.Types.Append.instIteratorLoop [decl #139900] theorem Std.Ric.forIn'_toArray_eq_forIn' [decl #140000] theorem Lean.Level.PP.Result.maxNode.sizeOf_spec [decl #140100] def Lean.Doc.flag [decl #140200] def Int.toInt8 [decl #140300] theorem Dyadic.toRat.eq_1 [decl #140400] def Std.Time.OffsetZ.noConfusion [decl #140500] def Lean.Doc.mkVersoLinkRefUrlFromRef [decl #140600] theorem Vector.count_push [decl #140700] theorem Vector.set_eq_push_extract_append_extract._proof_2 [decl #140800] theorem _private.Batteries.Data.List.Scan.0.List.getElem?_partialProds._proof_1_3 [decl #140900] theorem Vector.mem_zipIdx._proof_2 [decl #141000] def _private.Batteries.Data.String.Lemmas.0.Substring.Raw.Valid.data_drop.match_1_1 [decl #141100] theorem Nat.mod.eq_1 [decl #141200] theorem Nat.induct_roc_right [decl #141300] theorem Std.Do.StringSliceInvariant.eq_1 [decl #141400] theorem ListSlice.size_mkSlice_roo [decl #141500] theorem Option.attach_pfilter._proof_3 [decl #141600] theorem Cedar.SymCC.checkNeverErrorsOpt.eq_1 [decl #141700] theorem Lean.Compiler.LCNF.Alt.brecOn.eq [decl #141800] def Cedar.Spec.ExtFun.offset.elim [decl #141900] def Std.PRange.instToStreamRooIterIteratorOfUpwardEnumerable [decl #142000] theorem Std.TreeMap.size_insert_le [decl #142100] theorem List.beq_iff_exists_findIdxNth [decl #142200] theorem ite_then_not_self [decl #142300] theorem List.range_one [decl #142400] theorem List.elem_nil [decl #142500] def String.Slice.Subslice.recOn [decl #142600] theorem Eq.ndrec.congr_simp [decl #142700] theorem Std.Do.ExceptT.instWPMonad._proof_2 [decl #142800] def Lean.Parser.Term.cdot.formatter [decl #142900] theorem Vector.isSome_findFinIdx? [decl #143000] def PLift.recOn [decl #143100] theorem Std.DHashMap.Internal.Raw₀.alter.congr_simp [decl #143200] theorem Int.sign_sign [decl #143300] theorem Int.ofNat_eq_coe [decl #143400] def Std.DTreeMap.Internal.Const.RoiSliceData._sizeOf_inst [decl #143500] def Std.Internal.LawfulMonadLiftFunction.recOn [decl #143600] theorem Std.ExtTreeSet.get?_max! [decl #143700] theorem Lean.Sym.ite_false_congr [decl #143800] def Lean.Meta.Structural.isInstHPowNat [decl #143900] theorem _private.Cedar.Thm.SymCC.Compiler.Control.0.Cedar.SymCC.Factory.option.get'.match_1.eq_2 [decl #144000] theorem Int32.instRxoIsAlwaysFinite