Average Error: 0.0 → 0.0
Time: 7.7s
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 r479799 = x;
        double r479800 = y;
        double r479801 = 1.0;
        double r479802 = r479800 + r479801;
        double r479803 = r479799 * r479802;
        return r479803;
}
↓
double f(double x, double y) {
        double r479804 = x;
        double r479805 = y;
        double r479806 = 1.0;
        double r479807 = r479805 + r479806;
        double r479808 = r479804 * r479807;
        return r479808;
}

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 2019199 +o rules:numerics
(FPCore (x y)
  :name "Data.Colour.RGBSpace.HSL:hsl from colour-2.3.3, B"

  :herbie-target
  (+ x (* x y))

  (* x (+ y 1.0)))