Average Error: 0.0 → 0.0
Time: 885.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 r197364 = x;
        double r197365 = 1.0;
        double r197366 = y;
        double r197367 = r197365 - r197366;
        double r197368 = r197364 * r197367;
        return r197368;
}
↓
double f(double x, double y) {
        double r197369 = x;
        double r197370 = 1.0;
        double r197371 = r197369 * r197370;
        double r197372 = y;
        double r197373 = -r197372;
        double r197374 = r197369 * r197373;
        double r197375 = r197371 + r197374;
        return r197375;
}

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