Average Error: 0.0 → 0.0
Time: 888.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 r290533 = x;
        double r290534 = 1.0;
        double r290535 = y;
        double r290536 = r290534 - r290535;
        double r290537 = r290533 * r290536;
        return r290537;
}
↓
double f(double x, double y) {
        double r290538 = x;
        double r290539 = 1.0;
        double r290540 = r290538 * r290539;
        double r290541 = y;
        double r290542 = -r290541;
        double r290543 = r290538 * r290542;
        double r290544 = r290540 + r290543;
        return r290544;
}

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