module Gen
use real.RealInfix
use real.Abs
use real.FromInt
use real.Truncate
function sign (x:real) : real =
if (x <. 0.) then -1. else if (x >. 0.) then 1. else 0.
Valid (21ms) (colibri2)
lemma sign_zero: forall x. sign x = 0. <-> x = 0.
Valid (35ms) (colibri2)
lemma sign_mult: forall x y. sign (x *. y) = sign x *. sign y
Valid (20ms) (colibri2)
lemma abs_zero: forall x. abs x = 0. <-> x = 0.
Valid (18ms) (colibri2)
lemma abs_mult: forall x y. abs (x *. y) = abs x *. abs y
Valid (22ms) (colibri2)
lemma abs_sign_id: forall x. sign x *. abs x = x
Valid (20ms) (colibri2)
lemma abs_sign: forall x. x <> 0. -> abs (sign x) = 1.
Valid (22ms) (colibri2)
lemma sign_abs: forall x. x <> 0. -> sign (abs x) = 1.
Valid (28ms) (colibri2)
lemma sign_sign: forall x. sign (sign x) = sign x
Valid (21ms) (colibri2)
lemma abs_abs: forall x. abs (abs x) = abs x
function smart_abs_sign (s a:real) : real =
if s = 1. then abs a else
if s = -1. then -. (abs a) else
if s = a then s else sign s *. abs a
Valid (30ms) (colibri2)
lemma smart_abs_sign: forall s a. smart_abs_sign s a = sign s *. abs a
Valid (1.2s) (colibri2) (cvc4) (cvc5 2) (split_vc 2) (depth 2)
let ghost sign_abs_factor (x y sx sy ax ay s a:real)
requires { sign x = sign sx *. sign s }
requires { sign y = sign sy *. sign s }
requires { abs x = abs ax *. abs a }
requires { abs y = abs ay *. abs a }
ensures {
let x3 = sign sx *. abs ax in
let y3 = sign sy *. abs ay in
sign (x +. y) = sign (x3 +. y3) *. sign s /\
abs (x +. y) = abs (x3 +. y3) *. abs a }
=
assert { x = sign sx *. abs ax *. sign s *. abs a };
assert { y = sign sy *. abs ay *. sign s *. abs a };
()
Valid (841ms) (colibri2) (cvc4) (cvc5) (split_vc) (depth 1)
let ghost sign_abs_factor_coef (x y sx sy ax ay s a coef:real)
requires { sign x = sign sx *. sign s }
requires { sign y = sign sy *. sign s }
requires { abs x = abs ax *. abs a }
requires { abs y = abs ay *. abs a }
ensures {
let x3 = sign sx *. abs ax in
let y3 = sign sy *. abs ay in
sign (x +. coef*.y) = sign (x3 +. coef*.y3) *. sign s /\
abs (x +. coef*.y) = abs (x3 +. coef*.y3) *. abs a }
=
assert { x = sign sx *. abs ax *. sign s *. abs a };
assert { y = sign sy *. abs ay *. sign s *. abs a };
()
function sign_even (x:real) : real =
if (x = 0.) then 0. else 1.
function sign_non_zero (x:real) : real =
if (x <. 0.) then -1. else 1.
Valid (23ms) (colibri2)
lemma sign_odd_odd: forall x. sign x *. sign x = sign_even x
Valid (20ms) (colibri2)
lemma sign_odd_even: forall x. sign x *. sign_even x = sign x
Valid (31ms) (colibri2)
lemma sign_non_zero: forall x. x <> 0. -> sign x = sign_non_zero x
Valid (26ms) (colibri2)
lemma sign_even_non_zero: forall x. x <> 0. -> sign_even x = 1.
Valid (21ms) (colibri2)
lemma sign_nz_nz: forall x. sign_non_zero x *. sign_non_zero x = 1.
end