Average Error: 0.0 → 0.0
Time: 1.9s
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 r271521 = 500.0;
        double r271522 = x;
        double r271523 = y;
        double r271524 = r271522 - r271523;
        double r271525 = r271521 * r271524;
        return r271525;
}

double f(double x, double y) {
        double r271526 = 500.0;
        double r271527 = x;
        double r271528 = r271526 * r271527;
        double r271529 = y;
        double r271530 = -r271529;
        double r271531 = r271526 * r271530;
        double r271532 = r271528 + r271531;
        return r271532;
}

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