Average Error: 0.0 → 0.0
Time: 781.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 r222533 = x;
        double r222534 = 1.0;
        double r222535 = y;
        double r222536 = r222534 - r222535;
        double r222537 = r222533 * r222536;
        return r222537;
}
↓
double f(double x, double y) {
        double r222538 = x;
        double r222539 = 1.0;
        double r222540 = r222538 * r222539;
        double r222541 = y;
        double r222542 = -r222541;
        double r222543 = r222538 * r222542;
        double r222544 = r222540 + r222543;
        return r222544;
}

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