Average Error: 0.0 → 0.0
Time: 1.5s
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 r200551 = 500.0;
        double r200552 = x;
        double r200553 = y;
        double r200554 = r200552 - r200553;
        double r200555 = r200551 * r200554;
        return r200555;
}
↓
double f(double x, double y) {
        double r200556 = 500.0;
        double r200557 = x;
        double r200558 = r200556 * r200557;
        double r200559 = y;
        double r200560 = -r200559;
        double r200561 = r200556 * r200560;
        double r200562 = r200558 + r200561;
        return r200562;
}

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