Average Error: 0.0 → 0.0
Time: 1.1s
Precision: binary64
\[\left(x \cdot y + y\right) - x \cdot z\]
↓
\[\left(x \cdot y + y\right) - x \cdot z\]
\left(x \cdot y + y\right) - x \cdot z
↓
\left(x \cdot y + y\right) - x \cdot z
double code(double x, double y, double z) {
	return ((double) (((double) (((double) (x * y)) + y)) - ((double) (x * z))));
}
↓
double code(double x, double y, double z) {
	return ((double) (((double) (((double) (x * y)) + y)) - ((double) (x * 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

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

  2. Final simplification0.0

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

Reproduce

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