Average Error: 0.0 → 0.0
Time: 1.1s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[z \cdot x + \left(y \cdot z + 1 \cdot \left(x + y\right)\right)\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
z \cdot x + \left(y \cdot z + 1 \cdot \left(x + 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 ((z * x) + ((y * z) + (1.0 * (x + 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}{1 \cdot \left(x + y\right)}\]
  6. Using strategy rm

  7. Applied distribute-lft-in0.0

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

  8. Applied associate-+l+0.0

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

  9. Simplified0.0

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

  10. Final simplification0.0

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

Reproduce

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