Average Error: 0.0 → 0.0
Time: 12.7s
Precision: 64
\[200.0 \cdot \left(x - y\right)\]
↓
\[200.0 \cdot \left(-y\right) + x \cdot 200.0\]
200.0 \cdot \left(x - y\right)
↓
200.0 \cdot \left(-y\right) + x \cdot 200.0
double f(double x, double y) {
        double r15222278 = 200.0;
        double r15222279 = x;
        double r15222280 = y;
        double r15222281 = r15222279 - r15222280;
        double r15222282 = r15222278 * r15222281;
        return r15222282;
}
↓
double f(double x, double y) {
        double r15222283 = 200.0;
        double r15222284 = y;
        double r15222285 = -r15222284;
        double r15222286 = r15222283 * r15222285;
        double r15222287 = x;
        double r15222288 = r15222287 * r15222283;
        double r15222289 = r15222286 + r15222288;
        return r15222289;
}

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.0 \cdot \left(x - y\right)\]
  2. Using strategy rm

  3. Applied sub-neg0.0

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

  4. Applied distribute-rgt-in0.0

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

  5. Final simplification0.0

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

Reproduce

herbie shell --seed 2019163 
(FPCore (x y)
  :name "Data.Colour.CIE:cieLABView from colour-2.3.3, C"
  (* 200.0 (- x y)))