Lean Kernel Arena / kiota / navier-stokes-euler

Checker "kiota" on test "navier-stokes-euler"

Checker: kiota · Version: 0.1.0 · 📄 Declaration · 🔗 Source

Test: navier-stokes-euler · Expected: 👍 accept · Size: 1.5 GB · Lines: 28.6 M · lean4export: 3.1.0 · Lean: 4.34.0-rc2 · Timeout: 30.7 min · 📄 Declaration · 🔗 Source

Result: 👍 accepted · exit code 0 · wall time: 9.63 min · instructions: 3.7 T · max rss memory: 3.2 GB · run 2026-11-22 02:28:12 UTC

stderr:
[decl #100] def Bool.ctorIdx
[decl #200] theorem Nat.modCore_lt
[decl #300] def Inv.inv
[decl #400] def _private.Init.Data.Nat.Basic.0.Nat.mul_le_mul_left.match_1_1
[decl #500] theorem Nat.gcd_succ
[decl #600] def LinearOrder.min_def._autoParam
[decl #700] theorem LinearOrder.le_total
[decl #800] def Ring.toAddGroupWithOne
[decl #900] def InvolutiveInv.toInv
[decl #1000] theorem ZeroLEOneClass.zero_le_one
[decl #1100] def IsAddLeftRegular
[decl #1200] def IsAddRightRegular
[decl #1300] def AbsoluteValue.casesOn
[decl #1400] theorem neg_mul_neg
[decl #1500] def List.instGetElem?NatLtLength
[decl #1600] theorem _private.Mathlib.Algebra.GroupWithZero.Defs.0.isCancelMulZero_iff_forall_isRegular._simp_1_2
[decl #1700] def _private.Init.Data.List.Lemmas.0.List.append_of_mem.match_1_9
[decl #1800] def _private.Init.Data.List.Lemmas.0.List.getLast_mem.match_1_1
[decl #1900] theorem Nat.instAddCancelCommMonoid._proof_1
[decl #2000] def Units.casesOn
[decl #2100] theorem Function.Injective.addGroupWithOne._proof_2
[decl #2200] theorem Pi.mulOneClass._proof_2
[decl #2300] theorem Nat.Coprime.gcd_eq_one
[decl #2400] theorem Int.ofNat_inj
[decl #2500] theorem Int.natCast_mul
[decl #2600] theorem Int.dvd_of_emod_eq_zero
[decl #2700] def Lean.Omega.IntList.sum
[decl #2800] theorem Int.le_of_sub_nonneg
[decl #2900] def _private.Init.Core.0.Bool.of_not_eq_true.match_1_1
[decl #3000] theorem Lean.Omega.Int.mul_congr
[decl #3100] theorem _private.Init.Data.Nat.Div.Lemmas.0.Nat.succ_div_of_dvd._simp_1_3
[decl #3200] theorem Rat.divInt_add_divInt
[decl #3300] theorem Int.dvd_mul_left
[decl #3400] theorem Nat.Coprime.pow_right
[decl #3500] theorem Nat.one_ne_zero
[decl #3600] theorem Rat.not_lt
[decl #3700] theorem Rat.add_le_add_right
[decl #3800] def OrderIso.symm
[decl #3900] theorem abs_add_le
[decl #4000] theorem Ring.toGrindRing._proof_14
[decl #4100] theorem _private.Init.Grind.Ring.Basic.0.Lean.Grind.Ring.intCast_add._proof_1_3
[decl #4200] theorem _private.Init.Grind.Ring.Basic.0.Lean.Grind.IsCharP.intCast_eq_zero_iff._proof_1_9
[decl #4300] def Lean.Grind.CommRing.Power.x
[decl #4400] def Bool.dcond.match_1
[decl #4500] theorem Lean.Grind.CommRing.instBEqMon.beq.eq_3
[decl #4600] theorem Lean.Grind.Semiring.ofNat_mul
[decl #4700] theorem Lean.Grind.CommRing.Poly.denote_mul
[decl #4800] theorem CauSeq.instPreorderAbs._proof_2
[decl #4900] def _private.Mathlib.Algebra.Order.CauSeq.Basic.0.CauSeq.const_limZero.match_1_1
[decl #5000] theorem Function.Surjective.addGroup._proof_2
[decl #5100] theorem mul_le_mul_iff_left₀
[decl #5200] theorem Function.Surjective.commMagma._proof_1
[decl #5300] theorem NNReal.instZero._proof_1
[decl #5400] theorem NNReal.instSemiring._proof_26
[decl #5500] def Equiv.addCommGroup
[decl #5600] def Pi.module
[decl #5700] theorem List.eq_nil_of_length_eq_zero
[decl #5800] theorem _private.Init.Data.List.Perm.0.List.Perm.filterMap._simp_1_2
[decl #5900] theorem Multiset.Nodup.ext
[decl #6000] theorem not_false_iff
[decl #6100] theorem Finset.fold_op_distrib
[decl #6200] theorem List.pairwise_map
[decl #6300] theorem List.mem_ofFn._simp_1
[decl #6400] theorem _private.Init.Data.List.Perm.0.List.Perm.pmap._simp_1_2
[decl #6500] theorem Finsupp.coe_smul
[decl #6600] theorem Function.Bijective.injective
[decl #6700] theorem Pi.preorder._proof_3
[decl #6800] theorem lowerBounds_singleton
[decl #6900] theorem DistribLattice.ofInfSupLe._proof_3
[decl #7000] def Lean.Data.AC.Variable.neutral
[decl #7100] theorem bot_unique
[decl #7200] theorem iInf_subtype
[decl #7300] theorem Multiset.Le._proof_1
[decl #7400] theorem _private.Mathlib.Data.Finsupp.Single.0.Finsupp.coe_update._proof_1_1
[decl #7500] theorem Multiset.erase_le_iff_le_cons
[decl #7600] def Multiset.union
[decl #7700] theorem List.sublist_cons_of_sublist
[decl #7800] theorem Int.Internal.Linear.Expr.denote_toPoly'_go
[decl #7900] theorem _private.Mathlib.Data.Multiset.FinsetOps.0.Multiset.le_ndinter._simp_1_3
[decl #8000] theorem List.nodup_iff_sublist
[decl #8100] theorem Finsupp.lsum._proof_2
[decl #8200] def Finset.attach
[decl #8300] def Lean.Grind.Linarith.lt_lt_combine_cert
[decl #8400] theorem Lean.Grind.OrderedAdd.zsmul_nonpos
[decl #8500] theorem Monotone.comp
[decl #8600] def Filter.instPartialOrder
[decl #8700] theorem Finite.Set.subset
[decl #8800] def _private.Mathlib.Data.Nat.Find.0.Nat.wf_lbp.match_1_3
[decl #8900] def Real.instMonoid
[decl #9000] theorem Units.mul_inv_cancel_left
[decl #9100] def Rat.addMonoid
[decl #9200] def _private.Mathlib.Order.Filter.Bases.Basic.0.Filter.HasBasis.ge_iff.match_1_1
[decl #9300] theorem TopologicalSpace.isOpen_univ
[decl #9400] def WithTop.instLE
[decl #9500] theorem Subtype.instLinearOrder._proof_2
[decl #9600] theorem WithTop.instNonUnitalNonAssocSemiring._proof_3
[decl #9700] def CompleteLinearOrder.compare_eq_compareOfLessAndEq._autoParam
[decl #9800] theorem top_le_iff._simp_2
[decl #9900] theorem Int.floor_le
[decl #10000] def _private.Mathlib.Data.Set.Basic.0.Set.univ_nonempty.match_1_1
[… 1078 lines (70.5 KB) omitted …]
[decl #115200] def EulerPacketCylinderField.forwardSourcePrimaryWitness
[decl #115300] theorem EulerPacketCylinderField.PrefixBound.tail_slow_product_bound._proof_1_1
[decl #115400] theorem EulerPacketTerminalDatum.forwardInitializedAllOrderBudget._proof_40
[decl #115500] theorem EulerPacketPiola.transformedLiftedCurl._proof_1
[decl #115600] theorem EulerPacketCorrectionOutput.correction_output_bound
[decl #115700] theorem EulerCylinderJetLp.tensor_add_norm_le
[decl #115800] theorem EulerGevreyComposition.predecessorPartitionWeight_nonneg
[decl #115900] def LinearMap.toLinearIsometry
[decl #116000] theorem EulerPacketGraphHessian.fastForce._proof_1
[decl #116100] theorem EulerChildParticleFieldBounds.Data.parentComposed_bound
INTERN_CALLS 2800000000 nodes=3430357
[decl #116200] theorem EulerParentPacketFrames.SmoothState.forwardRenewal._proof_5
[decl #116300] theorem EulerParentPacketFrames.Parent.strainDerivative_norm_le
[decl #116400] theorem EulerParentPacketFrames.Evolution.child._proof_2
[decl #116500] theorem EulerParentPacketFrames.Parent.normalizedPressure_differentiableAt
[decl #116600] def EulerVolumeSobolevPath.Tensor
[decl #116700] theorem EulerPacketPhysicalField.pressureForceTower._proof_4
[decl #116800] theorem EulerPacketCylinderField.SpatialJetField.fastAdvection_odd
[decl #116900] theorem EulerMeanBoundary.gradientReflection_homogeneous
[decl #117000] theorem EulerPacketTerminalDatum.field_odd
[decl #117100] theorem EulerBaseEulerGuards.source_normal_initial
[decl #117200] theorem EulerMeanPacketProvider.meanSolve_zero_initial
[decl #117300] theorem EulerParentPacketFrames.LabelData.forwardGeometryGuardsOfStage._proof_4
[decl #117400] def EulerParentPacketFrames.GeometryForwardInput.low
[decl #117500] theorem EulerParentPacketFrames.Evolution.ForwardSourceErrors._proof_1
[decl #117600] def EulerPacketInduction.Stage.forwardParent
[decl #117700] theorem EulerParentPacketFrames.Evolution.updateLowBounds._proof_5
[decl #117800] theorem EulerPacketInduction.Stage.forwardNext._proof_28
[decl #117900] theorem EulerTransversePacketJoin.scalar_smooth
[decl #118000] theorem EulerPacketTerminalDatum.initializedApproximationResidual._proof_6
[decl #118100] theorem EulerPacketTerminalDatum.initializedSpatialBudget._proof_8
[decl #118200] theorem EulerCylinderRetractRepresentative.pointField._proof_1
[decl #118300] theorem EulerPacketTerminalDatum.initializedVelocity_global_gradient_error._abel_1_2
[decl #118400] theorem EulerTransversePacketPrimary.pastVelocity_reflection_neg
[decl #118500] theorem EulerParentPacketFrames.Evolution.exactPacket_whole_horizon_low_bounds
INTERN_CALLS 2900000000 nodes=3381999
[decl #118600] theorem EulerParentPacketFrames.GeometryForwardInput.exactInitial._proof_1
[decl #118700] theorem EulerOrdinarySobolev.tensorNorm_le_sub_add
[decl #118800] theorem EulerMeanSobolevBoundedField.finiteField._proof_3
[decl #118900] theorem EulerOrdinarySobolev.wordBound_tensorNorm
[decl #119000] theorem EulerSmoothSobolev.derivativeMagnitude_L2_le
[decl #119100] theorem EulerOrdinarySobolev.Evolution.envelopeDerivative_bound
[decl #119200] theorem EulerOrdinarySobolev.SmoothLimitData.advectionPath_convergence
[decl #119300] theorem EulerOrdinarySobolev.tame_advection_outer._proof_1_2
[decl #119400] theorem Euler.ComparatorBridge.curlMatrixCLM._proof_6
[decl #119500] theorem EulerMeanSmoothRepresentative.ordinarySobolev.congr_simp
[decl #119600] def EulerOrdinarySobolev.SmoothingOperator.rhs
[decl #119700] theorem EulerOrdinarySobolev.projected_difference_energy
[decl #119800] theorem EulerOrdinarySobolev.directional_square_identity
[decl #119900] theorem EulerWholeSpaceGaussian.exp_integrable._simp_1_1
[decl #120000] theorem EulerWholeSpaceGaussian.derivative_elliptic_middle
[decl #120100] theorem EulerPacketInduction.Stage.successor_time
[decl #120200] theorem Euler.ComparatorBridge.transport_eq_zero_along_trajectory
[decl #120300] theorem Euler.ComparatorBridge.truncationCutoff._proof_1
[decl #120400] theorem EulerComparatorRecovery.localized_dirichlet_identity
[decl #120500] theorem Euler.ComparatorBridge.compactCurlMap._proof_2
[decl #120600] def EulerOrdinarySobolev.zeroEvolution
[decl #120700] theorem isUnit_zero_iff._simp_1
[decl #120800] theorem _private.Mathlib.RingTheory.OreLocalization.Basic.0.OreLocalization.add._simp_1
[decl #120900] theorem _private.Mathlib.RingTheory.OreLocalization.Ring.0.OreLocalization.instModuleOfIsScalarTower._simp_1
[decl #121000] theorem Submonoid.LocalizationMap.eq
[decl #121100] theorem Ring.exists_maximal_of_not_isField
[decl #121200] theorem IsLocalizedModule.fromLocalizedModule'_smul
[decl #121300] theorem Algebra.coe_linearMap
[decl #121400] theorem Module.IsTorsionBySet.module._proof_1
[decl #121500] theorem sSup_compact_le_eq
[decl #121600] theorem Set.Iic.isCompactElement
[decl #121700] theorem Submodule.smul_mono_left
[decl #121800] def RelSeries.head
[decl #121900] theorem DFinsupp.filter_apply
[decl #122000] theorem RingHom.toSemilinearMap._proof_2
[decl #122100] theorem Order.krullDim_nonneg_iff
[decl #122200] theorem ENat.card.eq_1
[decl #122300] theorem isStronglyAtomic_dual_iff_is_stronglyCoatomic
[decl #122400] def _private.Mathlib.RingTheory.Ideal.Maximal.0.Ideal.exists_le_prime_disjoint.match_1_3
[decl #122500] theorem RingEquiv.symm_comp
[decl #122600] theorem IsNoetherianRing.isArtinianRing_of_krullDimLE_zero
[decl #122700] def _private.Mathlib.Order.WithBot.0.WithBot.instWellFoundedLT.match_1
[decl #122800] theorem Submonoid.gi._proof_1
[decl #122900] theorem Polynomial.modByMonic_eq_of_not_monic
[decl #123000] theorem PiToModule.fromMatrix._proof_5
[decl #123100] theorem WithBot.instCommSemiring._proof_4
[decl #123200] theorem Matrix.instAddGroupWithOne._proof_8
[decl #123300] theorem MatrixEquivTensor.toFunBilinear._proof_4
[decl #123400] theorem matrixEquivTensor_apply_single
[decl #123500] theorem IsPrime.to_maximal_ideal
[decl #123600] theorem RingHom.isIntegralElem_map
[decl #123700] theorem num_isRoot_scaleRoots_of_aeval_eq_zero
[decl #123800] def FractionRing.field
[decl #123900] theorem WithBot.instSuccOrder._proof_4
[decl #124000] theorem IsLocalRing.ResidueField.field._proof_7
[decl #124100] def Ideal.Filtration.Stable
[decl #124200] theorem PolynomialModule.coeff_injective
INTERN_CALLS 3000000000 nodes=2541433
[decl #124300] theorem Ideal.Filtration.instSupSet._proof_1
[decl #124400] theorem _private.Mathlib.Algebra.Module.LocalizedModule.Basic.0.localizedModuleIsLocalizedModule._simp_1
[decl #124500] theorem DFinsupp.mapRange.linearEquiv._proof_2
[decl #124600] theorem ValuationRing.iff_ideal_total
[decl #124700] theorem IsUnit.map
[decl #124800] theorem BoundedContinuousFunction.edist_eq_iSup