Average Error: 0.0 → 0.0
Time: 4.1s
Precision: 64
\[x \cdot \left(1 - y\right)\]
↓
\[1 \cdot x + \left(-y\right) \cdot x\]
x \cdot \left(1 - y\right)
↓
1 \cdot x + \left(-y\right) \cdot x
double f(double x, double y) {
        double r196158 = x;
        double r196159 = 1.0;
        double r196160 = y;
        double r196161 = r196159 - r196160;
        double r196162 = r196158 * r196161;
        return r196162;
}
↓
double f(double x, double y) {
        double r196163 = 1.0;
        double r196164 = x;
        double r196165 = r196163 * r196164;
        double r196166 = y;
        double r196167 = -r196166;
        double r196168 = r196167 * r196164;
        double r196169 = r196165 + r196168;
        return r196169;
}

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. Simplified0.0

    \[\leadsto \color{blue}{1 \cdot x} + x \cdot \left(-y\right)\]

  6. Simplified0.0

    \[\leadsto 1 \cdot x + \color{blue}{\left(-y\right) \cdot x}\]

  7. Final simplification0.0

    \[\leadsto 1 \cdot x + \left(-y\right) \cdot x\]

Reproduce

herbie shell --seed 2020047 +o rules:numerics
(FPCore (x y)
  :name "Data.Colour.RGBSpace.HSV:hsv from colour-2.3.3, H"
  :precision binary64
  (* x (- 1 y)))