Average Error: 0.0 → 0.0
Time: 610.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 r253652 = x;
        double r253653 = 1.0;
        double r253654 = y;
        double r253655 = r253653 - r253654;
        double r253656 = r253652 * r253655;
        return r253656;
}
↓
double f(double x, double y) {
        double r253657 = x;
        double r253658 = 1.0;
        double r253659 = r253657 * r253658;
        double r253660 = y;
        double r253661 = -r253660;
        double r253662 = r253657 * r253661;
        double r253663 = r253659 + r253662;
        return r253663;
}

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