Average Error: 0.0 → 0.0
Time: 2.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 r141998 = 200.0;
        double r141999 = x;
        double r142000 = y;
        double r142001 = r141999 - r142000;
        double r142002 = r141998 * r142001;
        return r142002;
}
↓
double f(double x, double y) {
        double r142003 = x;
        double r142004 = y;
        double r142005 = r142003 - r142004;
        double r142006 = 200.0;
        double r142007 = r142005 * r142006;
        return r142007;
}

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