Average Error: 0.0 → 0.0
Time: 6.1s
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 r189713 = x;
        double r189714 = 1.0;
        double r189715 = y;
        double r189716 = r189714 - r189715;
        double r189717 = r189713 * r189716;
        return r189717;
}
↓
double f(double x, double y) {
        double r189718 = x;
        double r189719 = 1.0;
        double r189720 = r189718 * r189719;
        double r189721 = y;
        double r189722 = -r189721;
        double r189723 = r189718 * r189722;
        double r189724 = r189720 + r189723;
        return r189724;
}

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)))