Average Error: 0.0 → 0.0
Time: 1.1s
Precision: 64
\[5 \le a \le 10 \land 0.0 \le b \le 10^{-3}\]
\[\left(a + b\right) \cdot \left(a + b\right)\]
↓
\[\mathsf{fma}\left(a, a + b, b \cdot \left(a + b\right)\right)\]
\left(a + b\right) \cdot \left(a + b\right)
↓
\mathsf{fma}\left(a, a + b, b \cdot \left(a + b\right)\right)
double f(double a, double b) {
        double r110555 = a;
        double r110556 = b;
        double r110557 = r110555 + r110556;
        double r110558 = r110557 * r110557;
        return r110558;
}
↓
double f(double a, double b) {
        double r110559 = a;
        double r110560 = b;
        double r110561 = r110559 + r110560;
        double r110562 = r110560 * r110561;
        double r110563 = fma(r110559, r110561, r110562);
        return r110563;
}

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. Using strategy rm

  3. Applied distribute-lft-in0.0

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

  4. Simplified0.0

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

  5. Simplified0.0

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

  7. Applied fma-def0.0

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

  8. Final simplification0.0

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

Reproduce

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

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

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