Average Error: 0.0 → 0.0
Time: 6.3s
Precision: 64
\[500 \cdot \left(x - y\right)\]
↓
\[\left(x - y\right) \cdot 500\]
500 \cdot \left(x - y\right)
↓
\left(x - y\right) \cdot 500
double f(double x, double y) {
        double r166827 = 500.0;
        double r166828 = x;
        double r166829 = y;
        double r166830 = r166828 - r166829;
        double r166831 = r166827 * r166830;
        return r166831;
}
↓
double f(double x, double y) {
        double r166832 = x;
        double r166833 = y;
        double r166834 = r166832 - r166833;
        double r166835 = 500.0;
        double r166836 = r166834 * r166835;
        return r166836;
}

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 \left(x - y\right) \cdot 500\]

Reproduce

herbie shell --seed 2019294 
(FPCore (x y)
  :name "Data.Colour.CIE:cieLABView from colour-2.3.3, B"
  :precision binary64
  (* 500 (- x y)))