Average Error: 0.0 → 0.0
Time: 4.0s
Precision: 64
\[x \cdot \left(y + 1\right)\]
↓
\[x \cdot \left(y + 1\right)\]
x \cdot \left(y + 1\right)
↓
x \cdot \left(y + 1\right)
double f(double x, double y) {
        double r560184 = x;
        double r560185 = y;
        double r560186 = 1.0;
        double r560187 = r560185 + r560186;
        double r560188 = r560184 * r560187;
        return r560188;
}
↓
double f(double x, double y) {
        double r560189 = x;
        double r560190 = y;
        double r560191 = 1.0;
        double r560192 = r560190 + r560191;
        double r560193 = r560189 * r560192;
        return r560193;
}

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. Final simplification0.0

    \[\leadsto x \cdot \left(y + 1\right)\]

Reproduce

herbie shell --seed 2019297 
(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)))