Average Error: 0.0 → 0.0
Time: 7.5s
Precision: 64
\[x \cdot \left(1.0 - y\right)\]
↓
\[\left(-y\right) \cdot x + x \cdot 1.0\]
x \cdot \left(1.0 - y\right)
↓
\left(-y\right) \cdot x + x \cdot 1.0
double f(double x, double y) {
        double r14542281 = x;
        double r14542282 = 1.0;
        double r14542283 = y;
        double r14542284 = r14542282 - r14542283;
        double r14542285 = r14542281 * r14542284;
        return r14542285;
}
↓
double f(double x, double y) {
        double r14542286 = y;
        double r14542287 = -r14542286;
        double r14542288 = x;
        double r14542289 = r14542287 * r14542288;
        double r14542290 = 1.0;
        double r14542291 = r14542288 * r14542290;
        double r14542292 = r14542289 + r14542291;
        return r14542292;
}

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.0 - y\right)\]
  2. Using strategy rm

  3. Applied sub-neg0.0

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

  4. Applied distribute-lft-in0.0

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

  5. Final simplification0.0

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

Reproduce

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