Average Error: 0.0 → 0.0
Time: 3.5s
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 r291956 = x;
        double r291957 = y;
        double r291958 = 1.0;
        double r291959 = r291957 + r291958;
        double r291960 = r291956 * r291959;
        return r291960;
}
↓
double f(double x, double y) {
        double r291961 = x;
        double r291962 = y;
        double r291963 = 1.0;
        double r291964 = r291962 + r291963;
        double r291965 = r291961 * r291964;
        return r291965;
}

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

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

Reproduce

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