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 r368461 = 500.0;
        double r368462 = x;
        double r368463 = y;
        double r368464 = r368462 - r368463;
        double r368465 = r368461 * r368464;
        return r368465;
}
↓
double f(double x, double y) {
        double r368466 = 500.0;
        double r368467 = x;
        double r368468 = r368466 * r368467;
        double r368469 = y;
        double r368470 = -r368469;
        double r368471 = r368466 * r368470;
        double r368472 = r368468 + r368471;
        return r368472;
}

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)))