Average Error: 0.0 → 0.0
Time: 10.6s
Precision: 64
\[56789 \le a \le 98765 \land 0 \le b \le 1 \land 0 \le c \le 0.0016773 \land 0 \le d \le 0.0016773\]
\[a \cdot \left(\left(b + c\right) + d\right)\]
↓
\[\mathsf{fma}\left(c + b, a, a \cdot d\right)\]
a \cdot \left(\left(b + c\right) + d\right)
↓
\mathsf{fma}\left(c + b, a, a \cdot d\right)
double f(double a, double b, double c, double d) {
        double r2608889 = a;
        double r2608890 = b;
        double r2608891 = c;
        double r2608892 = r2608890 + r2608891;
        double r2608893 = d;
        double r2608894 = r2608892 + r2608893;
        double r2608895 = r2608889 * r2608894;
        return r2608895;
}
↓
double f(double a, double b, double c, double d) {
        double r2608896 = c;
        double r2608897 = b;
        double r2608898 = r2608896 + r2608897;
        double r2608899 = a;
        double r2608900 = d;
        double r2608901 = r2608899 * r2608900;
        double r2608902 = fma(r2608898, r2608899, r2608901);
        return r2608902;
}

Error

Bits error versus a

Bits error versus b

Bits error versus c

Bits error versus d

Target

Original0.0
Target0.0
Herbie0.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-rgt-in0.0

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

  5. Applied fma-def0.0

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

  6. Final simplification0.0

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

Reproduce

herbie shell --seed 2019139 +o rules:numerics
(FPCore (a b c d)
  :name "Expression, p14"
  :pre (and (<= 56789 a 98765) (<= 0 b 1) (<= 0 c 0.0016773) (<= 0 d 0.0016773))

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

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