Average Error: 0.0 → 0.0
Time: 3.4s
Precision: 64
\[x \cdot \left(1 - y\right)\]
↓
\[1 \cdot x + \left(-y\right) \cdot x\]
x \cdot \left(1 - y\right)
↓
1 \cdot x + \left(-y\right) \cdot x
double f(double x, double y) {
        double r223217 = x;
        double r223218 = 1.0;
        double r223219 = y;
        double r223220 = r223218 - r223219;
        double r223221 = r223217 * r223220;
        return r223221;
}
↓
double f(double x, double y) {
        double r223222 = 1.0;
        double r223223 = x;
        double r223224 = r223222 * r223223;
        double r223225 = y;
        double r223226 = -r223225;
        double r223227 = r223226 * r223223;
        double r223228 = r223224 + r223227;
        return r223228;
}

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

  6. Simplified0.0

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

  7. Final simplification0.0

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

Reproduce

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