Average Error: 0.0 → 0.0
Time: 726.0ms
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 r225401 = x;
        double r225402 = 1.0;
        double r225403 = y;
        double r225404 = r225402 - r225403;
        double r225405 = r225401 * r225404;
        return r225405;
}
↓
double f(double x, double y) {
        double r225406 = x;
        double r225407 = 1.0;
        double r225408 = r225406 * r225407;
        double r225409 = y;
        double r225410 = -r225409;
        double r225411 = r225406 * r225410;
        double r225412 = r225408 + r225411;
        return r225412;
}

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 2020003 
(FPCore (x y)
  :name "Data.Colour.RGBSpace.HSV:hsv from colour-2.3.3, H"
  :precision binary64
  (* x (- 1 y)))