Average Error: 0.0 → 0.0
Time: 20.5s
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 r10191580 = x;
        double r10191581 = 1.0;
        double r10191582 = y;
        double r10191583 = r10191581 - r10191582;
        double r10191584 = r10191580 * r10191583;
        return r10191584;
}
↓
double f(double x, double y) {
        double r10191585 = y;
        double r10191586 = -r10191585;
        double r10191587 = x;
        double r10191588 = r10191586 * r10191587;
        double r10191589 = 1.0;
        double r10191590 = r10191587 * r10191589;
        double r10191591 = r10191588 + r10191590;
        return r10191591;
}

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

Reproduce

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