Average Error: 0.0 → 0.0
Time: 2.0s
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 r296533 = 500.0;
        double r296534 = x;
        double r296535 = y;
        double r296536 = r296534 - r296535;
        double r296537 = r296533 * r296536;
        return r296537;
}
↓
double f(double x, double y) {
        double r296538 = 500.0;
        double r296539 = x;
        double r296540 = r296538 * r296539;
        double r296541 = y;
        double r296542 = -r296541;
        double r296543 = r296538 * r296542;
        double r296544 = r296540 + r296543;
        return r296544;
}

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