Average Error: 0.0 → 0.0
Time: 575.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 r232254 = x;
        double r232255 = 1.0;
        double r232256 = y;
        double r232257 = r232255 - r232256;
        double r232258 = r232254 * r232257;
        return r232258;
}
↓
double f(double x, double y) {
        double r232259 = x;
        double r232260 = 1.0;
        double r232261 = r232259 * r232260;
        double r232262 = y;
        double r232263 = -r232262;
        double r232264 = r232259 * r232263;
        double r232265 = r232261 + r232264;
        return r232265;
}

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