Average Error: 0.0 → 0.0
Time: 6.2s
Precision: 64
\[x \cdot \left(y + 1\right)\]
↓
\[y \cdot x + x \cdot 1\]
x \cdot \left(y + 1\right)
↓
y \cdot x + x \cdot 1
double f(double x, double y) {
        double r858036 = x;
        double r858037 = y;
        double r858038 = 1.0;
        double r858039 = r858037 + r858038;
        double r858040 = r858036 * r858039;
        return r858040;
}
↓
double f(double x, double y) {
        double r858041 = y;
        double r858042 = x;
        double r858043 = r858041 * r858042;
        double r858044 = 1.0;
        double r858045 = r858042 * r858044;
        double r858046 = r858043 + r858045;
        return r858046;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.0
Target0.0
Herbie0.0
\[x + x \cdot y\]

Derivation

  1. Initial program 0.0

    \[x \cdot \left(y + 1\right)\]
  2. Using strategy rm

  3. Applied distribute-lft-in0.0

    \[\leadsto \color{blue}{x \cdot y + x \cdot 1}\]

  4. Simplified0.0

    \[\leadsto \color{blue}{y \cdot x} + x \cdot 1\]

  5. Final simplification0.0

    \[\leadsto y \cdot x + x \cdot 1\]

Reproduce

herbie shell --seed 2020047 +o rules:numerics
(FPCore (x y)
  :name "Data.Colour.RGBSpace.HSL:hsl from colour-2.3.3, B"
  :precision binary64

  :herbie-target
  (+ x (* x y))

  (* x (+ y 1)))