Average Error: 0.0 → 0.0
Time: 2.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 r277019 = 500.0;
        double r277020 = x;
        double r277021 = y;
        double r277022 = r277020 - r277021;
        double r277023 = r277019 * r277022;
        return r277023;
}

double f(double x, double y) {
        double r277024 = 500.0;
        double r277025 = x;
        double r277026 = r277024 * r277025;
        double r277027 = y;
        double r277028 = -r277027;
        double r277029 = r277024 * r277028;
        double r277030 = r277026 + r277029;
        return r277030;
}

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