Average Error: 0.0 → 0.0
Time: 2.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 r284623 = 500.0;
        double r284624 = x;
        double r284625 = y;
        double r284626 = r284624 - r284625;
        double r284627 = r284623 * r284626;
        return r284627;
}

double f(double x, double y) {
        double r284628 = 500.0;
        double r284629 = x;
        double r284630 = r284628 * r284629;
        double r284631 = y;
        double r284632 = -r284631;
        double r284633 = r284628 * r284632;
        double r284634 = r284630 + r284633;
        return r284634;
}

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