Average Error: 0.0 → 0.0
Time: 2.5s
Precision: binary64
Cost: 6976
\[ \begin{array}{c}[x, y] = \mathsf{sort}([x, y])\\ \end{array} \]
\[\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y \]
↓
\[\mathsf{fma}\left(y, y, x \cdot \left(x + y \cdot 2\right)\right) \]
(FPCore (x y) :precision binary64 (+ (+ (* x x) (* (* x 2.0) y)) (* y y)))
↓
(FPCore (x y) :precision binary64 (fma y y (* x (+ x (* y 2.0)))))
double code(double x, double y) {
	return ((x * x) + ((x * 2.0) * y)) + (y * y);
}
↓
double code(double x, double y) {
	return fma(y, y, (x * (x + (y * 2.0))));
}

function code(x, y)
	return Float64(Float64(Float64(x * x) + Float64(Float64(x * 2.0) * y)) + Float64(y * y))
end
↓
function code(x, y)
	return fma(y, y, Float64(x * Float64(x + Float64(y * 2.0))))
end

code[x_, y_] := N[(N[(N[(x * x), $MachinePrecision] + N[(N[(x * 2.0), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision]
↓
code[x_, y_] := N[(y * y + N[(x * N[(x + N[(y * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y
↓
\mathsf{fma}\left(y, y, x \cdot \left(x + y \cdot 2\right)\right)

Error

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(y, y, x \cdot \left(x + 2 \cdot y\right)\right)} \]
    Proof
    (fma.f64 y y (*.f64 x (+.f64 x (*.f64 2 y)))): 0 points increase in error, 0 points decrease in error
    (fma.f64 y y (Rewrite<= distribute-lft-out_binary64 (+.f64 (*.f64 x x) (*.f64 x (*.f64 2 y))))): 1 points increase in error, 1 points decrease in error
    (fma.f64 y y (+.f64 (*.f64 x x) (Rewrite<= associate-*l*_binary64 (*.f64 (*.f64 x 2) y)))): 0 points increase in error, 0 points decrease in error
    (Rewrite<= fma-def_binary64 (+.f64 (*.f64 y y) (+.f64 (*.f64 x x) (*.f64 (*.f64 x 2) y)))): 2 points increase in error, 0 points decrease in error
    (Rewrite<= +-commutative_binary64 (+.f64 (+.f64 (*.f64 x x) (*.f64 (*.f64 x 2) y)) (*.f64 y y))): 0 points increase in error, 0 points decrease in error

  3. Final simplification0.0

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

Alternatives

Alternative 1
Error0.0
Cost704
\[x \cdot \left(x + y \cdot 2\right) + y \cdot y \]
Alternative 2
Error7.5
Cost580
\[\begin{array}{l} \mathbf{if}\;x \leq -5 \cdot 10^{-145}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(y + x \cdot 2\right)\\ \end{array} \]
Alternative 3
Error1.4
Cost448
\[y \cdot y + x \cdot x \]
Alternative 4
Error7.7
Cost324
\[\begin{array}{l} \mathbf{if}\;x \leq -5 \cdot 10^{-145}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot y\\ \end{array} \]
Alternative 5
Error28.4
Cost192
\[x \cdot x \]

Error

Reproduce

herbie shell --seed 2022329 
(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)))