Average Error: 0.0 → 0.0
Time: 7.9s
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 r189837 = 500.0;
        double r189838 = x;
        double r189839 = y;
        double r189840 = r189838 - r189839;
        double r189841 = r189837 * r189840;
        return r189841;
}
↓
double f(double x, double y) {
        double r189842 = 500.0;
        double r189843 = x;
        double r189844 = r189842 * r189843;
        double r189845 = y;
        double r189846 = -r189845;
        double r189847 = r189842 * r189846;
        double r189848 = r189844 + r189847;
        return r189848;
}

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