Average Error: 0.0 → 0.0
Time: 1.1s
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 r229569 = 500.0;
        double r229570 = x;
        double r229571 = y;
        double r229572 = r229570 - r229571;
        double r229573 = r229569 * r229572;
        return r229573;
}
↓
double f(double x, double y) {
        double r229574 = 500.0;
        double r229575 = x;
        double r229576 = r229574 * r229575;
        double r229577 = y;
        double r229578 = -r229577;
        double r229579 = r229574 * r229578;
        double r229580 = r229576 + r229579;
        return r229580;
}

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