Average Error: 0.0 → 0.0
Time: 1.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 r188313 = 500.0;
        double r188314 = x;
        double r188315 = y;
        double r188316 = r188314 - r188315;
        double r188317 = r188313 * r188316;
        return r188317;
}

double f(double x, double y) {
        double r188318 = 500.0;
        double r188319 = x;
        double r188320 = r188318 * r188319;
        double r188321 = y;
        double r188322 = -r188321;
        double r188323 = r188318 * r188322;
        double r188324 = r188320 + r188323;
        return r188324;
}

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