Average Error: 0.0 → 0.0
Time: 13.0s
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 r173430 = 500.0;
        double r173431 = x;
        double r173432 = y;
        double r173433 = r173431 - r173432;
        double r173434 = r173430 * r173433;
        return r173434;
}
↓
double f(double x, double y) {
        double r173435 = 500.0;
        double r173436 = x;
        double r173437 = r173435 * r173436;
        double r173438 = y;
        double r173439 = -r173438;
        double r173440 = r173435 * r173439;
        double r173441 = r173437 + r173440;
        return r173441;
}

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