Average Error: 0.0 → 0.0
Time: 4.2s
Precision: 64
\[x \cdot \left(1 - y\right)\]
↓
\[1 \cdot x + x \cdot \left(-y\right)\]
x \cdot \left(1 - y\right)
↓
1 \cdot x + x \cdot \left(-y\right)
double f(double x, double y) {
        double r207773 = x;
        double r207774 = 1.0;
        double r207775 = y;
        double r207776 = r207774 - r207775;
        double r207777 = r207773 * r207776;
        return r207777;
}
↓
double f(double x, double y) {
        double r207778 = 1.0;
        double r207779 = x;
        double r207780 = r207778 * r207779;
        double r207781 = y;
        double r207782 = -r207781;
        double r207783 = r207779 * r207782;
        double r207784 = r207780 + r207783;
        return r207784;
}

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. Simplified0.0

    \[\leadsto \color{blue}{1 \cdot x} + x \cdot \left(-y\right)\]

  6. Final simplification0.0

    \[\leadsto 1 \cdot x + x \cdot \left(-y\right)\]

Reproduce

herbie shell --seed 2019305 
(FPCore (x y)
  :name "Data.Colour.RGBSpace.HSV:hsv from colour-2.3.3, H"
  :precision binary64
  (* x (- 1 y)))