Average Error: 0.0 → 0.0
Time: 796.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 r4849 = x;
        double r4850 = y;
        double r4851 = 1.0;
        double r4852 = r4850 + r4851;
        double r4853 = r4849 * r4852;
        return r4853;
}
↓
double f(double x, double y) {
        double r4854 = x;
        double r4855 = y;
        double r4856 = 1.0;
        double r4857 = r4855 + r4856;
        double r4858 = r4854 * r4857;
        return r4858;
}

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