Average Error: 0.0 → 0.0
Time: 7.9s
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 r190736 = 500.0;
        double r190737 = x;
        double r190738 = y;
        double r190739 = r190737 - r190738;
        double r190740 = r190736 * r190739;
        return r190740;
}
↓
double f(double x, double y) {
        double r190741 = x;
        double r190742 = y;
        double r190743 = r190741 - r190742;
        double r190744 = 500.0;
        double r190745 = r190743 * r190744;
        return r190745;
}

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