Average Error: 0.0 → 0.0
Time: 8.4s
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 r534263 = x;
        double r534264 = y;
        double r534265 = 1.0;
        double r534266 = r534264 + r534265;
        double r534267 = r534263 * r534266;
        return r534267;
}
↓
double f(double x, double y) {
        double r534268 = x;
        double r534269 = y;
        double r534270 = 1.0;
        double r534271 = r534269 + r534270;
        double r534272 = r534268 * r534271;
        return r534272;
}

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