Average Error: 0.0 → 0.0
Time: 1.8s
Precision: binary64
\[[x, y] = \mathsf{sort}([x, y]) \\]
\[\left(x + y\right) \cdot \left(z + 1\right) \]
\[\mathsf{fma}\left(y, z + 1, \left(z + 1\right) \cdot x\right) \]
\left(x + y\right) \cdot \left(z + 1\right)
\mathsf{fma}\left(y, z + 1, \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 y (+ z 1.0) (* (+ 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(y, (z + 1.0), ((z + 1.0) * x));
}

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. Applied egg-rr0.0

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

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

Reproduce

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