Average Error: 0.0 → 0.0
Time: 6.3s
Precision: 64
\[x \cdot \left(1 - y\right)\]
↓
\[1 \cdot x + \left(-y\right) \cdot x\]
x \cdot \left(1 - y\right)
↓
1 \cdot x + \left(-y\right) \cdot x
double f(double x, double y) {
        double r497508 = x;
        double r497509 = 1.0;
        double r497510 = y;
        double r497511 = r497509 - r497510;
        double r497512 = r497508 * r497511;
        return r497512;
}
↓
double f(double x, double y) {
        double r497513 = 1.0;
        double r497514 = x;
        double r497515 = r497513 * r497514;
        double r497516 = y;
        double r497517 = -r497516;
        double r497518 = r497517 * r497514;
        double r497519 = r497515 + r497518;
        return r497519;
}

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

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

  7. Final simplification0.0

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

Reproduce

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