Average Error: 0.0 → 0.0
Time: 11.7s
Precision: 64
\[500 \cdot \left(x - y\right)\]
↓
\[500 \cdot x + 500 \cdot \left(-y\right)\]
500 \cdot \left(x - y\right)
↓
500 \cdot x + 500 \cdot \left(-y\right)
double f(double x, double y) {
        double r156433 = 500.0;
        double r156434 = x;
        double r156435 = y;
        double r156436 = r156434 - r156435;
        double r156437 = r156433 * r156436;
        return r156437;
}
↓
double f(double x, double y) {
        double r156438 = 500.0;
        double r156439 = x;
        double r156440 = r156438 * r156439;
        double r156441 = y;
        double r156442 = -r156441;
        double r156443 = r156438 * r156442;
        double r156444 = r156440 + r156443;
        return r156444;
}

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

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

  3. Applied sub-neg0.0

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

  4. Applied distribute-lft-in0.0

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

  5. Final simplification0.0

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

Reproduce

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