Average Error: 0.0 → 0.0
Time: 9.7s
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 r477916 = x;
        double r477917 = y;
        double r477918 = 1.0;
        double r477919 = r477917 + r477918;
        double r477920 = r477916 * r477919;
        return r477920;
}
↓
double f(double x, double y) {
        double r477921 = x;
        double r477922 = y;
        double r477923 = r477921 * r477922;
        double r477924 = 1.0;
        double r477925 = r477924 * r477921;
        double r477926 = r477923 + r477925;
        return r477926;
}

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 x \cdot y + \color{blue}{1 \cdot x}\]

  5. Final simplification0.0

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

Reproduce

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