Average Error: 0.0 → 0.0
Time: 2.2s
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 r223038 = 500.0;
        double r223039 = x;
        double r223040 = y;
        double r223041 = r223039 - r223040;
        double r223042 = r223038 * r223041;
        return r223042;
}
↓
double f(double x, double y) {
        double r223043 = 500.0;
        double r223044 = x;
        double r223045 = r223043 * r223044;
        double r223046 = y;
        double r223047 = -r223046;
        double r223048 = r223043 * r223047;
        double r223049 = r223045 + r223048;
        return r223049;
}

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)))