Average Error: 0.0 → 0.0
Time: 9.8s
Precision: 64
\[200.0 \cdot \left(x - y\right)\]
↓
\[\left(-y\right) \cdot 200.0 + 200.0 \cdot x\]
200.0 \cdot \left(x - y\right)
↓
\left(-y\right) \cdot 200.0 + 200.0 \cdot x
double f(double x, double y) {
        double r11110310 = 200.0;
        double r11110311 = x;
        double r11110312 = y;
        double r11110313 = r11110311 - r11110312;
        double r11110314 = r11110310 * r11110313;
        return r11110314;
}
↓
double f(double x, double y) {
        double r11110315 = y;
        double r11110316 = -r11110315;
        double r11110317 = 200.0;
        double r11110318 = r11110316 * r11110317;
        double r11110319 = x;
        double r11110320 = r11110317 * r11110319;
        double r11110321 = r11110318 + r11110320;
        return r11110321;
}

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

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

  5. Final simplification0.0

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

Reproduce

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