Average Error: 0.0 → 0.0
Time: 13.9s
Precision: 64
\[200 \cdot \left(x - y\right)\]
↓
\[x \cdot 200 + 200 \cdot \left(-y\right)\]
200 \cdot \left(x - y\right)
↓
x \cdot 200 + 200 \cdot \left(-y\right)
double f(double x, double y) {
        double r223729 = 200.0;
        double r223730 = x;
        double r223731 = y;
        double r223732 = r223730 - r223731;
        double r223733 = r223729 * r223732;
        return r223733;
}
↓
double f(double x, double y) {
        double r223734 = x;
        double r223735 = 200.0;
        double r223736 = r223734 * r223735;
        double r223737 = y;
        double r223738 = -r223737;
        double r223739 = r223735 * r223738;
        double r223740 = r223736 + r223739;
        return r223740;
}

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

    \[200 \cdot \left(x - y\right)\]
  2. Using strategy rm

  3. Applied sub-neg0.0

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

  4. Applied distribute-rgt-in0.0

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

  5. Simplified0.0

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

  6. Final simplification0.0

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

Reproduce

herbie shell --seed 2019235 +o rules:numerics
(FPCore (x y)
  :name "Data.Colour.CIE:cieLABView from colour-2.3.3, C"
  :precision binary64
  (* 200 (- x y)))