Average Error: 0.0 → 0.0
Time: 1.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 r1128 = x;
        double r1129 = 1.0;
        double r1130 = y;
        double r1131 = r1129 - r1130;
        double r1132 = r1128 * r1131;
        return r1132;
}
↓
double f(double x, double y) {
        double r1133 = x;
        double r1134 = 1.0;
        double r1135 = r1133 * r1134;
        double r1136 = y;
        double r1137 = -r1136;
        double r1138 = r1133 * r1137;
        double r1139 = r1135 + r1138;
        return r1139;
}

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