Average Error: 0.0 → 0.0
Time: 10.3s
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 r139813584 = x;
        double r139813585 = y;
        double r139813586 = 1.0;
        double r139813587 = r139813585 + r139813586;
        double r139813588 = r139813584 * r139813587;
        return r139813588;
}
↓
double f(double x, double y) {
        double r139813589 = x;
        double r139813590 = y;
        double r139813591 = r139813589 * r139813590;
        double r139813592 = 1.0;
        double r139813593 = r139813589 * r139813592;
        double r139813594 = r139813591 + r139813593;
        return r139813594;
}

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