Average Error: 0.0 → 0.0
Time: 5.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 r189518 = 200.0;
        double r189519 = x;
        double r189520 = y;
        double r189521 = r189519 - r189520;
        double r189522 = r189518 * r189521;
        return r189522;
}
↓
double f(double x, double y) {
        double r189523 = x;
        double r189524 = y;
        double r189525 = r189523 - r189524;
        double r189526 = 200.0;
        double r189527 = r189525 * r189526;
        return r189527;
}

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