Average Error: 0.0 → 0.0
Time: 15.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 r159945 = 200.0;
        double r159946 = x;
        double r159947 = y;
        double r159948 = r159946 - r159947;
        double r159949 = r159945 * r159948;
        return r159949;
}
↓
double f(double x, double y) {
        double r159950 = x;
        double r159951 = y;
        double r159952 = r159950 - r159951;
        double r159953 = 200.0;
        double r159954 = r159952 * r159953;
        return r159954;
}

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 2019325 +o rules:numerics
(FPCore (x y)
  :name "Data.Colour.CIE:cieLABView from colour-2.3.3, C"
  :precision binary64
  (* 200 (- x y)))