Average Error: 0.0 → 0.0
Time: 6.3s
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 r198737 = x;
        double r198738 = 1.0;
        double r198739 = y;
        double r198740 = r198738 - r198739;
        double r198741 = r198737 * r198740;
        return r198741;
}
↓
double f(double x, double y) {
        double r198742 = x;
        double r198743 = 1.0;
        double r198744 = r198742 * r198743;
        double r198745 = y;
        double r198746 = -r198745;
        double r198747 = r198742 * r198746;
        double r198748 = r198744 + r198747;
        return r198748;
}

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