Average Error: 0.0 → 0.0
Time: 12.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 r168870 = 500.0;
        double r168871 = x;
        double r168872 = y;
        double r168873 = r168871 - r168872;
        double r168874 = r168870 * r168873;
        return r168874;
}
↓
double f(double x, double y) {
        double r168875 = 500.0;
        double r168876 = x;
        double r168877 = r168875 * r168876;
        double r168878 = y;
        double r168879 = -r168878;
        double r168880 = r168875 * r168879;
        double r168881 = r168877 + r168880;
        return r168881;
}

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