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

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

  3. Applied sub-neg0.0

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

  4. Applied distribute-lft-in0.0

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

  5. Final simplification0.0

    \[\leadsto 200 \cdot x - 200 \cdot y\]

Reproduce

herbie shell --seed 2020198 
(FPCore (x y)
  :name "Data.Colour.CIE:cieLABView from colour-2.3.3, C"
  :precision binary64
  (* 200.0 (- x y)))