Average Error: 0.0 → 0.0
Time: 1.3s
Precision: 64
\[\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y\]
\[\mathsf{fma}\left(x, x, \left(x \cdot 2\right) \cdot y\right) + y \cdot y\]
\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y
\mathsf{fma}\left(x, x, \left(x \cdot 2\right) \cdot y\right) + y \cdot y
double f(double x, double y) {
        double r665334 = x;
        double r665335 = r665334 * r665334;
        double r665336 = 2.0;
        double r665337 = r665334 * r665336;
        double r665338 = y;
        double r665339 = r665337 * r665338;
        double r665340 = r665335 + r665339;
        double r665341 = r665338 * r665338;
        double r665342 = r665340 + r665341;
        return r665342;
}

double f(double x, double y) {
        double r665343 = x;
        double r665344 = 2.0;
        double r665345 = r665343 * r665344;
        double r665346 = y;
        double r665347 = r665345 * r665346;
        double r665348 = fma(r665343, r665343, r665347);
        double r665349 = r665346 * r665346;
        double r665350 = r665348 + r665349;
        return r665350;
}

Error

Bits error versus x

Bits error versus y

Target

Original0.0
Target0.0
Herbie0.0
\[x \cdot x + \left(y \cdot y + \left(x \cdot y\right) \cdot 2\right)\]

Derivation

  1. Initial program 0.0

    \[\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y\]
  2. Using strategy rm
  3. Applied fma-def0.0

    \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, \left(x \cdot 2\right) \cdot y\right)} + y \cdot y\]
  4. Final simplification0.0

    \[\leadsto \mathsf{fma}\left(x, x, \left(x \cdot 2\right) \cdot y\right) + y \cdot y\]

Reproduce

herbie shell --seed 2020064 +o rules:numerics
(FPCore (x y)
  :name "Examples.Basics.ProofTests:f4 from sbv-4.4"
  :precision binary64

  :herbie-target
  (+ (* x x) (+ (* y y) (* (* x y) 2)))

  (+ (+ (* x x) (* (* x 2) y)) (* y y)))