Average Error: 0.0 → 0.0
Time: 766.0ms
Precision: 64
\[x \cdot \left(y + 1\right)\]
↓
\[x \cdot y + x \cdot 1\]
x \cdot \left(y + 1\right)
↓
x \cdot y + x \cdot 1
double f(double x, double y) {
        double r988847 = x;
        double r988848 = y;
        double r988849 = 1.0;
        double r988850 = r988848 + r988849;
        double r988851 = r988847 * r988850;
        return r988851;
}
↓
double f(double x, double y) {
        double r988852 = x;
        double r988853 = y;
        double r988854 = r988852 * r988853;
        double r988855 = 1.0;
        double r988856 = r988852 * r988855;
        double r988857 = r988854 + r988856;
        return r988857;
}

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. Final simplification0.0

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

Reproduce

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