Average Error: 0.0 → 0.0
Time: 1.8s
Precision: binary64
\[\left(x + y\right) \cdot \left(z + 1\right) \]
\[y + \mathsf{fma}\left(z \cdot \left(y + x\right), 1, x\right) \]
(FPCore (x y z) :precision binary64 (* (+ x y) (+ z 1.0)))
(FPCore (x y z) :precision binary64 (+ y (fma (* z (+ y x)) 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 y + fma((z * (y + x)), 1.0, x);
}
function code(x, y, z)
	return Float64(Float64(x + y) * Float64(z + 1.0))
end
function code(x, y, z)
	return Float64(y + fma(Float64(z * Float64(y + x)), 1.0, x))
end
code[x_, y_, z_] := N[(N[(x + y), $MachinePrecision] * N[(z + 1.0), $MachinePrecision]), $MachinePrecision]
code[x_, y_, z_] := N[(y + N[(N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision] * 1.0 + x), $MachinePrecision]), $MachinePrecision]
\left(x + y\right) \cdot \left(z + 1\right)
y + \mathsf{fma}\left(z \cdot \left(y + x\right), 1, x\right)

Error

Bits error versus x

Bits error versus y

Bits error versus z

Derivation

  1. Initial program 0.0

    \[\left(x + y\right) \cdot \left(z + 1\right) \]
  2. Taylor expanded in x around 0 0.0

    \[\leadsto \color{blue}{y + \left(y \cdot z + \left(z \cdot x + x\right)\right)} \]
  3. Applied egg-rr0.0

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

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

Reproduce

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