Average Error: 0.0 → 0.0
Time: 1.4s
Precision: binary64
\[[x, y] = \mathsf{sort}([x, y]) \\]
\[\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y \]
↓
\[\mathsf{fma}\left(x, \mathsf{fma}\left(2, y, x\right), y \cdot y\right) \]
\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y
↓
\mathsf{fma}\left(x, \mathsf{fma}\left(2, y, x\right), y \cdot y\right)

(FPCore (x y) :precision binary64 (+ (+ (* x x) (* (* x 2.0) y)) (* y y)))
↓
(FPCore (x y) :precision binary64 (fma x (fma 2.0 y x) (* y y)))
double code(double x, double y) {
	return ((x * x) + ((x * 2.0) * y)) + (y * y);
}
↓
double code(double x, double y) {
	return fma(x, fma(2.0, y, x), (y * y));
}

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. Simplified0.0

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

  3. Final simplification0.0

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

Reproduce

herbie shell --seed 2022121 
(FPCore (x y)
  :name "Examples.Basics.ProofTests:f4 from sbv-4.4"
  :precision binary64

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

  (+ (+ (* x x) (* (* x 2.0) y)) (* y y)))