Average Error: 0.0 → 0.0
Time: 6.8s
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 r353381 = x;
        double r353382 = 1.0;
        double r353383 = y;
        double r353384 = r353382 - r353383;
        double r353385 = r353381 * r353384;
        return r353385;
}
↓
double f(double x, double y) {
        double r353386 = 1.0;
        double r353387 = x;
        double r353388 = r353386 * r353387;
        double r353389 = y;
        double r353390 = -r353389;
        double r353391 = r353390 * r353387;
        double r353392 = r353388 + r353391;
        return r353392;
}

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