Average Error: 0.0 → 0.0
Time: 842.0ms
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 r767835 = x;
        double r767836 = y;
        double r767837 = 1.0;
        double r767838 = r767836 + r767837;
        double r767839 = r767835 * r767838;
        return r767839;
}
↓
double f(double x, double y) {
        double r767840 = x;
        double r767841 = y;
        double r767842 = 1.0;
        double r767843 = r767841 + r767842;
        double r767844 = r767840 * r767843;
        return r767844;
}

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