Average Error: 0.0 → 0.0
Time: 6.4s
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 r145403 = x;
        double r145404 = 1.0;
        double r145405 = y;
        double r145406 = r145404 - r145405;
        double r145407 = r145403 * r145406;
        return r145407;
}

double f(double x, double y) {
        double r145408 = x;
        double r145409 = 1.0;
        double r145410 = r145408 * r145409;
        double r145411 = y;
        double r145412 = -r145411;
        double r145413 = r145408 * r145412;
        double r145414 = r145410 + r145413;
        return r145414;
}

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 2019198 +o rules:numerics
(FPCore (x y)
  :name "Data.Colour.RGBSpace.HSV:hsv from colour-2.3.3, H"
  (* x (- 1.0 y)))