Average Error: 0.0 → 0.0
Time: 2.0s
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 r176289 = x;
        double r176290 = 1.0;
        double r176291 = y;
        double r176292 = r176290 - r176291;
        double r176293 = r176289 * r176292;
        return r176293;
}
↓
double f(double x, double y) {
        double r176294 = 1.0;
        double r176295 = x;
        double r176296 = r176294 * r176295;
        double r176297 = y;
        double r176298 = -r176297;
        double r176299 = r176295 * r176298;
        double r176300 = r176296 + r176299;
        return r176300;
}

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