Average Error: 0.0 → 0.0
Time: 6.0s
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 r160280 = x;
        double r160281 = 1.0;
        double r160282 = y;
        double r160283 = r160281 - r160282;
        double r160284 = r160280 * r160283;
        return r160284;
}
↓
double f(double x, double y) {
        double r160285 = x;
        double r160286 = 1.0;
        double r160287 = r160285 * r160286;
        double r160288 = y;
        double r160289 = -r160288;
        double r160290 = r160285 * r160289;
        double r160291 = r160287 + r160290;
        return r160291;
}

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