Average Error: 0.0 → 0.0
Time: 2.6s
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 r211959 = x;
        double r211960 = 1.0;
        double r211961 = y;
        double r211962 = r211960 - r211961;
        double r211963 = r211959 * r211962;
        return r211963;
}
↓
double f(double x, double y) {
        double r211964 = 1.0;
        double r211965 = x;
        double r211966 = r211964 * r211965;
        double r211967 = y;
        double r211968 = -r211967;
        double r211969 = r211968 * r211965;
        double r211970 = r211966 + r211969;
        return r211970;
}

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