Average Error: 0.0 → 0.0
Time: 5.1s
Precision: 64
\[x \cdot \left(1 - y\right)\]
↓
\[\left(-y\right) \cdot x + x \cdot 1\]
x \cdot \left(1 - y\right)
↓
\left(-y\right) \cdot x + x \cdot 1
double f(double x, double y) {
        double r185348 = x;
        double r185349 = 1.0;
        double r185350 = y;
        double r185351 = r185349 - r185350;
        double r185352 = r185348 * r185351;
        return r185352;
}
↓
double f(double x, double y) {
        double r185353 = y;
        double r185354 = -r185353;
        double r185355 = x;
        double r185356 = r185354 * r185355;
        double r185357 = 1.0;
        double r185358 = r185355 * r185357;
        double r185359 = r185356 + r185358;
        return r185359;
}

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. Simplified0.0

    \[\leadsto x \cdot 1 + \color{blue}{y \cdot \left(-x\right)}\]

  6. Final simplification0.0

    \[\leadsto \left(-y\right) \cdot x + x \cdot 1\]

Reproduce

herbie shell --seed 2019196 +o rules:numerics
(FPCore (x y)
  :name "Data.Colour.RGBSpace.HSV:hsv from colour-2.3.3, H"
  (* x (- 1.0 y)))