Average Error: 0.0 → 0.0
Time: 3.2s
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 r312091 = 500.0;
        double r312092 = x;
        double r312093 = y;
        double r312094 = r312092 - r312093;
        double r312095 = r312091 * r312094;
        return r312095;
}

double f(double x, double y) {
        double r312096 = 500.0;
        double r312097 = x;
        double r312098 = r312096 * r312097;
        double r312099 = y;
        double r312100 = -r312099;
        double r312101 = r312096 * r312100;
        double r312102 = r312098 + r312101;
        return r312102;
}

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