\[\left(x \cdot 2 + x \cdot x\right) + y \cdot y \]

↓

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

(FPCore (x y) :precision binary64 (+ (+ (* x 2.0) (* x x)) (* y y)))

↓

(FPCore (x y) :precision binary64 (fma y y (* x (+ x 2.0))))

double code(double x, double y) {
	return ((x * 2.0) + (x * x)) + (y * y);
}

↓

double code(double x, double y) {
	return fma(y, y, (x * (x + 2.0)));
}

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

↓

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

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

↓

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

\left(x \cdot 2 + x \cdot x\right) + y \cdot y

↓

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

Original	0.0
Target	0.0
Herbie	0.0

Derivation

Initial program 0.0
\[\left(x \cdot 2 + x \cdot x\right) + y \cdot y \]
Simplified0.0
\[\leadsto \color{blue}{x \cdot \left(2 + x\right) + y \cdot y} \]
Proof
(+.f64 (*.f64 x (+.f64 2 x)) (*.f64 y y)): 0 points increase in error, 0 points decrease in error
(+.f64 (Rewrite<= distribute-lft-out_binary64 (+.f64 (*.f64 x 2) (*.f64 x x))) (*.f64 y y)): 0 points increase in error, 1 points decrease in error
Applied egg-rr0.0
\[\leadsto \color{blue}{\mathsf{fma}\left(y, y, x \cdot \left(x + 2\right)\right)} \]
Final simplification0.0
\[\leadsto \mathsf{fma}\left(y, y, x \cdot \left(x + 2\right)\right) \]

Alternatives

Alternative 1
Error	24.3
Cost	1116

\[\begin{array}{l} \mathbf{if}\;x \leq -3100000000000:\\ \;\;\;\;x \cdot x\\ \mathbf{elif}\;x \leq -1.18 \cdot 10^{-143}:\\ \;\;\;\;y \cdot y\\ \mathbf{elif}\;x \leq -1.18 \cdot 10^{-200}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;x \leq 8.2 \cdot 10^{-276}:\\ \;\;\;\;y \cdot y\\ \mathbf{elif}\;x \leq 1.35 \cdot 10^{-232}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;x \leq 2.2 \cdot 10^{-103}:\\ \;\;\;\;y \cdot y\\ \mathbf{elif}\;x \leq 2:\\ \;\;\;\;x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \]

Alternative 2
Error	11.0
Cost	712

\[\begin{array}{l} \mathbf{if}\;y \leq -4.4 \cdot 10^{-100}:\\ \;\;\;\;y \cdot y\\ \mathbf{elif}\;y \leq 5.8 \cdot 10^{-60}:\\ \;\;\;\;x \cdot x + x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;y \cdot y\\ \end{array} \]

Alternative 3
Error	3.9
Cost	712

\[\begin{array}{l} t_0 := x \cdot x + y \cdot y\\ \mathbf{if}\;y \leq -4.2 \cdot 10^{-100}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;y \leq 1.6 \cdot 10^{-77}:\\ \;\;\;\;x \cdot x + x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 4
Error	1.2
Cost	712

\[\begin{array}{l} t_0 := x \cdot x + y \cdot y\\ \mathbf{if}\;x \leq -3.6:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \leq 2:\\ \;\;\;\;y \cdot y + \left(x + x\right)\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 5
Error	0.0
Cost	704

\[y \cdot y + \left(x \cdot x + x \cdot 2\right) \]

Alternative 6
Error	11.0
Cost	584

\[\begin{array}{l} \mathbf{if}\;y \leq -4.4 \cdot 10^{-100}:\\ \;\;\;\;y \cdot y\\ \mathbf{elif}\;y \leq 5.8 \cdot 10^{-60}:\\ \;\;\;\;x \cdot \left(x + 2\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot y\\ \end{array} \]

Alternative 7
Error	0.0
Cost	576

\[y \cdot y + x \cdot \left(x + 2\right) \]

Alternative 8
Error	25.6
Cost	456

\[\begin{array}{l} \mathbf{if}\;x \leq -3.1 \cdot 10^{-11}:\\ \;\;\;\;x \cdot x\\ \mathbf{elif}\;x \leq 2:\\ \;\;\;\;x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \]

Alternative 9
Error	41.9
Cost	192

\[x \cdot 2 \]

Reproduce

herbie shell --seed 2022331 
(FPCore (x y)
  :name "Numeric.Log:$clog1p from log-domain-0.10.2.1, A"
  :precision binary64

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

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

Error

Target

Derivation

Alternatives

Error

Reproduce