Average Error: 0.0 → 0.0
Time: 1.8s
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 r304343 = 500.0;
        double r304344 = x;
        double r304345 = y;
        double r304346 = r304344 - r304345;
        double r304347 = r304343 * r304346;
        return r304347;
}
↓
double f(double x, double y) {
        double r304348 = 500.0;
        double r304349 = x;
        double r304350 = r304348 * r304349;
        double r304351 = y;
        double r304352 = -r304351;
        double r304353 = r304348 * r304352;
        double r304354 = r304350 + r304353;
        return r304354;
}

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 2020062 
(FPCore (x y)
  :name "Data.Colour.CIE:cieLABView from colour-2.3.3, B"
  :precision binary64
  (* 500 (- x y)))