Average Error: 0.0 → 0.0
Time: 680.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 r323029 = x;
        double r323030 = 1.0;
        double r323031 = y;
        double r323032 = r323030 - r323031;
        double r323033 = r323029 * r323032;
        return r323033;
}

double f(double x, double y) {
        double r323034 = x;
        double r323035 = 1.0;
        double r323036 = r323034 * r323035;
        double r323037 = y;
        double r323038 = -r323037;
        double r323039 = r323034 * r323038;
        double r323040 = r323036 + r323039;
        return r323040;
}

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