Average Error: 0.0 → 0.0
Time: 711.0ms
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 r251819 = x;
        double r251820 = 1.0;
        double r251821 = y;
        double r251822 = r251820 - r251821;
        double r251823 = r251819 * r251822;
        return r251823;
}

double f(double x, double y) {
        double r251824 = x;
        double r251825 = 1.0;
        double r251826 = r251824 * r251825;
        double r251827 = y;
        double r251828 = -r251827;
        double r251829 = r251824 * r251828;
        double r251830 = r251826 + r251829;
        return r251830;
}

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