Average Error: 0.0 → 0.0
Time: 5.4s
Precision: 64
\[x \cdot \left(y + 1\right)\]
↓
\[x \cdot y + 1 \cdot x\]
x \cdot \left(y + 1\right)
↓
x \cdot y + 1 \cdot x
double f(double x, double y) {
        double r520054 = x;
        double r520055 = y;
        double r520056 = 1.0;
        double r520057 = r520055 + r520056;
        double r520058 = r520054 * r520057;
        return r520058;
}
↓
double f(double x, double y) {
        double r520059 = x;
        double r520060 = y;
        double r520061 = r520059 * r520060;
        double r520062 = 1.0;
        double r520063 = r520062 * r520059;
        double r520064 = r520061 + r520063;
        return r520064;
}

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. Using strategy rm

  3. Applied distribute-lft-in0.0

    \[\leadsto \color{blue}{x \cdot y + x \cdot 1}\]

  4. Simplified0.0

    \[\leadsto x \cdot y + \color{blue}{1 \cdot x}\]

  5. Final simplification0.0

    \[\leadsto x \cdot y + 1 \cdot x\]

Reproduce

herbie shell --seed 2019325 +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)))