Average Error: 0.0 → 0.0
Time: 2.8s
Precision: 64
\[500 \cdot \left(x - y\right)\]
↓
\[\left(x - y\right) \cdot 500\]
500 \cdot \left(x - y\right)
↓
\left(x - y\right) \cdot 500
double f(double x, double y) {
        double r247447 = 500.0;
        double r247448 = x;
        double r247449 = y;
        double r247450 = r247448 - r247449;
        double r247451 = r247447 * r247450;
        return r247451;
}
↓
double f(double x, double y) {
        double r247452 = x;
        double r247453 = y;
        double r247454 = r247452 - r247453;
        double r247455 = 500.0;
        double r247456 = r247454 * r247455;
        return r247456;
}

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 \left(x - y\right) \cdot 500\]

Reproduce

herbie shell --seed 2019304 
(FPCore (x y)
  :name "Data.Colour.CIE:cieLABView from colour-2.3.3, B"
  :precision binary64
  (* 500 (- x y)))