Average Error: 0.0 → 0.0
Time: 677.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 r200136 = x;
        double r200137 = 1.0;
        double r200138 = y;
        double r200139 = r200137 - r200138;
        double r200140 = r200136 * r200139;
        return r200140;
}
↓
double f(double x, double y) {
        double r200141 = x;
        double r200142 = 1.0;
        double r200143 = r200141 * r200142;
        double r200144 = y;
        double r200145 = -r200144;
        double r200146 = r200141 * r200145;
        double r200147 = r200143 + r200146;
        return r200147;
}

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