Average Error: 0.0 → 0.0
Time: 749.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 r824032 = x;
        double r824033 = y;
        double r824034 = 1.0;
        double r824035 = r824033 + r824034;
        double r824036 = r824032 * r824035;
        return r824036;
}
↓
double f(double x, double y) {
        double r824037 = x;
        double r824038 = y;
        double r824039 = r824037 * r824038;
        double r824040 = 1.0;
        double r824041 = r824037 * r824040;
        double r824042 = r824039 + r824041;
        return r824042;
}

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