Average Error: 0.0 → 0.0
Time: 729.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 r219319 = x;
        double r219320 = 1.0;
        double r219321 = y;
        double r219322 = r219320 - r219321;
        double r219323 = r219319 * r219322;
        return r219323;
}
↓
double f(double x, double y) {
        double r219324 = x;
        double r219325 = 1.0;
        double r219326 = r219324 * r219325;
        double r219327 = y;
        double r219328 = -r219327;
        double r219329 = r219324 * r219328;
        double r219330 = r219326 + r219329;
        return r219330;
}

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