Average Error: 0.0 → 0.0
Time: 630.0ms
Precision: binary64
\[\left(1 - x\right) - y\]
↓
\[1 - \left(y + x\right)\]
\left(1 - x\right) - y
↓
1 - \left(y + x\right)
double code(double x, double y) {
	return ((double) (((double) (1.0 - x)) - y));
}
↓
double code(double x, double y) {
	return ((double) (1.0 - ((double) (y + x))));
}

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(1 - x\right) - y\]
  2. Using strategy rm

  3. Applied associate--l-0.0

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

  4. Simplified0.0

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

  5. Final simplification0.0

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

Reproduce

herbie shell --seed 2020162 
(FPCore (x y)
  :name "Data.Colour.CIE.Chromaticity:chromaCoords from colour-2.3.3"
  :precision binary64
  (- (- 1.0 x) y))