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 r319985 = x;
        double r319986 = y;
        double r319987 = 1.0;
        double r319988 = r319986 + r319987;
        double r319989 = r319985 * r319988;
        return r319989;
}
↓
double f(double x, double y) {
        double r319990 = x;
        double r319991 = y;
        double r319992 = 1.0;
        double r319993 = r319991 + r319992;
        double r319994 = r319990 * r319993;
        return r319994;
}

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)))