Average Error: 0.0 → 0.0
Time: 2.4s
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 r251693 = 500.0;
        double r251694 = x;
        double r251695 = y;
        double r251696 = r251694 - r251695;
        double r251697 = r251693 * r251696;
        return r251697;
}
↓
double f(double x, double y) {
        double r251698 = 500.0;
        double r251699 = x;
        double r251700 = r251698 * r251699;
        double r251701 = y;
        double r251702 = -r251701;
        double r251703 = r251698 * r251702;
        double r251704 = r251700 + r251703;
        return r251704;
}

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