Average Error: 0.0 → 0.0
Time: 14.4s
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 r205431 = 500.0;
        double r205432 = x;
        double r205433 = y;
        double r205434 = r205432 - r205433;
        double r205435 = r205431 * r205434;
        return r205435;
}
↓
double f(double x, double y) {
        double r205436 = 500.0;
        double r205437 = x;
        double r205438 = r205436 * r205437;
        double r205439 = y;
        double r205440 = -r205439;
        double r205441 = r205436 * r205440;
        double r205442 = r205438 + r205441;
        return r205442;
}

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