Average Error: 0.0 → 0.0
Time: 12.2s
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 r11445597 = 200.0;
        double r11445598 = x;
        double r11445599 = y;
        double r11445600 = r11445598 - r11445599;
        double r11445601 = r11445597 * r11445600;
        return r11445601;
}
↓
double f(double x, double y) {
        double r11445602 = 200.0;
        double r11445603 = y;
        double r11445604 = -r11445603;
        double r11445605 = r11445602 * r11445604;
        double r11445606 = x;
        double r11445607 = r11445606 * r11445602;
        double r11445608 = r11445605 + r11445607;
        return r11445608;
}

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