Average Error: 0.0 → 0.0
Time: 684.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 r198526 = x;
        double r198527 = 1.0;
        double r198528 = y;
        double r198529 = r198527 - r198528;
        double r198530 = r198526 * r198529;
        return r198530;
}
↓
double f(double x, double y) {
        double r198531 = x;
        double r198532 = 1.0;
        double r198533 = r198531 * r198532;
        double r198534 = y;
        double r198535 = -r198534;
        double r198536 = r198531 * r198535;
        double r198537 = r198533 + r198536;
        return r198537;
}

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