Average Error: 0.0 → 0.0
Time: 774.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 r317462 = x;
        double r317463 = 1.0;
        double r317464 = y;
        double r317465 = r317463 - r317464;
        double r317466 = r317462 * r317465;
        return r317466;
}

double f(double x, double y) {
        double r317467 = x;
        double r317468 = 1.0;
        double r317469 = r317467 * r317468;
        double r317470 = y;
        double r317471 = -r317470;
        double r317472 = r317467 * r317471;
        double r317473 = r317469 + r317472;
        return r317473;
}

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