Average Error: 0.0 → 0.0
Time: 1.0s
Precision: binary64
\[x \cdot y + x \cdot z\]
↓
\[x \cdot \left(y + z\right)\]
x \cdot y + x \cdot z
↓
x \cdot \left(y + z\right)
double code(double x, double y, double z) {
	return ((double) (((double) (x * y)) + ((double) (x * z))));
}
↓
double code(double x, double y, double z) {
	return ((double) (x * ((double) (y + z))));
}

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

    \[x \cdot y + x \cdot z\]

  2. Simplified0.0

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

  3. Final simplification0.0

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

Reproduce

herbie shell --seed 2020153 
(FPCore (x y z)
  :name "(+ (* x y) (* x z))"
  :precision binary64
  (+ (* x y) (* x z)))