Average Error: 0.0 → 0.0
Time: 6.6s
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 r25431480 = x;
        double r25431481 = y;
        double r25431482 = 1.0;
        double r25431483 = r25431481 + r25431482;
        double r25431484 = r25431480 * r25431483;
        return r25431484;
}
↓
double f(double x, double y) {
        double r25431485 = x;
        double r25431486 = y;
        double r25431487 = r25431485 * r25431486;
        double r25431488 = 1.0;
        double r25431489 = r25431488 * r25431485;
        double r25431490 = r25431487 + r25431489;
        return r25431490;
}

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 + 1 \cdot x\]

Reproduce

herbie shell --seed 2019168 +o rules:numerics
(FPCore (x y)
  :name "Data.Colour.RGBSpace.HSL:hsl from colour-2.3.3, B"

  :herbie-target
  (+ x (* x y))

  (* x (+ y 1.0)))