Average Error: 0.0 → 0.0
Time: 728.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 r760573 = x;
        double r760574 = y;
        double r760575 = 1.0;
        double r760576 = r760574 + r760575;
        double r760577 = r760573 * r760576;
        return r760577;
}
↓
double f(double x, double y) {
        double r760578 = x;
        double r760579 = y;
        double r760580 = 1.0;
        double r760581 = r760579 + r760580;
        double r760582 = r760578 * r760581;
        return r760582;
}

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 2020039 +o rules:numerics
(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)))