Average Error: 0.0 → 0.0
Time: 10.5s
Precision: 64
\[5 \le a \le 10 \land 0 \le b \le 0.001\]
\[\left(a + b\right) \cdot \left(a + b\right)\]
↓
\[\mathsf{fma}\left(\left(\mathsf{fma}\left(2, a, b\right)\right), b, \left(a \cdot a\right)\right)\]
\left(a + b\right) \cdot \left(a + b\right)
↓
\mathsf{fma}\left(\left(\mathsf{fma}\left(2, a, b\right)\right), b, \left(a \cdot a\right)\right)
double f(double a, double b) {
        double r6430176 = a;
        double r6430177 = b;
        double r6430178 = r6430176 + r6430177;
        double r6430179 = r6430178 * r6430178;
        return r6430179;
}
↓
double f(double a, double b) {
        double r6430180 = 2.0;
        double r6430181 = a;
        double r6430182 = b;
        double r6430183 = fma(r6430180, r6430181, r6430182);
        double r6430184 = r6430181 * r6430181;
        double r6430185 = fma(r6430183, r6430182, r6430184);
        return r6430185;
}

Error

Bits error versus a

Bits error versus b

Target

Original0.0
Target0.0
Herbie0.0
\[\left(\left(b \cdot a + b \cdot b\right) + b \cdot a\right) + a \cdot a\]

Derivation

  1. Initial program 0.0

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

  2. Taylor expanded around inf 0.0

    \[\leadsto \color{blue}{{a}^{2} + \left({b}^{2} + 2 \cdot \left(a \cdot b\right)\right)}\]

  3. Simplified0.0

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

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2019121 +o rules:numerics
(FPCore (a b)
  :name "Expression 4, p15"
  :pre (and (<= 5 a 10) (<= 0 b 0.001))

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

  (* (+ a b) (+ a b)))