Average Error: 0.0 → 0.0
Time: 14.2s
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 r142736 = 200.0;
        double r142737 = x;
        double r142738 = y;
        double r142739 = r142737 - r142738;
        double r142740 = r142736 * r142739;
        return r142740;
}
↓
double f(double x, double y) {
        double r142741 = x;
        double r142742 = y;
        double r142743 = r142741 - r142742;
        double r142744 = 200.0;
        double r142745 = r142743 * r142744;
        return r142745;
}

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 *-commutative0.0

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

  4. 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)))