Average Error: 0.0 → 0.0
Time: 513.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 r703056 = x;
        double r703057 = y;
        double r703058 = 1.0;
        double r703059 = r703057 + r703058;
        double r703060 = r703056 * r703059;
        return r703060;
}
↓
double f(double x, double y) {
        double r703061 = x;
        double r703062 = y;
        double r703063 = r703061 * r703062;
        double r703064 = 1.0;
        double r703065 = r703061 * r703064;
        double r703066 = r703063 + r703065;
        return r703066;
}

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