Average Error: 0.0 → 0.0
Time: 4.7s
Precision: 64
\[x \cdot \left(1 - y\right)\]
↓
\[x \cdot 1 + \left(-y\right) \cdot x\]
x \cdot \left(1 - y\right)
↓
x \cdot 1 + \left(-y\right) \cdot x
double f(double x, double y) {
        double r193117 = x;
        double r193118 = 1.0;
        double r193119 = y;
        double r193120 = r193118 - r193119;
        double r193121 = r193117 * r193120;
        return r193121;
}
↓
double f(double x, double y) {
        double r193122 = x;
        double r193123 = 1.0;
        double r193124 = r193122 * r193123;
        double r193125 = y;
        double r193126 = -r193125;
        double r193127 = r193126 * r193122;
        double r193128 = r193124 + r193127;
        return r193128;
}

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}{\left(-y\right) \cdot x}\]

  6. Final simplification0.0

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

Reproduce

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