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

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

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

  3. Applied associate--l+0.0

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

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2020150 
(FPCore (x y)
  :name "Data.Colour.RGBSpace.HSL:hsl from colour-2.3.3, A"
  :precision binary64
  (- (+ x y) (* x y)))