Average Error: 0.0 → 0.0
Time: 643.0ms
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 r301769 = 500.0;
        double r301770 = x;
        double r301771 = y;
        double r301772 = r301770 - r301771;
        double r301773 = r301769 * r301772;
        return r301773;
}
↓
double f(double x, double y) {
        double r301774 = 500.0;
        double r301775 = x;
        double r301776 = r301774 * r301775;
        double r301777 = y;
        double r301778 = -r301777;
        double r301779 = r301774 * r301778;
        double r301780 = r301776 + r301779;
        return r301780;
}

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