Average Error: 0.0 → 0.0
Time: 5.9s
Precision: 64
\[x \cdot \left(1 - y\right)\]
\[x \cdot 1 + x \cdot \left(-y\right)\]
x \cdot \left(1 - y\right)
x \cdot 1 + x \cdot \left(-y\right)
double f(double x, double y) {
        double r193244 = x;
        double r193245 = 1.0;
        double r193246 = y;
        double r193247 = r193245 - r193246;
        double r193248 = r193244 * r193247;
        return r193248;
}

double f(double x, double y) {
        double r193249 = x;
        double r193250 = 1.0;
        double r193251 = r193249 * r193250;
        double r193252 = y;
        double r193253 = -r193252;
        double r193254 = r193249 * r193253;
        double r193255 = r193251 + r193254;
        return r193255;
}

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

    \[x \cdot \left(1 - y\right)\]
  2. Using strategy rm
  3. Applied sub-neg0.0

    \[\leadsto x \cdot \color{blue}{\left(1 + \left(-y\right)\right)}\]
  4. Applied distribute-lft-in0.0

    \[\leadsto \color{blue}{x \cdot 1 + x \cdot \left(-y\right)}\]
  5. Final simplification0.0

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

Reproduce

herbie shell --seed 2019303 
(FPCore (x y)
  :name "Data.Colour.RGBSpace.HSV:hsv from colour-2.3.3, H"
  :precision binary64
  (* x (- 1 y)))