Average Error: 0.0 → 0.0
Time: 720.0ms
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 r261927 = x;
        double r261928 = 1.0;
        double r261929 = y;
        double r261930 = r261928 - r261929;
        double r261931 = r261927 * r261930;
        return r261931;
}
↓
double f(double x, double y) {
        double r261932 = x;
        double r261933 = 1.0;
        double r261934 = r261932 * r261933;
        double r261935 = y;
        double r261936 = -r261935;
        double r261937 = r261932 * r261936;
        double r261938 = r261934 + r261937;
        return r261938;
}

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