Expression, p14

Average Error: 0.0 → 0.0

Time: 5.8s

Precision: 64

\[56789 \le a \le 98765 \land 0.0 \le b \le 1 \land 0.0 \le c \le 0.001677300000000000058247850986958837893326 \land 0.0 \le d \le 0.001677300000000000058247850986958837893326\]

Math

\[a \cdot \left(\left(b + c\right) + d\right)\]

↓

\[\mathsf{fma}\left(a, b + c, a \cdot d\right)\]

C

double f(double a, double b, double c, double d) {
        double r76927 = a;
        double r76928 = b;
        double r76929 = c;
        double r76930 = r76928 + r76929;
        double r76931 = d;
        double r76932 = r76930 + r76931;
        double r76933 = r76927 * r76932;
        return r76933;
}

↓

double f(double a, double b, double c, double d) {
        double r76934 = a;
        double r76935 = b;
        double r76936 = c;
        double r76937 = r76935 + r76936;
        double r76938 = d;
        double r76939 = r76934 * r76938;
        double r76940 = fma(r76934, r76937, r76939);
        return r76940;
}

Error

Bits error versus a

Bits error versus b

Bits error versus c

Bits error versus d

Target

Original	0.0
Target	0.0
Herbie	0.0

\[a \cdot b + a \cdot \left(c + d\right)\]

Derivation

1. Initial program 0.0

   \[a \cdot \left(\left(b + c\right) + d\right)\]
2. Using strategy rm

3. Applied distribute-lft-in 0.0

   \[\leadsto \color{blue}{a \cdot \left(b + c\right) + a \cdot d}\]
4. Using strategy rm

5. Applied fma-def 0.0

   \[\leadsto \color{blue}{\mathsf{fma}\left(a, b + c, a \cdot d\right)}\]

6. Final simplification 0.0

   \[\leadsto \mathsf{fma}\left(a, b + c, a \cdot d\right)\]

Reproduce

herbie shell --seed 2019235 +o rules:numerics
(FPCore (a b c d)
  :name "Expression, p14"
  :precision binary64
  :pre (and (<= 56789 a 98765) (<= 0.0 b 1) (<= 0.0 c 0.0016773000000000001) (<= 0.0 d 0.0016773000000000001))

  :herbie-target
  (+ (* a b) (* a (+ c d)))

  (* a (+ (+ b c) d)))