Average Error: 0.0 → 0.0
Time: 3.9s
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 r193403 = 500.0;
        double r193404 = x;
        double r193405 = y;
        double r193406 = r193404 - r193405;
        double r193407 = r193403 * r193406;
        return r193407;
}
↓
double f(double x, double y) {
        double r193408 = x;
        double r193409 = y;
        double r193410 = r193408 - r193409;
        double r193411 = 500.0;
        double r193412 = r193410 * r193411;
        return r193412;
}

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