Average Error: 0.0 → 0.0
Time: 13.4s
Precision: 64
\[200 \cdot \left(x - y\right)\]
↓
\[\left(x - y\right) \cdot 200\]
200 \cdot \left(x - y\right)
↓
\left(x - y\right) \cdot 200
double f(double x, double y) {
        double r170279 = 200.0;
        double r170280 = x;
        double r170281 = y;
        double r170282 = r170280 - r170281;
        double r170283 = r170279 * r170282;
        return r170283;
}
↓
double f(double x, double y) {
        double r170284 = x;
        double r170285 = y;
        double r170286 = r170284 - r170285;
        double r170287 = 200.0;
        double r170288 = r170286 * r170287;
        return r170288;
}

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 *-un-lft-identity0.0

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

  4. Applied associate-*l*0.0

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

  5. Simplified0.0

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

  6. Final simplification0.0

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

Reproduce

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