Average Error: 0.0 → 0.0
Time: 7.9s
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 r224814 = 200.0;
        double r224815 = x;
        double r224816 = y;
        double r224817 = r224815 - r224816;
        double r224818 = r224814 * r224817;
        return r224818;
}
↓
double f(double x, double y) {
        double r224819 = x;
        double r224820 = y;
        double r224821 = r224819 - r224820;
        double r224822 = 200.0;
        double r224823 = r224821 * r224822;
        return r224823;
}

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-lft-in0.0

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

  5. Final simplification0.0

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

Reproduce

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