Common — library colibrilib.product — module Gen
1
module Gen
2
3
use real.RealInfix
4
use real.Abs
5
use real.FromInt
6
use real.Truncate
7
8
function
sign
(x:real) : real =
9
if (x <. 0.) then -1. else if (x >. 0.) then 1. else 0.
10
Valid (21ms) (colibri2)
11
lemma
sign_zero
: forall x. sign x = 0. <-> x = 0.
12
Valid (35ms) (colibri2)
13
lemma
sign_mult
: forall x y. sign (x *. y) = sign x *. sign y
14
Valid (20ms) (colibri2)
15
lemma
abs_zero
: forall x. abs x = 0. <-> x = 0.
16
Valid (18ms) (colibri2)
17
lemma
abs_mult
: forall x y. abs (x *. y) = abs x *. abs y
18
Valid (22ms) (colibri2)
19
lemma
abs_sign_id
: forall x. sign x *. abs x = x
20
Valid (20ms) (colibri2)
21
lemma
abs_sign
: forall x. x <> 0. -> abs (sign x) = 1. Valid (22ms) (colibri2)
22
lemma
sign_abs
: forall x. x <> 0. -> sign (abs x) = 1. Valid (28ms) (colibri2)
23
lemma
sign_sign
: forall x. sign (sign x) = sign x Valid (21ms) (colibri2)
24
lemma
abs_abs
: forall x. abs (abs x) = abs x
25
26
function
smart_abs_sign
(s a:real) : real =
27
if s = 1. then abs a else
28
if s = -1. then -. (abs a) else
29
if s = a then s else sign s *. abs a
30
Valid (30ms) (colibri2)
31
lemma
smart_abs_sign
: forall s a. smart_abs_sign s a = sign s *. abs a
32
Valid (1.2s) (colibri2) (cvc4) (cvc5 2) (split_vc 2) (depth 2)
33
let ghost
sign_abs_factor
(x y sx sy ax ay s a:real)
34
requires { sign x = sign sx *. sign s }
35
requires { sign y = sign sy *. sign s }
36
requires { abs x = abs ax *. abs a }
37
requires { abs y = abs ay *. abs a }
38
ensures {
39
let x3 = sign sx *. abs ax in
40
let y3 = sign sy *. abs ay in
41
sign (x +. y) = sign (x3 +. y3) *. sign s /\
42
abs (x +. y) = abs (x3 +. y3) *. abs a }
43
=
44
assert { x = sign sx *. abs ax *. sign s *. abs a };
45
assert { y = sign sy *. abs ay *. sign s *. abs a };
46
()
47
Valid (841ms) (colibri2) (cvc4) (cvc5) (split_vc) (depth 1)
48
let ghost
sign_abs_factor_coef
(x y sx sy ax ay s a coef:real)
49
requires { sign x = sign sx *. sign s }
50
requires { sign y = sign sy *. sign s }
51
requires { abs x = abs ax *. abs a }
52
requires { abs y = abs ay *. abs a }
53
ensures {
54
let x3 = sign sx *. abs ax in
55
let y3 = sign sy *. abs ay in
56
sign (x +. coef*.y) = sign (x3 +. coef*.y3) *. sign s /\
57
abs (x +. coef*.y) = abs (x3 +. coef*.y3) *. abs a }
58
=
59
assert { x = sign sx *. abs ax *. sign s *. abs a };
60
assert { y = sign sy *. abs ay *. sign s *. abs a };
61
()
62
63
function
sign_even
(x:real) : real =
64
if (x = 0.) then 0. else 1.
65
66
function
sign_non_zero
(x:real) : real =
67
if (x <. 0.) then -1. else 1.
68
Valid (23ms) (colibri2)
69
lemma
sign_odd_odd
: forall x. sign x *. sign x = sign_even x
70
Valid (20ms) (colibri2)
71
lemma
sign_odd_even
: forall x. sign x *. sign_even x = sign x
72
Valid (31ms) (colibri2)
73
lemma
sign_non_zero
: forall x. x <> 0. -> sign x = sign_non_zero x
74
Valid (26ms) (colibri2)
75
lemma
sign_even_non_zero
: forall x. x <> 0. -> sign_even x = 1.
76
Valid (21ms) (colibri2)
77
lemma
sign_nz_nz
: forall x. sign_non_zero x *. sign_non_zero x = 1.
78
79
end