Average Error: 0.0 → 0.0
Time: 695.0ms
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 r300259 = 500.0;
        double r300260 = x;
        double r300261 = y;
        double r300262 = r300260 - r300261;
        double r300263 = r300259 * r300262;
        return r300263;
}
↓
double f(double x, double y) {
        double r300264 = 500.0;
        double r300265 = x;
        double r300266 = r300264 * r300265;
        double r300267 = y;
        double r300268 = -r300267;
        double r300269 = r300264 * r300268;
        double r300270 = r300266 + r300269;
        return r300270;
}

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