Average Error: 0.0 → 0.0
Time: 513.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 r276979 = x;
        double r276980 = 1.0;
        double r276981 = y;
        double r276982 = r276980 - r276981;
        double r276983 = r276979 * r276982;
        return r276983;
}

double f(double x, double y) {
        double r276984 = x;
        double r276985 = 1.0;
        double r276986 = r276984 * r276985;
        double r276987 = y;
        double r276988 = -r276987;
        double r276989 = r276984 * r276988;
        double r276990 = r276986 + r276989;
        return r276990;
}

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