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

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(x + y\right) \cdot \left(z + 1\right)\]
  2. Using strategy rm

  3. Applied distribute-lft-in0.0

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

  4. Simplified0.0

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

  5. Simplified0.0

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

  7. Applied fma-def0.0

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

  8. Final simplification0.0

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

Reproduce

herbie shell --seed 2020102 +o rules:numerics
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  :precision binary64
  (* (+ x y) (+ z 1)))