Average Error: 0.0 → 0.0
Time: 9.0s
Precision: 64
\[x \cdot \left(y + 1\right)\]
↓
\[y \cdot x + x \cdot 1\]
x \cdot \left(y + 1\right)
↓
y \cdot x + x \cdot 1
double f(double x, double y) {
        double r631729 = x;
        double r631730 = y;
        double r631731 = 1.0;
        double r631732 = r631730 + r631731;
        double r631733 = r631729 * r631732;
        return r631733;
}
↓
double f(double x, double y) {
        double r631734 = y;
        double r631735 = x;
        double r631736 = r631734 * r631735;
        double r631737 = 1.0;
        double r631738 = r631735 * r631737;
        double r631739 = r631736 + r631738;
        return r631739;
}

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. Simplified0.0

    \[\leadsto \color{blue}{y \cdot x} + x \cdot 1\]

  5. Final simplification0.0

    \[\leadsto y \cdot x + x \cdot 1\]

Reproduce

herbie shell --seed 2019306 
(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)))