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

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

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

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

Error

Derivation

  1. Initial program 0.0

    \[\left(x + y\right) \cdot \left(z + 1\right) \]

  2. Applied egg-rr0.0

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

  3. Final simplification0.0

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

Reproduce

herbie shell --seed 2022210 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  :precision binary64
  (* (+ x y) (+ z 1.0)))