Average Error: 0.0 → 0.0
Time: 7.6s
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 r196349 = 200.0;
        double r196350 = x;
        double r196351 = y;
        double r196352 = r196350 - r196351;
        double r196353 = r196349 * r196352;
        return r196353;
}
↓
double f(double x, double y) {
        double r196354 = x;
        double r196355 = y;
        double r196356 = r196354 - r196355;
        double r196357 = 200.0;
        double r196358 = r196356 * r196357;
        return r196358;
}

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