Average Error: 0.0 → 0.0
Time: 2.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 r186525 = x;
        double r186526 = 1.0;
        double r186527 = y;
        double r186528 = r186526 - r186527;
        double r186529 = r186525 * r186528;
        return r186529;
}
↓
double f(double x, double y) {
        double r186530 = y;
        double r186531 = -r186530;
        double r186532 = x;
        double r186533 = r186531 * r186532;
        double r186534 = 1.0;
        double r186535 = r186532 * r186534;
        double r186536 = r186533 + r186535;
        return r186536;
}

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