library colibrilib.qa — module ModEThe Euclidean remainder Real.mod_e (the remainder is in [0, |b|))
module ModE6use int.Int7use real.RealInfix8use real.FromInt9use real.Abs10use real.Truncate11use colibrilib.dv.RealFacts12use colibrilib.q.Real13Valid (148ms) (colibri2 12) (cvc5 2) (split_vc) (depth 1)14let ghost mod_e_facts (a b:real) : unit15requires { b <> 0.0 }16ensures { 0.0 <=. mod_e a b /\ mod_e a b <. abs b }17ensures { mod_e a b = a -. from_int (div_e a b) *. b }18= {proof…} let d = a /. b in19assert { a = d *. b };20if b >. 0.0 then begin21let fl = from_int (Truncate.floor d) in22assert { fl <=. d <. fl +. 1.0 };23assert { mod_e a b = b *. (d -. fl) };24mul_nonneg b (d -. fl);25mul_pos b (1.0 -. (d -. fl));26assert { abs b = b }27end else begin28let c = from_int (Truncate.ceil d) in29assert { c -. 1.0 <. d <=. c };30assert { mod_e a b = (-. b) *. (c -. d) };31mul_nonneg (-. b) (c -. d);32mul_pos (-. b) (1.0 -. (c -. d));33assert { abs b = -. b }34end {qed}35end36