Average Error: 0.0 → 0.0
Time: 885.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 r984090 = x;
        double r984091 = y;
        double r984092 = 1.0;
        double r984093 = r984091 + r984092;
        double r984094 = r984090 * r984093;
        return r984094;
}
↓
double f(double x, double y) {
        double r984095 = x;
        double r984096 = y;
        double r984097 = 1.0;
        double r984098 = r984096 + r984097;
        double r984099 = r984095 * r984098;
        return r984099;
}

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 2020100 +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)))