Average Error: 0.0 → 0.0
Time: 696.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 r216800 = 500.0;
        double r216801 = x;
        double r216802 = y;
        double r216803 = r216801 - r216802;
        double r216804 = r216800 * r216803;
        return r216804;
}
↓
double f(double x, double y) {
        double r216805 = 500.0;
        double r216806 = x;
        double r216807 = r216805 * r216806;
        double r216808 = y;
        double r216809 = -r216808;
        double r216810 = r216805 * r216809;
        double r216811 = r216807 + r216810;
        return r216811;
}

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