Average Error: 0.0 → 0.0
Time: 1.3s
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 r701982 = x;
        double r701983 = y;
        double r701984 = 1.0;
        double r701985 = r701983 + r701984;
        double r701986 = r701982 * r701985;
        return r701986;
}
↓
double f(double x, double y) {
        double r701987 = x;
        double r701988 = y;
        double r701989 = 1.0;
        double r701990 = r701988 + r701989;
        double r701991 = r701987 * r701990;
        return r701991;
}

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