Average Error: 0.0 → 0.0
Time: 670.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 r240329 = x;
        double r240330 = 1.0;
        double r240331 = y;
        double r240332 = r240330 - r240331;
        double r240333 = r240329 * r240332;
        return r240333;
}
↓
double f(double x, double y) {
        double r240334 = x;
        double r240335 = 1.0;
        double r240336 = r240334 * r240335;
        double r240337 = y;
        double r240338 = -r240337;
        double r240339 = r240334 * r240338;
        double r240340 = r240336 + r240339;
        return r240340;
}

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