Average Error: 0.0 → 0.0
Time: 6.9s
Precision: 64
\[500.0 \cdot \left(x - y\right)\]
↓
\[500.0 \cdot \left(-y\right) + x \cdot 500.0\]
500.0 \cdot \left(x - y\right)
↓
500.0 \cdot \left(-y\right) + x \cdot 500.0
double f(double x, double y) {
        double r15517760 = 500.0;
        double r15517761 = x;
        double r15517762 = y;
        double r15517763 = r15517761 - r15517762;
        double r15517764 = r15517760 * r15517763;
        return r15517764;
}
↓
double f(double x, double y) {
        double r15517765 = 500.0;
        double r15517766 = y;
        double r15517767 = -r15517766;
        double r15517768 = r15517765 * r15517767;
        double r15517769 = x;
        double r15517770 = r15517769 * r15517765;
        double r15517771 = r15517768 + r15517770;
        return r15517771;
}

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.0 \cdot \left(x - y\right)\]
  2. Using strategy rm

  3. Applied sub-neg0.0

    \[\leadsto 500.0 \cdot \color{blue}{\left(x + \left(-y\right)\right)}\]

  4. Applied distribute-rgt-in0.0

    \[\leadsto \color{blue}{x \cdot 500.0 + \left(-y\right) \cdot 500.0}\]

  5. Final simplification0.0

    \[\leadsto 500.0 \cdot \left(-y\right) + x \cdot 500.0\]

Reproduce

herbie shell --seed 2019163 
(FPCore (x y)
  :name "Data.Colour.CIE:cieLABView from colour-2.3.3, B"
  (* 500.0 (- x y)))