Average Error: 0.0 → 0.0
Time: 1.1s
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 r964924 = x;
        double r964925 = y;
        double r964926 = 1.0;
        double r964927 = r964925 + r964926;
        double r964928 = r964924 * r964927;
        return r964928;
}
↓
double f(double x, double y) {
        double r964929 = x;
        double r964930 = y;
        double r964931 = r964929 * r964930;
        double r964932 = 1.0;
        double r964933 = r964929 * r964932;
        double r964934 = r964931 + r964933;
        return r964934;
}

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