Improved handling of disabled VM #21677
Open
SkySkimmer wants to merge 5 commits intorocq-prover:masterfrom
Open
Improved handling of disabled VM #21677SkySkimmer wants to merge 5 commits intorocq-prover:masterfrom
SkySkimmer wants to merge 5 commits intorocq-prover:masterfrom
Conversation
SkySkimmer
added
the
request: full CI
coqbot-app
bot
removed
the
request: full CI
SkySkimmer
changed the title
SkySkimmer
added
the
needs: progress
Contributor
Author
|
@coqbot bench |
Contributor
Author
|
checker needs updating @coqbot ci minimize ci-corn |
Contributor
|
I am now running minimization at commit 3661dfb on requested target ci-corn. I'll come back to you with the results once it's done. |
Contributor
Minimization interrupted by timeout, being automatically continued. Partially Minimized File /home/runner/work/run-coq-bug-minimizer/run-coq-bug-minimizer/builds/coq/coq-failing/_build_ci/corn/reals/fast/CRpi_fast.v in 5h 15m 7s (from ci-corn) (interrupted by timeout, being automatically continued) (full log on GitHub Actions - verbose log)⭐ ⏱️ Partially Minimized Coq File (timeout)(* -*- mode: coq; coq-prog-args: ("-emacs" "-q" "-w" "-deprecated-native-compiler-option" "-native-compiler" "no" "-coqlib" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq//" "-R" "/github/workspace/builds/coq/coq-failing/_build_ci/corn" "CoRN" "-Q" "/github/workspace/cwd" "Top" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/Bignums" "Bignums" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/HB" "HB" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/Ltac2" "Ltac2" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/MathClasses" "MathClasses" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/Stdlib" "Stdlib" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/elpi" "elpi" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/elpi_elpi" "elpi_elpi" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/elpi_examples" "elpi_examples" "-top" "CoRN.reals.fast.CRpi_fast") -*- *)
(* File reduced by coq-bug-minimizer from original input, then from 362 lines to 68 lines, then from 80 lines to 1074 lines, then from 1081 lines to 78 lines, then from 89 lines to 1725 lines, then from 1732 lines to 96 lines, then from 108 lines to 1195 lines, then from 1202 lines to 99 lines, then from 110 lines to 1587 lines, then from 1594 lines to 117 lines, then from 129 lines to 896 lines, then from 903 lines to 120 lines, then from 131 lines to 1147 lines, then from 1154 lines to 132 lines, then from 143 lines to 1154 lines, then from 1161 lines to 144 lines, then from 155 lines to 1086 lines, then from 1093 lines to 156 lines, then from 167 lines to 1191 lines, then from 1198 lines to 214 lines, then from 225 lines to 1320 lines, then from 1327 lines to 357 lines *)
(* coqc version 9.3+alpha compiled with OCaml 4.14.2
coqtop version 9.3+alpha
Expected coqc runtime on this file: 0.888 sec
Expected coqc peak memory usage on this file: 514620.0 kb *)
Require CoRN.tactics.DiffTactics1.
Require CoRN.tactics.Step.
Require Corelib.BinNums.IntDef.
Require Corelib.Program.Tactics.
Require Corelib.Classes.Equivalence.
Require Corelib.Classes.Morphisms.
Require Corelib.Classes.RelationClasses.
Require Corelib.BinNums.PosDef.
Require Corelib.Classes.SetoidTactics.
Require Corelib.Setoids.Setoid.
Require Corelib.Lists.ListDef.
Require Corelib.Classes.Morphisms_Prop.
Require Corelib.Numbers.BinNums.
Require Corelib.Init.Sumbool.
Require Corelib.Init.Wf.
Require Corelib.Program.Utils.
Require Corelib.Init.Ltac.
Require Corelib.BinNums.NatDef.
Require Corelib.Relations.Relation_Definitions.
Require Corelib.Program.Basics.
Require Corelib.Program.Wf.
Require MathClasses.theory.CoqStreams.
Require Stdlib.Logic.Decidable.
Require Stdlib.Logic.EqdepFacts.
Require Stdlib.Logic.FunctionalExtensionality.
Require Stdlib.Logic.HLevelsBase.
Require Stdlib.Program.Syntax.
Require Stdlib.Unicode.Utf8_core.
Require Stdlib.micromega.ZifyClasses.
Require Stdlib.setoid_ring.Algebra_syntax.
Require Stdlib.BinNums.PosDef.
Require Stdlib.BinNums.NatDef.
Require Stdlib.BinNums.IntDef.
Require Stdlib.Classes.SetoidTactics.
Require Stdlib.Classes.RelationClasses.
Require Stdlib.Classes.Equivalence.
Require Stdlib.Classes.Morphisms_Prop.
Require Stdlib.Classes.Morphisms.
Require Stdlib.Classes.DecidableClass.
Require Stdlib.Init.Wf.
Require Stdlib.Init.Sumbool.
Require Stdlib.Lists.ListDef.
Require Stdlib.Logic.Eqdep.
Require Stdlib.Logic.Eqdep_dec.
Require Stdlib.Logic.ProofIrrelevanceFacts.
Require Stdlib.Numbers.BinNums.
Require Stdlib.Program.Basics.
Require Stdlib.Program.Tactics.
Require Stdlib.Program.Utils.
Require Stdlib.Program.Wf.
Require Stdlib.Relations.Relation_Definitions.
Require Stdlib.Setoids.Setoid.
Require Stdlib.Unicode.Utf8.
Require CoRN.tactics.CornTac.
Require Stdlib.Bool.Bool.
Require Stdlib.Logic.JMeq.
Require Stdlib.Logic.ProofIrrelevance.
Require Stdlib.Relations.Relation_Operators.
Require Stdlib.Program.Combinators.
Require Stdlib.Relations.Operators_Properties.
Require Stdlib.PArith.BinPosDef.
Require Stdlib.Relations.Relations.
Require Stdlib.Program.Equality.
Require Stdlib.Numbers.NumPrelude.
Require Stdlib.Program.WfExtensionality.
Require MathClasses.misc.stdlib_hints.
Require Stdlib.Structures.Equalities.
Require Stdlib.Program.Subset.
Require Stdlib.Structures.Orders.
Require Stdlib.Structures.OrdersTac.
Require Stdlib.Structures.OrdersFacts.
Require Stdlib.Structures.GenericMinMax.
Require Stdlib.Program.Program.
Require Stdlib.Numbers.NatInt.NZAxioms.
Require Stdlib.Numbers.NatInt.NZBase.
Require Stdlib.Numbers.NatInt.NZAdd.
Require Stdlib.Numbers.NatInt.NZMul.
Require Stdlib.Numbers.NatInt.NZOrder.
Require Stdlib.Numbers.NatInt.NZAddOrder.
Require Stdlib.Numbers.NatInt.NZMulOrder.
Require CoRN.model.totalorder.QMinMax.
Require CoRN.ftc.Integral.
Require CoRN.ftc.MoreFunctions.
Axiom proof_admitted : False.
Tactic Notation "admit" := abstract case proof_admitted.
Export CoRN.ftc.Integral.
Export CoRN.ftc.MoreFunctions.
Section Lemmas.
End Lemmas.
Section Definitions.
Variables a b : IR.
Hypothesis Hab : Min a b [<=] Max a b.
Variable F : PartIR.
Hypothesis HF : Continuous_I Hab F.
Lemma Integral_inc1 : Continuous_I (Min_leEq_lft a b) F.
Admitted.
Lemma Integral_inc2 : Continuous_I (Min_leEq_rht a b) F.
Admitted.
Definition Integral :=
integral _ _ (Min_leEq_rht a b) F Integral_inc2[-]integral _ _ (Min_leEq_lft a b) _ Integral_inc1.
End Definitions.
Arguments Integral [a b Hab F].
Section Properties_of_Integral.
End Properties_of_Integral.
Section More_Properties.
End More_Properties.
Section Corollaries.
End Corollaries.
Module Export CoRN_DOT_ftc_DOT_MoreIntegrals.
Module Export CoRN.
Module Export ftc.
Module Export MoreIntegrals.
End MoreIntegrals.
End ftc.
End CoRN.
End CoRN_DOT_ftc_DOT_MoreIntegrals.
Section Indefinite_Integral.
Variable I : interval.
Variable F : PartIR.
Hypothesis contF : Continuous I F.
Variable a : IR.
Hypothesis Ha : I a.
Lemma prim_lemma : forall x : IR, I x -> Continuous_I (Min_leEq_Max a x) F.
Admitted.
Lemma Fprim_strext : forall x y Hx Hy,
Integral (prim_lemma x Hx) [#] Integral (prim_lemma y Hy) -> x [#] y.
Admitted.
Definition Fprim : PartIR.
apply Build_PartFunct with (pfpfun := fun (x : IR) (Hx : I x) => Integral (prim_lemma x Hx)).
Proof.
apply iprop_wd.
exact Fprim_strext.
Defined.
End Indefinite_Integral.
Arguments Fprim [I F].
Notation "[-S-] F" := (Fprim F) (at level 20).
Section Compact.
End Compact.
Section General.
End General.
Section Limit_of_Derivative_Seq.
End Limit_of_Derivative_Seq.
Section Derivative_Series.
End Derivative_Series.
Module Export CoRN_DOT_ftc_DOT_FTC.
Module Export CoRN.
Module Export ftc.
Module Export FTC.
End FTC.
End ftc.
End CoRN.
End CoRN_DOT_ftc_DOT_FTC.
Export CoRN.ftc.FTC.
Module Export CoRN_DOT_transc_DOT_PowerSeries.
Module Export CoRN.
Module Export transc.
Module Export PowerSeries.
End PowerSeries.
End transc.
End CoRN.
End CoRN_DOT_transc_DOT_PowerSeries.
Export CoRN.transc.PowerSeries.
Module Export CoRN_DOT_transc_DOT_TaylorSeries.
Module Export CoRN.
Module Export transc.
Module Export TaylorSeries.
End TaylorSeries.
End transc.
End CoRN.
End CoRN_DOT_transc_DOT_TaylorSeries.
Export CoRN.transc.TaylorSeries.
Module Export CoRN_DOT_transc_DOT_Trigonometric.
Module Export CoRN.
Module Export transc.
Module Export Trigonometric.
End Trigonometric.
End transc.
End CoRN.
End CoRN_DOT_transc_DOT_Trigonometric.
Export CoRN.transc.Trigonometric.
Module Export SinCos.
End SinCos.
Fixpoint pi_seq (n : nat) : IR.
Admitted.
Lemma pi_seq_Cauchy : Cauchy_prop pi_seq.
Admitted.
Definition Pi := Two[*]Lim (Build_CauchySeq _ _ pi_seq_Cauchy).
Module Export CoRN_DOT_transc_DOT_Pi.
Module Export CoRN.
Module Export transc.
Module Export Pi.
End Pi.
End transc.
End CoRN.
End CoRN_DOT_transc_DOT_Pi.
Export CoRN.transc.Pi.
Module Export TrigMon.
End TrigMon.
Lemma ArcTan_def_lemma : Continuous realline {1/} ( [-C-][1]{+}FId{^}2).
Admitted.
Definition ArcTang := ( [-S-]ArcTan_def_lemma) [0] I.
Definition ArcTan (x : IR) := ArcTang x I.
Module Export CoRN_DOT_transc_DOT_InvTrigonom.
Module Export CoRN.
Module Export transc.
Module Export InvTrigonom.
End InvTrigonom.
End transc.
End CoRN.
End CoRN_DOT_transc_DOT_InvTrigonom.
Export CoRN.transc.InvTrigonom.
Module Export CoRN.
Module Export transc.
Module Export MoreArcTan.
End MoreArcTan.
End transc.
End CoRN.
Import CoRN.model.totalorder.QMinMax.
Import CoRN.transc.MoreArcTan.
Import CoRN.stdlib_omissions.Q.
Set Implicit Arguments.
Section Pi.
Let f (a b:Q) : Q.
exact (let (x,y) := a in
let (z,w) := b in
Qred ((x*w + y*z)%Z/(y*w-x*z)%Z)).
Defined.
Definition ArcTan_multiple : forall x, -(1) <= x <= 1 -> forall n,
sumbool True ((nring n)[*]ArcTan (inj_Q _ x)[=]ArcTan (inj_Q _ (iter_nat n _ (f x) 0))).
Proof.
intros x Hx.
induction n.
right.
admit.
simpl.
destruct (IHn) as [H|H].
left; constructor.
set (y:=(iter_nat n Q (f x) 0)) in *.
destruct (Qlt_le_dec_fast 1 y) as [_|Y0].
left; constructor.
destruct (Qlt_le_dec_fast y (-(1))) as [_|Y1].
left; constructor.
destruct (Qeq_dec (1-x*y) 0) as [_|Y2].
left; constructor.
right.
admit.
Defined.
Lemma reflect_right : forall A B (x:{A}+{B}), (match x with left _ => False | right _ => True end) -> B.
Admitted.
Lemma Pi_Formula :
(((nring 44)[*]ArcTan (inj_Q IR (1 / 57%Z))[-]
(nring 12)[*]ArcTan (inj_Q IR (1 / 682%Z))[+]
(nring 7)[*]ArcTan (inj_Q IR (1 / 239%Z))[+]
(nring 24)[*]ArcTan (inj_Q IR (1 / 12943%Z)))[=]
Pi[/]FourNZ).
Proof.
assert (H0:-(1) <= (1/(57%Z)) <= 1).
split; discriminate.
assert (H1:-(1) <= (1/(239%Z)) <= 1).
split; discriminate.
assert (H2:-(1) <= (1/(682%Z)) <= 1).
split; discriminate.
assert (H3:-(1) <= (1/(12943%Z)) <= 1).
split; discriminate.
set (y0:=(iter_nat 44 _ (f (1/57%Z)) 0)).
set (y1:=(iter_nat 7 _ (f (1/239%Z)) 0)).
set (y2:=(iter_nat 12 _ (f (1/682%Z)) 0)).
set (y3:=(iter_nat 24 _ (f (1/12943%Z)) 0)).
rstepl (nring 44[*]ArcTan (inj_Q IR (1 / 57%Z))[+]
[--](nring 12[*]ArcTan (inj_Q IR (1 / 682%Z)))[+]
(nring 7[*]ArcTan (inj_Q IR (1 / 239%Z))[+]
nring 24[*]ArcTan (inj_Q IR (1 / 12943%Z)))).
csetoid_replace ((nring 44)[*]ArcTan (inj_Q IR (1 / 57%Z)))
(ArcTan (inj_Q IR y0)); [|apply: (reflect_right (ArcTan_multiple H0 44)); now vm_compute].🛠️ Intermediate Coq File (useful for debugging if minimization did not go as far as you wanted)🛠️ 📜 Intermediate Coq File log (useful for debugging if minimization did not go as far as you wanted)📜 Build Log (contains the Coq error message) (truncated to last 8.0KiB; full 7.7MiB file on GitHub Actions Artifacts under
|
Contributor
Minimization interrupted by timeout, being automatically continued. Partially Minimized File /home/runner/work/run-coq-bug-minimizer/run-coq-bug-minimizer/builds/coq/coq-failing/_build_ci/corn/reals/fast/CRpi_fast.v in 5h 15m 9s (from ci-corn) (interrupted by timeout, being automatically continued) (full log on GitHub Actions - verbose log)⭐ ⏱️ Partially Minimized Coq File (timeout)(* -*- mode: coq; coq-prog-args: ("-emacs" "-q" "-w" "-deprecated-native-compiler-option" "-native-compiler" "no" "-coqlib" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq//" "-R" "/github/workspace/builds/coq/coq-failing/_build_ci/corn" "CoRN" "-Q" "/github/workspace/cwd" "Top" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/Bignums" "Bignums" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/HB" "HB" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/Ltac2" "Ltac2" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/MathClasses" "MathClasses" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/Stdlib" "Stdlib" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/elpi" "elpi" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/elpi_elpi" "elpi_elpi" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/elpi_examples" "elpi_examples" "-top" "Top.bug_01") -*- *)
(* File reduced by coq-bug-minimizer from original input, then from 362 lines to 68 lines, then from 80 lines to 1074 lines, then from 1081 lines to 78 lines, then from 89 lines to 1725 lines, then from 1732 lines to 96 lines, then from 108 lines to 1195 lines, then from 1202 lines to 99 lines, then from 110 lines to 1587 lines, then from 1594 lines to 117 lines, then from 129 lines to 896 lines, then from 903 lines to 120 lines, then from 131 lines to 1147 lines, then from 1154 lines to 132 lines, then from 143 lines to 1154 lines, then from 1161 lines to 144 lines, then from 155 lines to 1086 lines, then from 1093 lines to 156 lines, then from 167 lines to 1191 lines, then from 1198 lines to 214 lines, then from 225 lines to 1320 lines, then from 1327 lines to 357 lines, then from 362 lines to 135 lines, then from 147 lines to 1975 lines, then from 1982 lines to 145 lines, then from 156 lines to 1770 lines, then from 1777 lines to 210 lines, then from 221 lines to 2049 lines, then from 2056 lines to 242 lines, then from 253 lines to 1745 lines, then from 1752 lines to 244 lines, then from 255 lines to 1816 lines, then from 1823 lines to 259 lines, then from 271 lines to 1478 lines, then from 1485 lines to 296 lines, then from 307 lines to 1721 lines, then from 1728 lines to 315 lines, then from 327 lines to 1175 lines, then from 1182 lines to 317 lines, then from 329 lines to 1252 lines, then from 1258 lines to 346 lines, then from 357 lines to 1685 lines, then from 1692 lines to 555 lines *)
(* coqc version 9.3+alpha compiled with OCaml 4.14.2
coqtop version 9.3+alpha
Expected coqc runtime on this file: 0.890 sec
Expected coqc peak memory usage on this file: 508664.0 kb *)
Require CoRN.tactics.Step.
Require Corelib.Init.Wf.
Require Corelib.Init.Sumbool.
Require Corelib.BinNums.PosDef.
Require Corelib.Numbers.BinNums.
Require Corelib.Init.Ltac.
Require Corelib.Classes.SetoidTactics.
Require Corelib.Program.Utils.
Require Corelib.BinNums.NatDef.
Require Corelib.Lists.ListDef.
Require Corelib.Program.Tactics.
Require Corelib.Program.Basics.
Require Corelib.Setoids.Setoid.
Require Corelib.Classes.Morphisms_Prop.
Require Corelib.Classes.Equivalence.
Require Corelib.BinNums.IntDef.
Require Corelib.Classes.RelationClasses.
Require Corelib.Program.Wf.
Require Corelib.Classes.Morphisms.
Require Corelib.Relations.Relation_Definitions.
Require MathClasses.theory.CoqStreams.
Require Stdlib.Classes.DecidableClass.
Require Stdlib.Logic.Decidable.
Require Stdlib.Logic.EqdepFacts.
Require Stdlib.Logic.FunctionalExtensionality.
Require Stdlib.Logic.HLevelsBase.
Require Stdlib.Program.Syntax.
Require Stdlib.Unicode.Utf8_core.
Require Stdlib.micromega.ZifyClasses.
Require Stdlib.setoid_ring.Algebra_syntax.
Require Stdlib.BinNums.PosDef.
Require Stdlib.BinNums.IntDef.
Require Stdlib.BinNums.NatDef.
Require Stdlib.Classes.Morphisms_Prop.
Require Stdlib.Classes.SetoidTactics.
Require Stdlib.Classes.RelationClasses.
Require Stdlib.Classes.Morphisms.
Require Stdlib.Classes.Equivalence.
Require Stdlib.Init.Wf.
Require Stdlib.Init.Sumbool.
Require Stdlib.Lists.ListDef.
Require Stdlib.Logic.Eqdep.
Require Stdlib.Logic.Eqdep_dec.
Require Stdlib.Logic.ProofIrrelevanceFacts.
Require Stdlib.Numbers.BinNums.
Require Stdlib.Program.Basics.
Require Stdlib.Program.Tactics.
Require Stdlib.Program.Utils.
Require Stdlib.Program.Wf.
Require Stdlib.Relations.Relation_Definitions.
Require Stdlib.Setoids.Setoid.
Require Stdlib.Unicode.Utf8.
Require CoRN.tactics.CornTac.
Require Stdlib.Bool.Bool.
Require Stdlib.Logic.JMeq.
Require Stdlib.Logic.ProofIrrelevance.
Require Stdlib.Relations.Relation_Operators.
Require Stdlib.Program.Combinators.
Require Stdlib.Relations.Operators_Properties.
Require Stdlib.PArith.BinPosDef.
Require Stdlib.Relations.Relations.
Require Stdlib.Program.Equality.
Require Stdlib.Numbers.NumPrelude.
Require Stdlib.Program.WfExtensionality.
Require MathClasses.misc.stdlib_hints.
Require Stdlib.Structures.Equalities.
Require Stdlib.Program.Subset.
Require Stdlib.Structures.Orders.
Require Stdlib.Structures.OrdersTac.
Require Stdlib.Structures.OrdersFacts.
Require Stdlib.Structures.GenericMinMax.
Require Stdlib.Program.Program.
Require Stdlib.Numbers.NatInt.NZAxioms.
Require Stdlib.Numbers.NatInt.NZBase.
Require Stdlib.Numbers.NatInt.NZAdd.
Require Stdlib.Numbers.NatInt.NZMul.
Require Stdlib.Numbers.NatInt.NZOrder.
Require Stdlib.Numbers.NatInt.NZAddOrder.
Require Stdlib.Numbers.NatInt.NZMulOrder.
Require MathClasses.interfaces.canonical_names.
Require Stdlib.Numbers.NatInt.NZDiv.
Require Stdlib.Numbers.NatInt.NZGcd.
Require Stdlib.Numbers.NatInt.NZParity.
Require Stdlib.Numbers.NatInt.NZPow.
Require Stdlib.Numbers.NatInt.NZSqrt.
Require MathClasses.misc.propholds.
Require MathClasses.misc.setoid_tactics.
Require MathClasses.misc.util.
Require Stdlib.Numbers.NatInt.NZLog.
Require MathClasses.misc.workarounds.
Require Stdlib.Numbers.NatInt.NZBits.
Require MathClasses.misc.decision.
Require Stdlib.Numbers.Integer.Abstract.ZAxioms.
Require Stdlib.Numbers.Natural.Abstract.NAxioms.
Require Stdlib.Numbers.Integer.Abstract.ZBase.
Require Stdlib.Numbers.Natural.Abstract.NBase.
Require Stdlib.Numbers.Integer.Abstract.ZAdd.
Require Stdlib.Numbers.Natural.Abstract.NAdd.
Require Stdlib.Numbers.Integer.Abstract.ZMul.
Require Stdlib.Numbers.Natural.Abstract.NOrder.
Require MathClasses.interfaces.abstract_algebra.
Require Stdlib.Numbers.Integer.Abstract.ZLt.
Require Stdlib.Numbers.Natural.Abstract.NAddOrder.
Require MathClasses.interfaces.orders.
Require Stdlib.Numbers.Integer.Abstract.ZAddOrder.
Require Stdlib.Numbers.Natural.Abstract.NMulOrder.
Require CoRN.algebra.RSetoid.
Require Stdlib.Numbers.Integer.Abstract.ZMulOrder.
Require Stdlib.Numbers.Natural.Abstract.NSub.
Require CoRN.order.PartialOrder.
Require Stdlib.Numbers.Integer.Abstract.ZMaxMin.
Require Stdlib.Numbers.Integer.Abstract.ZParity.
Require Stdlib.Numbers.Integer.Abstract.ZSgnAbs.
Require Stdlib.Numbers.Natural.Abstract.NDiv.
Require Stdlib.Numbers.Natural.Abstract.NGcd.
Require Stdlib.Numbers.Natural.Abstract.NMaxMin.
Require Stdlib.Numbers.Natural.Abstract.NParity.
Require Stdlib.Numbers.Natural.Abstract.NSqrt.
Require CoRN.order.SemiLattice.
Require Stdlib.Numbers.Integer.Abstract.ZDivFloor.
Require Stdlib.Numbers.Integer.Abstract.ZDivTrunc.
Require Stdlib.Numbers.Integer.Abstract.ZGcd.
Require Stdlib.Numbers.Natural.Abstract.NDiv0.
Require Stdlib.Numbers.Natural.Abstract.NPow.
Require CoRN.order.Lattice.
Require Stdlib.Numbers.Integer.Abstract.ZPow.
Require Stdlib.Numbers.Natural.Abstract.NLcm.
Require Stdlib.Numbers.Natural.Abstract.NLog.
Require CoRN.order.TotalOrder.
Require Stdlib.Numbers.Integer.Abstract.ZBits.
Require Stdlib.Numbers.Integer.Abstract.ZLcm.
Require Stdlib.Numbers.Natural.Abstract.NBits.
Require Stdlib.Numbers.Natural.Abstract.NLcm0.
Require Stdlib.Numbers.Integer.Abstract.ZProperties.
Require Stdlib.Numbers.Natural.Abstract.NProperties.
Require Stdlib.Arith.PeanoNat.
Require Stdlib.Arith.Between.
Require Stdlib.Arith.Compare_dec.
Require Stdlib.Arith.EqNat.
Require Stdlib.Arith.Factorial.
Require Stdlib.Arith.Wf_nat.
Require Stdlib.Arith.Euclid.
Require Stdlib.Arith.Peano_dec.
Require Stdlib.Lists.List.
Require Stdlib.Lists.ListDec.
Require Stdlib.micromega.Refl.
Require Stdlib.Lists.Finite.
Require Stdlib.micromega.Tauto.
Require CoRN.stdlib_omissions.Pair.
Require Stdlib.Lists.ListTactics.
Require Stdlib.Sorting.Permutation.
Require Stdlib.PArith.BinPos.
Require Stdlib.Arith.Arith_base.
Require Stdlib.PArith.POrderedType.
Require Stdlib.PArith.Pnat.
Require MathClasses.implementations.ne_list.
Require Stdlib.NArith.BinNatDef.
Require Stdlib.PArith.PArith.
Require Stdlib.NArith.BinNat.
Require Stdlib.setoid_ring.BinList.
Require Stdlib.NArith.Ndiv_def.
Require Stdlib.NArith.Ngcd_def.
Require Stdlib.NArith.Nsqrt_def.
Require Stdlib.setoid_ring.Ring_theory.
Require Stdlib.NArith.Nnat.
Require Stdlib.ZArith.BinIntDef.
Require Stdlib.NArith.NArith_base.
Require Stdlib.ZArith.BinInt.
Require CoRN.model.totalorder.QMinMax.
Require CoRN.reals.RealLists.
Axiom proof_admitted : False.
Tactic Notation "admit" := abstract case proof_admitted.
Module Export Intervals.
Export CoRN.reals.RealLists.
Definition compact (a b : IR) (Hab : a [<=] b) (x : IR) := a [<=] x and x [<=] b.
End Intervals.
Notation Compact := (compact _ _).
Section More_Intervals.
End More_Intervals.
Section Totally_Bounded.
End Totally_Bounded.
Section Compact.
End Compact.
Module Export CoRN_DOT_reals_DOT_Intervals.
Module Export CoRN.
Module Export reals.
Module Export Intervals.
End Intervals.
End reals.
End CoRN.
End CoRN_DOT_reals_DOT_Intervals.
Export CoRN.reals.Intervals.
Section Feq_Equivalence.
End Feq_Equivalence.
Section Operations.
End Operations.
Section Nth_Power.
End Nth_Power.
Section Strong_Nth_Power.
End Strong_Nth_Power.
Module Export CoRN_DOT_ftc_DOT_PartFunEquality.
Module Export CoRN.
Module Export ftc.
Module Export PartFunEquality.
End PartFunEquality.
End ftc.
End CoRN.
End CoRN_DOT_ftc_DOT_PartFunEquality.
Export CoRN.ftc.PartFunEquality.
Module Export FunctSums.
End FunctSums.
Section Definitions_and_Basic_Results.
Variables a b : IR.
Hypothesis Hab : a [<=] b.
Let I := Compact Hab.
Variable F : PartIR.
Let P := Dom F.
Definition Continuous_I := included I P and (forall e, [0] [<] e -> {d : IR | [0] [<] d |
forall x y, I x -> I y -> forall Hx Hy, AbsIR (x[-]y) [<=] d -> AbsIR (F x Hx[-]F y Hy) [<=] e}).
End Definitions_and_Basic_Results.
Arguments Continuous_I [a b].
Module Export Continuity.
End Continuity.
Section Refinements.
End Refinements.
Section Getting_Points.
End Getting_Points.
Section Lemmas.
End Lemmas.
Section Even_Partitions.
End Even_Partitions.
Section More_Definitions.
End More_Definitions.
Section Sep_Partitions.
End Sep_Partitions.
Module Export CoRN_DOT_ftc_DOT_Partitions.
Module Export CoRN.
Module Export ftc.
Module Export Partitions.
End Partitions.
End ftc.
End CoRN.
End CoRN_DOT_ftc_DOT_Partitions.
Export CoRN.ftc.Partitions.
Section Separating_Partition.
End Separating_Partition.
Module Export CoRN_DOT_ftc_DOT_RefSeparating.
Module Export CoRN.
Module Export ftc.
Module Export RefSeparating.
End RefSeparating.
End ftc.
End CoRN.
End CoRN_DOT_ftc_DOT_RefSeparating.
Export CoRN.ftc.RefSeparating.
Module Export RefLemma.
End RefLemma.
Section Integral.
Variables a b : IR.
Hypothesis Hab : a [<=] b.
Variable F : PartIR.
Hypothesis contF : Continuous_I Hab F.
Definition integral_seq : nat -> IR.
Admitted.
Lemma Cauchy_Darboux_Seq : Cauchy_prop integral_seq.
Admitted.
Definition integral := Lim (Build_CauchySeq _ _ Cauchy_Darboux_Seq).
End Integral.
Section Partition_Join.
End Partition_Join.
Module Export CoRN_DOT_ftc_DOT_Integral.
Module Export CoRN.
Module Export ftc.
Module Export Integral.
End Integral.
End ftc.
End CoRN.
End CoRN_DOT_ftc_DOT_Integral.
Inductive interval : Type :=
| realline : interval
| openl : IR -> interval
| openr : IR -> interval
| closel : IR -> interval
| closer : IR -> interval
| olor : IR -> IR -> interval
| olcr : IR -> IR -> interval
| clor : IR -> IR -> interval
| clcr : IR -> IR -> interval.
Definition iprop (I : interval) (x : IR) : CProp.
exact (match I with
| realline => True
| openr b => x [<] b
| openl a => a [<] x
| closer b => x [<=] b
| closel a => a [<=] x
| olor a b => a [<] x and x [<] b
| olcr a b => a [<] x and x [<=] b
| clor a b => a [<=] x and x [<] b
| clcr a b => a [<=] x and x [<=] b
end).
Defined.
Coercion iprop : interval >-> Funclass.
Lemma iprop_wd : forall I : interval, pred_wd _ I.
Admitted.
Section Single_Compact_Interval.
End Single_Compact_Interval.
Section Proper_Compact_with_One_or_Two_Points.
End Proper_Compact_with_One_or_Two_Points.
Section Functions.
Variable I : interval.
Definition Continuous F := included I (Dom F) and (forall a b (Hab : a [<=] b),
included (Compact Hab) I -> Continuous_I Hab F).
End Functions.
Section Reflexivity_Properties.
End Reflexivity_Properties.
Section Lemmas.
End Lemmas.
Module Export CoRN_DOT_ftc_DOT_MoreIntervals.
Module Export CoRN.
Module Export ftc.
Module Export MoreIntervals.
End MoreIntervals.
End ftc.
End CoRN.
End CoRN_DOT_ftc_DOT_MoreIntervals.
Export CoRN.ftc.MoreIntervals.
Module Export CoRN.
Module Export ftc.
Module Export MoreFunctions.
End MoreFunctions.
End ftc.
End CoRN.
Export CoRN.ftc.Integral.
Export CoRN.ftc.MoreFunctions.
Section Definitions.
Variables a b : IR.
Hypothesis Hab : Min a b [<=] Max a b.
Variable F : PartIR.
Hypothesis HF : Continuous_I Hab F.
Lemma Integral_inc1 : Continuous_I (Min_leEq_lft a b) F.
Admitted.
Lemma Integral_inc2 : Continuous_I (Min_leEq_rht a b) F.
Admitted.
Definition Integral :=
integral _ _ (Min_leEq_rht a b) F Integral_inc2[-]integral _ _ (Min_leEq_lft a b) _ Integral_inc1.
End Definitions.
Arguments Integral [a b Hab F].
Section Indefinite_Integral.
Variable I : interval.
Variable F : PartIR.
Hypothesis contF : Continuous I F.
Variable a : IR.
Hypothesis Ha : I a.
Lemma prim_lemma : forall x : IR, I x -> Continuous_I (Min_leEq_Max a x) F.
Admitted.
Lemma Fprim_strext : forall x y Hx Hy,
Integral (prim_lemma x Hx) [#] Integral (prim_lemma y Hy) -> x [#] y.
Admitted.
Definition Fprim : PartIR.
apply Build_PartFunct with (pfpfun := fun (x : IR) (Hx : I x) => Integral (prim_lemma x Hx)).
Proof.
apply iprop_wd.
exact Fprim_strext.
Defined.
End Indefinite_Integral.
Arguments Fprim [I F].
Notation "[-S-] F" := (Fprim F) (at level 20).
Fixpoint pi_seq (n : nat) : IR.
Admitted.
Lemma pi_seq_Cauchy : Cauchy_prop pi_seq.
Admitted.
Definition Pi := Two[*]Lim (Build_CauchySeq _ _ pi_seq_Cauchy).
Lemma ArcTan_def_lemma : Continuous realline {1/} ( [-C-][1]{+}FId{^}2).
Admitted.
Definition ArcTang := ( [-S-]ArcTan_def_lemma) [0] I.
Definition ArcTan (x : IR) := ArcTang x I.
Import CoRN.model.totalorder.QMinMax.
Import CoRN.stdlib_omissions.Q.
Set Implicit Arguments.
Section Pi.
Let f (a b:Q) : Q.
exact (let (x,y) := a in
let (z,w) := b in
Qred ((x*w + y*z)%Z/(y*w-x*z)%Z)).
Defined.
Definition ArcTan_multiple : forall x, -(1) <= x <= 1 -> forall n,
sumbool True ((nring n)[*]ArcTan (inj_Q _ x)[=]ArcTan (inj_Q _ (iter_nat n _ (f x) 0))).
Proof.
intros x Hx.
induction n.
right.
admit.
simpl.
destruct (IHn) as [H|H].
left; constructor.
set (y:=(iter_nat n Q (f x) 0)) in *.
destruct (Qlt_le_dec_fast 1 y) as [_|Y0].
left; constructor.
destruct (Qlt_le_dec_fast y (-(1))) as [_|Y1].
left; constructor.
destruct (Qeq_dec (1-x*y) 0) as [_|Y2].
left; constructor.
right.
admit.
Defined.
Lemma reflect_right : forall A B (x:{A}+{B}), (match x with left _ => False | right _ => True end) -> B.
Admitted.
Lemma Pi_Formula :
(((nring 44)[*]ArcTan (inj_Q IR (1 / 57%Z))[-]
(nring 12)[*]ArcTan (inj_Q IR (1 / 682%Z))[+]
(nring 7)[*]ArcTan (inj_Q IR (1 / 239%Z))[+]
(nring 24)[*]ArcTan (inj_Q IR (1 / 12943%Z)))[=]
Pi[/]FourNZ).
Proof.
assert (H0:-(1) <= (1/(57%Z)) <= 1).
split; discriminate.
assert (H1:-(1) <= (1/(239%Z)) <= 1).
split; discriminate.
assert (H2:-(1) <= (1/(682%Z)) <= 1).
split; discriminate.
assert (H3:-(1) <= (1/(12943%Z)) <= 1).
split; discriminate.
set (y0:=(iter_nat 44 _ (f (1/57%Z)) 0)).
set (y1:=(iter_nat 7 _ (f (1/239%Z)) 0)).
set (y2:=(iter_nat 12 _ (f (1/682%Z)) 0)).
set (y3:=(iter_nat 24 _ (f (1/12943%Z)) 0)).
rstepl (nring 44[*]ArcTan (inj_Q IR (1 / 57%Z))[+]
[--](nring 12[*]ArcTan (inj_Q IR (1 / 682%Z)))[+]
(nring 7[*]ArcTan (inj_Q IR (1 / 239%Z))[+]
nring 24[*]ArcTan (inj_Q IR (1 / 12943%Z)))).
csetoid_replace ((nring 44)[*]ArcTan (inj_Q IR (1 / 57%Z)))
(ArcTan (inj_Q IR y0)); [|apply: (reflect_right (ArcTan_multiple H0 44)); now vm_compute].🛠️ Intermediate Coq File (useful for debugging if minimization did not go as far as you wanted)🛠️ 📜 Intermediate Coq File log (useful for debugging if minimization did not go as far as you wanted)📜 Build Log (contains the Coq error message) (truncated to last 8.0KiB; full 7.7MiB file on GitHub Actions Artifacts under
|
Contributor
Minimization interrupted by timeout, being automatically continued. Partially Minimized File /home/runner/work/run-coq-bug-minimizer/run-coq-bug-minimizer/builds/coq/coq-failing/_build_ci/corn/reals/fast/CRpi_fast.v in 5h 15m 7s (from ci-corn) (interrupted by timeout, being automatically continued) (full log on GitHub Actions - verbose log)⭐ ⏱️ Partially Minimized Coq File (timeout)(* -*- mode: coq; coq-prog-args: ("-emacs" "-q" "-w" "-deprecated-native-compiler-option" "-native-compiler" "no" "-coqlib" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq//" "-R" "/github/workspace/builds/coq/coq-failing/_build_ci/corn" "CoRN" "-Q" "/github/workspace/cwd" "Top" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/Bignums" "Bignums" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/HB" "HB" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/Ltac2" "Ltac2" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/MathClasses" "MathClasses" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/Stdlib" "Stdlib" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/elpi" "elpi" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/elpi_elpi" "elpi_elpi" "-Q" "/github/workspace/builds/coq/coq-failing/_install_ci/lib/coq///user-contrib/elpi_examples" "elpi_examples" "-top" "Top.bug_01") -*- *)
(* File reduced by coq-bug-minimizer from original input, then from 362 lines to 68 lines, then from 80 lines to 1074 lines, then from 1081 lines to 78 lines, then from 89 lines to 1725 lines, then from 1732 lines to 96 lines, then from 108 lines to 1195 lines, then from 1202 lines to 99 lines, then from 110 lines to 1587 lines, then from 1594 lines to 117 lines, then from 129 lines to 896 lines, then from 903 lines to 120 lines, then from 131 lines to 1147 lines, then from 1154 lines to 132 lines, then from 143 lines to 1154 lines, then from 1161 lines to 144 lines, then from 155 lines to 1086 lines, then from 1093 lines to 156 lines, then from 167 lines to 1191 lines, then from 1198 lines to 214 lines, then from 225 lines to 1320 lines, then from 1327 lines to 357 lines, then from 362 lines to 135 lines, then from 147 lines to 1975 lines, then from 1982 lines to 145 lines, then from 156 lines to 1770 lines, then from 1777 lines to 210 lines, then from 221 lines to 2049 lines, then from 2056 lines to 242 lines, then from 253 lines to 1745 lines, then from 1752 lines to 244 lines, then from 255 lines to 1816 lines, then from 1823 lines to 259 lines, then from 271 lines to 1478 lines, then from 1485 lines to 296 lines, then from 307 lines to 1721 lines, then from 1728 lines to 315 lines, then from 327 lines to 1175 lines, then from 1182 lines to 317 lines, then from 329 lines to 1252 lines, then from 1258 lines to 346 lines, then from 357 lines to 1685 lines, then from 1692 lines to 555 lines, then from 563 lines to 210 lines, then from 222 lines to 972 lines, then from 978 lines to 220 lines, then from 231 lines to 1055 lines, then from 1062 lines to 248 lines, then from 259 lines to 2033 lines, then from 2038 lines to 311 lines, then from 322 lines to 1621 lines, then from 1627 lines to 331 lines, then from 342 lines to 1683 lines, then from 1690 lines to 368 lines, then from 379 lines to 730 lines, then from 737 lines to 384 lines, then from 395 lines to 750 lines, then from 757 lines to 410 lines, then from 421 lines to 763 lines, then from 770 lines to 418 lines, then from 429 lines to 840 lines, then from 847 lines to 426 lines, then from 437 lines to 767 lines, then from 774 lines to 447 lines, then from 458 lines to 780 lines, then from 787 lines to 455 lines, then from 466 lines to 812 lines, then from 819 lines to 469 lines, then from 480 lines to 1590 lines, then from 1596 lines to 594 lines *)
(* coqc version 9.3+alpha compiled with OCaml 4.14.2
coqtop version 9.3+alpha
Expected coqc runtime on this file: 0.953 sec
Expected coqc peak memory usage on this file: 502764.0 kb *)
Require CoRN.tactics.Step.
Require Corelib.BinNums.PosDef.
Require Corelib.Relations.Relation_Definitions.
Require Corelib.Program.Wf.
Require Corelib.Program.Tactics.
Require Corelib.BinNums.NatDef.
Require Corelib.Classes.Morphisms.
Require Corelib.Init.Ltac.
Require Corelib.Lists.ListDef.
Require Corelib.Classes.Morphisms_Prop.
Require Corelib.BinNums.IntDef.
Require Corelib.Init.Sumbool.
Require Corelib.Classes.SetoidTactics.
Require Corelib.Init.Wf.
Require Corelib.Setoids.Setoid.
Require Corelib.Program.Utils.
Require Corelib.Classes.Equivalence.
Require Corelib.Program.Basics.
Require Corelib.Numbers.BinNums.
Require Corelib.Classes.RelationClasses.
Require MathClasses.theory.CoqStreams.
Require Stdlib.Classes.DecidableClass.
Require Stdlib.Logic.Decidable.
Require Stdlib.Logic.EqdepFacts.
Require Stdlib.Logic.FunctionalExtensionality.
Require Stdlib.Logic.HLevelsBase.
Require Stdlib.Program.Syntax.
Require Stdlib.Unicode.Utf8_core.
Require Stdlib.micromega.ZifyClasses.
Require Stdlib.setoid_ring.Algebra_syntax.
Require Stdlib.BinNums.IntDef.
Require Stdlib.BinNums.PosDef.
Require Stdlib.BinNums.NatDef.
Require Stdlib.Classes.Morphisms_Prop.
Require Stdlib.Classes.SetoidTactics.
Require Stdlib.Classes.Morphisms.
Require Stdlib.Classes.Equivalence.
Require Stdlib.Classes.RelationClasses.
Require Stdlib.Init.Wf.
Require Stdlib.Init.Sumbool.
Require Stdlib.Lists.ListDef.
Require Stdlib.Logic.Eqdep.
Require Stdlib.Logic.Eqdep_dec.
Require Stdlib.Logic.ProofIrrelevanceFacts.
Require Stdlib.Numbers.BinNums.
Require Stdlib.Program.Basics.
Require Stdlib.Program.Tactics.
Require Stdlib.Program.Utils.
Require Stdlib.Program.Wf.
Require Stdlib.Relations.Relation_Definitions.
Require Stdlib.Setoids.Setoid.
Require Stdlib.Unicode.Utf8.
Require CoRN.tactics.CornTac.
Require Stdlib.Bool.Bool.
Require Stdlib.Logic.JMeq.
Require Stdlib.Logic.ProofIrrelevance.
Require Stdlib.Relations.Relation_Operators.
Require Stdlib.Program.Combinators.
Require Stdlib.Relations.Operators_Properties.
Require Stdlib.PArith.BinPosDef.
Require Stdlib.Relations.Relations.
Require Stdlib.Program.Equality.
Require Stdlib.Numbers.NumPrelude.
Require Stdlib.Program.WfExtensionality.
Require MathClasses.misc.stdlib_hints.
Require Stdlib.Structures.Equalities.
Require Stdlib.Program.Subset.
Require Stdlib.Structures.Orders.
Require Stdlib.Structures.OrdersTac.
Require Stdlib.Structures.OrdersFacts.
Require Stdlib.Structures.GenericMinMax.
Require Stdlib.Program.Program.
Require Stdlib.Numbers.NatInt.NZAxioms.
Require Stdlib.Numbers.NatInt.NZBase.
Require Stdlib.Numbers.NatInt.NZAdd.
Require Stdlib.Numbers.NatInt.NZMul.
Require Stdlib.Numbers.NatInt.NZOrder.
Require Stdlib.Numbers.NatInt.NZAddOrder.
Require Stdlib.Numbers.NatInt.NZMulOrder.
Require MathClasses.interfaces.canonical_names.
Require Stdlib.Numbers.NatInt.NZDiv.
Require Stdlib.Numbers.NatInt.NZGcd.
Require Stdlib.Numbers.NatInt.NZParity.
Require Stdlib.Numbers.NatInt.NZPow.
Require Stdlib.Numbers.NatInt.NZSqrt.
Require MathClasses.misc.propholds.
Require MathClasses.misc.setoid_tactics.
Require MathClasses.misc.util.
Require Stdlib.Numbers.NatInt.NZLog.
Require MathClasses.misc.workarounds.
Require Stdlib.Numbers.NatInt.NZBits.
Require MathClasses.misc.decision.
Require Stdlib.Numbers.Integer.Abstract.ZAxioms.
Require Stdlib.Numbers.Natural.Abstract.NAxioms.
Require Stdlib.Numbers.Integer.Abstract.ZBase.
Require Stdlib.Numbers.Natural.Abstract.NBase.
Require Stdlib.Numbers.Integer.Abstract.ZAdd.
Require Stdlib.Numbers.Natural.Abstract.NAdd.
Require Stdlib.Numbers.Integer.Abstract.ZMul.
Require Stdlib.Numbers.Natural.Abstract.NOrder.
Require MathClasses.interfaces.abstract_algebra.
Require Stdlib.Numbers.Integer.Abstract.ZLt.
Require CoRN.model.totalorder.QMinMax.
Require CoRN.model.semigroups.Qsemigroup.
Require CoRN.reals.CReals.
Axiom proof_admitted : False.
Tactic Notation "admit" := abstract case proof_admitted.
Export CoRN.reals.CReals.
Section R_CReals.
End R_CReals.
Module Export CoRN_DOT_reals_DOT_Cauchy_CReals.
Module Export CoRN.
Module Export reals.
Module Export Cauchy_CReals.
End Cauchy_CReals.
End reals.
End CoRN.
End CoRN_DOT_reals_DOT_Cauchy_CReals.
Export CoRN.model.semigroups.Qsemigroup.
Lemma ZEROQ_as_rht_unit3 : is_rht_unit (S:=Q_as_CSetoid) Qplus_is_bin_fun 0.
Admitted.
Lemma ZEROQ_as_lft_unit3 : is_lft_unit (S:=Q_as_CSetoid) Qplus_is_bin_fun 0.
Admitted.
Definition Q_is_CMonoid := Build_is_CMonoid
Q_as_CSemiGroup _ ZEROQ_as_rht_unit3 ZEROQ_as_lft_unit3.
Definition Q_as_CMonoid := Build_CMonoid Q_as_CSemiGroup _ Q_is_CMonoid.
Module Export Qmonoid.
End Qmonoid.
Import CoRN.algebra.CGroups.
Lemma Q_is_CGroup : is_CGroup Q_as_CMonoid Qopp_is_fun.
Admitted.
Definition Q_as_CGroup := Build_CGroup Q_as_CMonoid Qopp_is_fun Q_is_CGroup.
Module Export Qgroup.
End Qgroup.
Import CoRN.algebra.CAbGroups.
Lemma Q_is_CAbGroup : is_CAbGroup Q_as_CGroup.
Admitted.
Definition Q_as_CAbGroup := Build_CAbGroup Q_as_CGroup Q_is_CAbGroup.
Module Export CoRN_DOT_model_DOT_abgroups_DOT_Qabgroup.
Module Export CoRN.
Module Export model.
Module Export abgroups.
Module Export Qabgroup.
End Qabgroup.
End abgroups.
End model.
End CoRN.
End CoRN_DOT_model_DOT_abgroups_DOT_Qabgroup.
Export CoRN.model.abgroups.Qabgroup.
Import CoRN.algebra.CRings.
Definition Q_is_CRing : is_CRing Q_as_CAbGroup 1 Qmult_is_bin_fun.
Admitted.
Definition Q_as_CRing := Build_CRing _ _ _ Q_is_CRing.
Module Export Qring.
End Qring.
Import CoRN.algebra.CFields.
Lemma Q_is_CField : is_CField Q_as_CRing Qinv_dep.
Admitted.
Definition Q_as_CField := Build_CField _ _ Q_is_CField Qinv_strext.
Module Export Qfield.
End Qfield.
Import CoRN.algebra.COrdFields.
Definition Qlt_is_strict_order := Build_strictorder
Qlt_trans Qlt_is_antisymmetric_unfolded.
Definition Q_is_COrdField := Build_is_COrdField Q_as_CField
Qlt_is_CSetoid_relation Qle (default_greater Q_as_CField Qlt_is_CSetoid_relation)
(default_grEq Q_as_CField Qle) Qlt_is_strict_order (fun x y E z => proj2 (Qplus_lt_l x y z) E)
Qmult_lt_0_compat Qlt_gives_apartness Qle_is_not_lt Qgt_is_lt Qge_is_not_gt.
Definition Q_as_COrdField := Build_COrdField _ _ _ _ _ Q_is_COrdField.
Module Export CoRN_DOT_model_DOT_ordfields_DOT_Qordfield.
Module Export CoRN.
Module Export model.
Module Export ordfields.
Module Export Qordfield.
End Qordfield.
End ordfields.
End model.
End CoRN.
End CoRN_DOT_model_DOT_ordfields_DOT_Qordfield.
Export CoRN.model.ordfields.Qordfield.
Export CoRN.reals.Cauchy_CReals.
Module Export CoRN_DOT_model_DOT_reals_DOT_Cauchy_IR.
Module Export CoRN.
Module Export model.
Module Export reals.
Module Export Cauchy_IR.
End Cauchy_IR.
End reals.
End model.
End CoRN.
End CoRN_DOT_model_DOT_reals_DOT_Cauchy_IR.
Definition IR : CReals.
Admitted.
Notation PartIR := (PartFunct IR).
Section CReals_axioms.
End CReals_axioms.
Section Cauchy_Defs.
End Cauchy_Defs.
Section Inequalities.
End Inequalities.
Section Equiv_Cauchy.
End Equiv_Cauchy.
Section Cauchy_props.
End Cauchy_props.
Module Export CoRN_DOT_reals_DOT_CauchySeq.
Module Export CoRN.
Module Export reals.
Module Export CauchySeq.
End CauchySeq.
End reals.
End CoRN.
End CoRN_DOT_reals_DOT_CauchySeq.
Export CoRN.model.reals.Cauchy_IR.
Section Rational_sequence_prelogue.
Variable R1 : CReals.
Local Coercion nat_of_P : positive >-> nat.
Lemma den_is_nonzero : forall x : Q_as_COrdField, nring (R:=R1) (Qden x) [#] [0].
Admitted.
Definition inj_Q : Q_as_COrdField -> R1.
Proof.
intro x.
case x.
intros num0 den0.
exact (zring num0[/]nring (R:=R1) den0[//]den_is_nonzero (Qmake num0 den0)).
Defined.
End Rational_sequence_prelogue.
Module Export Q_in_CReals.
End Q_in_CReals.
Export CoRN.reals.CauchySeq.
Section Max_function.
Variables x y : IR.
Definition MAX : IR.
Admitted.
End Max_function.
Lemma MAX_strext : bin_op_strext _ MAX.
Admitted.
Definition Max := Build_CSetoid_bin_op _ MAX MAX_strext.
Section Minimum.
Definition Min : CSetoid_bin_op IR.
Admitted.
Lemma Min_leEq_lft : forall x y : IR, Min x y [<=] x.
Admitted.
Lemma Min_leEq_rht : forall x y : IR, Min x y [<=] y.
Admitted.
Variables a b : IR.
Lemma Min_leEq_Max : Min a b [<=] Max a b.
Admitted.
End Minimum.
Definition AbsIR : CSetoid_un_op IR.
Admitted.
Section SeqMax.
End SeqMax.
Section Part_Function_Max.
End Part_Function_Max.
Section Part_Function_Abs.
End Part_Function_Abs.
Section Inclusion.
End Inclusion.
Module Export CoRN_DOT_reals_DOT_Max_AbsIR.
Module Export CoRN.
Module Export reals.
Module Export Max_AbsIR.
End Max_AbsIR.
End reals.
End CoRN.
End CoRN_DOT_reals_DOT_Max_AbsIR.
Export CoRN.reals.Max_AbsIR.
Section More_Cauchy_Props.
End More_Cauchy_Props.
Section Subsequences.
End Subsequences.
Section Cauchy_Subsequences.
End Cauchy_Subsequences.
Section Properties_of_Exponentiation.
End Properties_of_Exponentiation.
Module Export CoRN_DOT_reals_DOT_CReals1.
Module Export CoRN.
Module Export reals.
Module Export CReals1.
End CReals1.
End reals.
End CoRN.
End CoRN_DOT_reals_DOT_CReals1.
Export CoRN.reals.CReals1.
Module Export CoRN.
Module Export reals.
Module Export RealLists.
End RealLists.
End reals.
End CoRN.
Export CoRN.reals.RealLists.
Definition compact (a b : IR) (Hab : a [<=] b) (x : IR) := a [<=] x and x [<=] b.
Notation Compact := (compact _ _).
Section Definitions_and_Basic_Results.
Variables a b : IR.
Hypothesis Hab : a [<=] b.
Let I := Compact Hab.
Variable F : PartIR.
Let P := Dom F.
Definition Continuous_I := included I P and (forall e, [0] [<] e -> {d : IR | [0] [<] d |
forall x y, I x -> I y -> forall Hx Hy, AbsIR (x[-]y) [<=] d -> AbsIR (F x Hx[-]F y Hy) [<=] e}).
End Definitions_and_Basic_Results.
Arguments Continuous_I [a b].
Section Integral.
Variables a b : IR.
Hypothesis Hab : a [<=] b.
Variable F : PartIR.
Hypothesis contF : Continuous_I Hab F.
Definition integral_seq : nat -> IR.
Admitted.
Lemma Cauchy_Darboux_Seq : Cauchy_prop integral_seq.
Admitted.
Definition integral := Lim (Build_CauchySeq _ _ Cauchy_Darboux_Seq).
End Integral.
Inductive interval : Type :=
| realline : interval
| openl : IR -> interval
| openr : IR -> interval
| closel : IR -> interval
| closer : IR -> interval
| olor : IR -> IR -> interval
| olcr : IR -> IR -> interval
| clor : IR -> IR -> interval
| clcr : IR -> IR -> interval.
Definition iprop (I : interval) (x : IR) : CProp.
exact (match I with
| realline => True
| openr b => x [<] b
| openl a => a [<] x
| closer b => x [<=] b
| closel a => a [<=] x
| olor a b => a [<] x and x [<] b
| olcr a b => a [<] x and x [<=] b
| clor a b => a [<=] x and x [<] b
| clcr a b => a [<=] x and x [<=] b
end).
Defined.
Coercion iprop : interval >-> Funclass.
Lemma iprop_wd : forall I : interval, pred_wd _ I.
Admitted.
Section Functions.
Variable I : interval.
Definition Continuous F := included I (Dom F) and (forall a b (Hab : a [<=] b),
included (Compact Hab) I -> Continuous_I Hab F).
End Functions.
Section Definitions.
Variables a b : IR.
Hypothesis Hab : Min a b [<=] Max a b.
Variable F : PartIR.
Hypothesis HF : Continuous_I Hab F.
Lemma Integral_inc1 : Continuous_I (Min_leEq_lft a b) F.
Admitted.
Lemma Integral_inc2 : Continuous_I (Min_leEq_rht a b) F.
Admitted.
Definition Integral :=
integral _ _ (Min_leEq_rht a b) F Integral_inc2[-]integral _ _ (Min_leEq_lft a b) _ Integral_inc1.
End Definitions.
Arguments Integral [a b Hab F].
Section Indefinite_Integral.
Variable I : interval.
Variable F : PartIR.
Hypothesis contF : Continuous I F.
Variable a : IR.
Hypothesis Ha : I a.
Lemma prim_lemma : forall x : IR, I x -> Continuous_I (Min_leEq_Max a x) F.
Admitted.
Lemma Fprim_strext : forall x y Hx Hy,
Integral (prim_lemma x Hx) [#] Integral (prim_lemma y Hy) -> x [#] y.
Admitted.
Definition Fprim : PartIR.
apply Build_PartFunct with (pfpfun := fun (x : IR) (Hx : I x) => Integral (prim_lemma x Hx)).
Proof.
apply iprop_wd.
exact Fprim_strext.
Defined.
End Indefinite_Integral.
Arguments Fprim [I F].
Notation "[-S-] F" := (Fprim F) (at level 20).
Fixpoint pi_seq (n : nat) : IR.
Admitted.
Lemma pi_seq_Cauchy : Cauchy_prop pi_seq.
Admitted.
Definition Pi := Two[*]Lim (Build_CauchySeq _ _ pi_seq_Cauchy).
Lemma ArcTan_def_lemma : Continuous realline {1/} ( [-C-][1]{+}FId{^}2).
Admitted.
Definition ArcTang := ( [-S-]ArcTan_def_lemma) [0] I.
Definition ArcTan (x : IR) := ArcTang x I.
Import CoRN.model.totalorder.QMinMax.
Import CoRN.stdlib_omissions.Q.
Set Implicit Arguments.
Section Pi.
Let f (a b:Q) : Q.
exact (let (x,y) := a in
let (z,w) := b in
Qred ((x*w + y*z)%Z/(y*w-x*z)%Z)).
Defined.
Definition ArcTan_multiple : forall x, -(1) <= x <= 1 -> forall n,
sumbool True ((nring n)[*]ArcTan (inj_Q _ x)[=]ArcTan (inj_Q _ (iter_nat n _ (f x) 0))).
Proof.
intros x Hx.
induction n.
right.
admit.
simpl.
destruct (IHn) as [H|H].
left; constructor.
set (y:=(iter_nat n Q (f x) 0)) in *.
destruct (Qlt_le_dec_fast 1 y) as [_|Y0].
left; constructor.
destruct (Qlt_le_dec_fast y (-(1))) as [_|Y1].
left; constructor.
destruct (Qeq_dec (1-x*y) 0) as [_|Y2].
left; constructor.
right.
admit.
Defined.
Lemma reflect_right : forall A B (x:{A}+{B}), (match x with left _ => False | right _ => True end) -> B.
Admitted.
Lemma Pi_Formula :
(((nring 44)[*]ArcTan (inj_Q IR (1 / 57%Z))[-]
(nring 12)[*]ArcTan (inj_Q IR (1 / 682%Z))[+]
(nring 7)[*]ArcTan (inj_Q IR (1 / 239%Z))[+]
(nring 24)[*]ArcTan (inj_Q IR (1 / 12943%Z)))[=]
Pi[/]FourNZ).
Proof.
assert (H0:-(1) <= (1/(57%Z)) <= 1).
split; discriminate.
assert (H1:-(1) <= (1/(239%Z)) <= 1).
split; discriminate.
assert (H2:-(1) <= (1/(682%Z)) <= 1).
split; discriminate.
assert (H3:-(1) <= (1/(12943%Z)) <= 1).
split; discriminate.
set (y0:=(iter_nat 44 _ (f (1/57%Z)) 0)).
set (y1:=(iter_nat 7 _ (f (1/239%Z)) 0)).
set (y2:=(iter_nat 12 _ (f (1/682%Z)) 0)).
set (y3:=(iter_nat 24 _ (f (1/12943%Z)) 0)).
rstepl (nring 44[*]ArcTan (inj_Q IR (1 / 57%Z))[+]
[--](nring 12[*]ArcTan (inj_Q IR (1 / 682%Z)))[+]
(nring 7[*]ArcTan (inj_Q IR (1 / 239%Z))[+]
nring 24[*]ArcTan (inj_Q IR (1 / 12943%Z)))).
csetoid_replace ((nring 44)[*]ArcTan (inj_Q IR (1 / 57%Z)))
(ArcTan (inj_Q IR y0)); [|apply: (reflect_right (ArcTan_multiple H0 44)); now vm_compute].🛠️ Intermediate Coq File (useful for debugging if minimization did not go as far as you wanted)🛠️ 📜 Intermediate Coq File log (useful for debugging if minimization did not go as far as you wanted)📜 Build Log (contains the Coq error message) (truncated to last 8.0KiB; full 7.7MiB file on GitHub Actions Artifacts under
|
Contributor
Minimization interrupted by timeout, being automatically continued. Partially Minimized File /home/runner/work/run-coq-bug-minimizer/run-coq-bug-minimizer/builds/coq/coq-failing/_build_ci/corn/reals/fast/CRpi_fast.v in 5h 15m 7s (from ci-corn) (interrupted by timeout, being automatically continued) (full log on GitHub Actions - verbose log)⭐ ⏱️ Partially Minimized Coq File (timeout) (truncated to first and last 32KiB; full 73KiB file on GitHub Actions Artifacts under
|
Contributor
|
🏁 Bench results: INFO: failed to install coq-fiat-crypto-with-bedrock (dependency coq-rewriter failed) 🐢 Top 25 slow downs┌──────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────┐ │ TOP 25 SLOW DOWNS │ │ │ │ OLD NEW DIFF %DIFF Ln FILE │ ├──────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────┤ │ 203 6003 5799.9482 2860.12% 8 coq-neural-net-interp-computed-lite/theories/MaxOfTwoNumbersSimpler/Computed/AllLogits.v.html │ │ 36.6 1818 1780.9219 4863.45% 139 coq-fiat-parsers/src/Parsers/Refinement/SharpenedJSON.v.html │ │ 38.5 632 593.2239 1541.09% 224 coq-performance-tests-lite/PerformanceExperiments/rewrite_lift_lets_map.v.html │ │ 1.55 278 276.6165 17838.12% 81 coq-category-theory/Theory/Metacategory/DecideExample.v.html │ │ 7.438 112.327 104.8890 1410.18% 40843 coq-compcert/cparser/Parser.v.html │ │ 49.0 124 75.2445 153.44% 376 coq-unimath/UniMath/ModelCategories/Generated/LNWFSMonoidalStructure.v.html │ │ 3.716 71.1 67.3840 1813.35% 40839 coq-compcert/cparser/Parser.v.html │ │ 0.0301 45.9 45.8248 152409.12% 396 coq-unimath/UniMath/CategoryTheory/Hyperdoctrines/HValuedSets.v.html │ │ 8.74 38.6 29.8939 342.23% 453 coq-unimath/UniMath/SyntheticHomotopyTheory/Circle2.v.html │ │ 1.85 28.8 26.9341 1456.70% 79 coq-fiat-parsers/src/Parsers/Refinement/SharpenedJSON.v.html │ │ 1.86 28.8 26.9216 1450.23% 77 coq-fiat-parsers/src/Parsers/Refinement/SharpenedJSON.v.html │ │ 1.92 28.7 26.8083 1395.64% 66 coq-fiat-parsers/src/Parsers/Refinement/SharpenedJSON.v.html │ │ 1.99 28.7 26.7416 1345.08% 64 coq-fiat-parsers/src/Parsers/Refinement/SharpenedJSON.v.html │ │ 24.2 46.3 22.1342 91.41% 550 coq-bedrock2/bedrock2/src/bedrock2Examples/insertionsort.v.html │ │ 46.4 67.6 21.1718 45.65% 115 coq-bedrock2/bedrock2/src/bedrock2Examples/full_mul.v.html │ │ 1.62 22.4 20.7539 1279.74% 322 coq-performance-tests-lite/PerformanceExperiments/rewrite_plus_0_tree.v.html │ │ 16.7 36.8 20.1405 120.74% 905 coq-unimath/UniMath/ModelCategories/Generated/LNWFSCocomplete.v.html │ │ 2.49 22.5 19.9946 801.43% 116 coq-bedrock2/bedrock2/src/bedrock2Examples/full_mul.v.html │ │ 21.1 40.0 18.9039 89.55% 338 coq-unimath/UniMath/ModelCategories/Generated/LNWFSMonoidalStructure.v.html │ │ 0.819 15.8 15.0156 1833.51% 603 coq-coqprime/src/Coqprime/elliptic/SMain.v.html │ │ 0.0712 11.9 11.7824 16542.54% 601 coq-unimath/UniMath/AlgebraicTheories/RepresentationTheorem.v.html │ │ 0.0733 10.7 10.6663 14559.14% 116 coq-unimath/UniMath/Algebra/GaussianElimination/Tests.v.html │ │ 1.08 11.4 10.2814 951.43% 531 coq-performance-tests-lite/src/Nia.v.html │ │ 12.3 22.5 10.1378 82.19% 531 coq-performance-tests-lite/src/Nia.v.html │ │ 0.873 10.9 10.0404 1150.40% 596 coq-coqprime/src/Coqprime/elliptic/SMain.v.html │ └──────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────┘ 🐇 Top 25 speed ups┌────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────┐ │ TOP 25 SPEED UPS │ │ │ │ OLD NEW DIFF %DIFF Ln FILE │ ├────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────┤ │ 9.69 2.56 -7.1319 -73.61% 87 coq-engine-bench-lite/coq/PerformanceDemos/quadratic_reduction.v.html │ │ 4.18 3.23 -0.9455 -22.62% 492 rocq-stdlib/theories/Reals/Cauchy/ConstructiveCauchyRealsMult.v.html │ │ 0.942 0.326 -0.6159 -65.38% 73 coq-mathcomp-analysis/theories/exp.v.html │ │ 0.587 0.00160 -0.5856 -99.73% 236 coq-mathcomp-analysis/theories/lebesgue_integral_theory/lebesgue_integral_monotone_convergence.v.html │ │ 0.599 0.0149 -0.5846 -97.52% 111 coq-mathcomp-analysis/theories/hoelder.v.html │ │ 0.601 0.0189 -0.5825 -96.86% 77 coq-mathcomp-analysis/theories/lebesgue_integral_theory/lebesgue_integral_dominated_convergence.v.html │ │ 0.592 0.0205 -0.5718 -96.53% 140 coq-mathcomp-analysis/theories/trigo.v.html │ │ 0.581 0.0115 -0.5698 -98.03% 287 coq-mathcomp-analysis/theories/trigo.v.html │ │ 0.966 0.402 -0.5645 -58.43% 46 coq-mathcomp-analysis/theories/probability_theory/uniform_distribution.v.html │ │ 0.572 0.00877 -0.5629 -98.47% 218 coq-mathcomp-analysis/theories/lebesgue_measure.v.html │ │ 0.570 0.00768 -0.5619 -98.65% 162 coq-mathcomp-analysis/theories/ftc.v.html │ │ 0.565 0.00547 -0.5598 -99.03% 293 coq-mathcomp-analysis/theories/hoelder.v.html │ │ 2.58 2.02 -0.5583 -21.67% 123 coq-mathcomp-analysis/theories/lebesgue_integral_theory/lebesgue_Rintegral.v.html │ │ 0.578 0.0209 -0.5568 -96.39% 121 coq-mathcomp-analysis/theories/lebesgue_integral_theory/lebesgue_integral_differentiation.v.html │ │ 0.560 0.00772 -0.5519 -98.62% 74 coq-mathcomp-analysis/theories/lebesgue_integral_theory/lebesgue_integral_monotone_convergence.v.html │ │ 0.558 0.00669 -0.5512 -98.80% 140 coq-mathcomp-analysis/theories/derive.v.html │ │ 1.72 1.19 -0.5367 -31.17% 2103 coq-fiat-parsers/src/Parsers/BooleanRecognizerOptimized.v.html │ │ 0.535 0.00329 -0.5319 -99.38% 144 coq-mathcomp-analysis/theories/measure_theory/measure_negligible.v.html │ │ 0.884 0.354 -0.5301 -59.99% 100 coq-mathcomp-analysis/theories/lebesgue_integral_theory/lebesgue_integral_differentiation.v.html │ │ 0.631 0.105 -0.5265 -83.39% 186 coq-mathcomp-analysis/theories/lebesgue_integral_theory/measurable_fun_approximation.v.html │ │ 0.581 0.0564 -0.5248 -90.29% 127 coq-mathcomp-analysis/theories/lebesgue_integral_theory/lebesgue_integral_dominated_convergence.v.html │ │ 0.580 0.0572 -0.5225 -90.13% 69 coq-mathcomp-analysis/theories/lebesgue_integral_theory/measurable_fun_approximation.v.html │ │ 0.517 0.00796 -0.5086 -98.46% 78 coq-mathcomp-analysis/theories/ess_sup_inf.v.html │ │ 0.544 0.0372 -0.5066 -93.16% 208 coq-mathcomp-analysis/theories/ereal.v.html │ │ 0.498 0.00611 -0.4915 -98.77% 404 coq-mathcomp-analysis/theories/numfun.v.html │ └────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────┘ |
Contributor
Minimization interrupted by timeout, being automatically continued. Partially Minimized File /home/runner/work/run-coq-bug-minimizer/run-coq-bug-minimizer/builds/coq/coq-failing/_build_ci/corn/reals/fast/CRpi_fast.v in 5h 15m 7s (from ci-corn) (interrupted by timeout, being automatically continued) (full log on GitHub Actions - verbose log)⭐ ⏱️ Partially Minimized Coq File (timeout) (truncated to first and last 32KiB; full 107KiB file on GitHub Actions Artifacts under
|
Contributor
Minimization interrupted by timeout, being automatically continued. Partially Minimized File /home/runner/work/run-coq-bug-minimizer/run-coq-bug-minimizer/builds/coq/coq-failing/_build_ci/corn/reals/fast/CRpi_fast.v in 5h 15m 7s (from ci-corn) (interrupted by timeout, being automatically continued) (full log on GitHub Actions - verbose log)⭐ ⏱️ Partially Minimized Coq File (timeout) (truncated to first and last 32KiB; full 48KiB file on GitHub Actions Artifacts under
|
Contributor
Author
|
Most significant vosize changes (sorted by % then absolute change) |
SkySkimmer
added
request: full CI
SkySkimmer
force-pushed
the
fix-bytecode-off
branch
from
3661dfb to
46272e6
Compare
coqbot-app
bot
removed
the
request: full CI
github-actions
bot
added
the
needs: rebase
SkySkimmer
force-pushed
the
fix-bytecode-off
branch
from
46272e6 to
eb631ed
Compare
coqbot-app
bot
removed
the
needs: rebase
coqbot-app
bot
added
the
needs: full CI
silene
approved these changes
Mar 3, 2026
Contributor
silene
left a comment
silene
left a comment
There was a problem hiding this comment.
The changes seem fine to me, but the motivation eludes me. What does it bring?
Is it a way to avoid generating (and storing) the VM segment in the .vo file? If so, what happens if the user compiles a file with coqc -bytecode-compiler no and then requires it with coqc -bytecode-compiler yes? Does it crash?
Contributor
Author
That and also fixing that we ignore the configure time flag.
Definitions from the bytecode=no file are treated as axioms by the VM. |
Contributor
I might even go for an error, so as to avoid having a large discrepancy between a term reduced by |
SkySkimmer
added
the
needs: progress
SkySkimmer
force-pushed
the
fix-bytecode-off
branch
from
eb631ed to
48ad214
Compare
Contributor
Author
|
Moved lazy change to separate PR #21735 |
The code also puts "BCuncompiled" for symbols and primitives, but symbols can only be declared when rewrite rules are on so VM is disabled and cannot be reenabled, and the const_body_code for primitives is not accessed as genlambda produces Lprim instead of Lconst.
SkySkimmer
added
request: full CI
coqbot-app
bot
removed
request: full CI
Contributor
Author
Added error |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
No description provided.