Average Error: 0.0 → 0.0
Time: 884.0ms
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 r224598 = 500.0;
        double r224599 = x;
        double r224600 = y;
        double r224601 = r224599 - r224600;
        double r224602 = r224598 * r224601;
        return r224602;
}
↓
double f(double x, double y) {
        double r224603 = x;
        double r224604 = y;
        double r224605 = r224603 - r224604;
        double r224606 = 500.0;
        double r224607 = r224605 * r224606;
        return r224607;
}

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