Average Error: 0.0 → 0.0
Time: 20.8s
Precision: 64
\[5 \le a \le 10 \land 0 \le b \le 0.001\]
\[\left(a + b\right) \cdot \left(a + b\right)\]
↓
\[(\left((2 \cdot a + b)_*\right) \cdot b + \left(a \cdot a\right))_*\]
\left(a + b\right) \cdot \left(a + b\right)
↓
(\left((2 \cdot a + b)_*\right) \cdot b + \left(a \cdot a\right))_*
double f(double a, double b) {
        double r26595585 = a;
        double r26595586 = b;
        double r26595587 = r26595585 + r26595586;
        double r26595588 = r26595587 * r26595587;
        return r26595588;
}
↓
double f(double a, double b) {
        double r26595589 = 2.0;
        double r26595590 = a;
        double r26595591 = b;
        double r26595592 = fma(r26595589, r26595590, r26595591);
        double r26595593 = r26595590 * r26595590;
        double r26595594 = fma(r26595592, r26595591, r26595593);
        return r26595594;
}

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}{(\left((2 \cdot a + b)_*\right) \cdot b + \left(a \cdot a\right))_*}\]

  4. Final simplification0.0

    \[\leadsto (\left((2 \cdot a + b)_*\right) \cdot b + \left(a \cdot a\right))_*\]

Reproduce

herbie shell --seed 2019112 +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)))