Average Error: 0.0 → 0.0
Time: 4.2s
Precision: 64
\[500 \cdot \left(x - y\right)\]
↓
\[x \cdot 500 + \left(-y\right) \cdot 500\]
500 \cdot \left(x - y\right)
↓
x \cdot 500 + \left(-y\right) \cdot 500
double f(double x, double y) {
        double r289077 = 500.0;
        double r289078 = x;
        double r289079 = y;
        double r289080 = r289078 - r289079;
        double r289081 = r289077 * r289080;
        return r289081;
}
↓
double f(double x, double y) {
        double r289082 = x;
        double r289083 = 500.0;
        double r289084 = r289082 * r289083;
        double r289085 = y;
        double r289086 = -r289085;
        double r289087 = r289086 * r289083;
        double r289088 = r289084 + r289087;
        return r289088;
}

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. Simplified0.0

    \[\leadsto \color{blue}{x \cdot 500} + 500 \cdot \left(-y\right)\]

  6. Simplified0.0

    \[\leadsto x \cdot 500 + \color{blue}{\left(-y\right) \cdot 500}\]

  7. Final simplification0.0

    \[\leadsto x \cdot 500 + \left(-y\right) \cdot 500\]

Reproduce

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