Average Error: 0.0 → 0.0
Time: 1.1s
Precision: 64
\[x \cdot \left(1 - y\right)\]
↓
\[\left(1 - y\right) \cdot x\]
x \cdot \left(1 - y\right)
↓
\left(1 - y\right) \cdot x
double f(double x, double y) {
        double r154096 = x;
        double r154097 = 1.0;
        double r154098 = y;
        double r154099 = r154097 - r154098;
        double r154100 = r154096 * r154099;
        return r154100;
}
↓
double f(double x, double y) {
        double r154101 = 1.0;
        double r154102 = y;
        double r154103 = r154101 - r154102;
        double r154104 = x;
        double r154105 = r154103 * r154104;
        return r154105;
}

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 \left(1 - y\right) \cdot x\]

Reproduce

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