Average Error: 0.0 → 0.0
Time: 4.5s
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 r184259 = x;
        double r184260 = 1.0;
        double r184261 = y;
        double r184262 = r184260 - r184261;
        double r184263 = r184259 * r184262;
        return r184263;
}
↓
double f(double x, double y) {
        double r184264 = 1.0;
        double r184265 = x;
        double r184266 = r184264 * r184265;
        double r184267 = y;
        double r184268 = -r184267;
        double r184269 = r184265 * r184268;
        double r184270 = r184266 + r184269;
        return r184270;
}

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